{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D23","name":"Boundary Type-Coupling","shortDescription":{"text":"Boundary Type-Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D23"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"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":"ED4","name":"Outbox / dual-write","shortDescription":{"text":"Outbox / dual-write"},"helpUri":"https://codehealth.canine.dev/dimensions/ED4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"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":"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"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":"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":"turso_core::vdbe::explain::insn_to_row (cyclomatic 264): turso_core::vdbe::explain::insn_to_row has cyclomatic complexity 264 (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":"core/vdbe/explain.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"197784287a8a3c82878075251ae1efc5da3bea1b1162dc8bb19090e322e265ca"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::dialect::engine::resolve_builtin_function_name (cyclomatic 231): turso_core::dialect::engine::resolve_builtin_function_name has cyclomatic complexity 231 (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":"core/dialect/engine.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"056c8ea3fd1db15c622443f459ea79772576cdbe527b2897f18a31f8b708599b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::dialect::engine::call_builtin_scalar (cyclomatic 195): turso_core::dialect::engine::call_builtin_scalar has cyclomatic complexity 195 (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":"core/dialect/engine.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"8061a39aebf3e803f6c4f0e633af36fb1e957851bace0a734e2e4334aaf58e74"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_function (cyclomatic 173): turso_core::vdbe::execute::op_function has cyclomatic complexity 173 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":10010}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b13a4ca01c33c72af16cfe3939a76a6218cc0b8d3437ac6615a3385bb49f60"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::translate_alter_table (cyclomatic 165): turso_core::translate::alter::translate_alter_table has cyclomatic complexity 165 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"3484f4942d1be3ac0246b04623bb9963f1cdb345ca1302a000bf70e629dc2ead"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::translator::translate_function_call_expr (cyclomatic 136): turso_core::translate::expr::translator::translate_function_call_expr has cyclomatic complexity 136 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1508ff2e2a9614d4b2c1f6c5f2a18c0f73b590cc64faafa703ed808f271274e"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::pragma::query_pragma (cyclomatic 132): turso_core::translate::pragma::query_pragma has cyclomatic complexity 132 (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":"core/translate/pragma.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fcf876cdc34ed5fdec60bf8995c9106f7c1823798e8eda8963a80f95667d37"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::emitter::update::emit_update_insns (cyclomatic 129): turso_core::translate::emitter::update::emit_update_insns has cyclomatic complexity 129 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f102c179555deaa55902345d71a849a5083954c9c17787b65ad7e8051e8b46"}},{"ruleId":"D1","level":"warning","message":{"text":"Stmt::to_tokens (cyclomatic 124): Stmt::to_tokens has cyclomatic complexity 124 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5ca53a5c433a083ceecc6598714d25e0b689bb7581f4cbc1fb997f22c733fd"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_transaction_inner (cyclomatic 109): turso_core::vdbe::execute::op_transaction_inner has cyclomatic complexity 109 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":4529}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff46f715f95b4961a341c0f9cab4a513725792791429f40386087c78ababc07"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStateMachine::step_inner (cyclomatic 108): CheckpointStateMachine::step_inner has cyclomatic complexity 108 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31b3f0b7c794d61c11ef2810e78f71229094d9bed56d76d0932ac78dc061a85"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::pragma::update_pragma (cyclomatic 94): turso_core::translate::pragma::update_pragma has cyclomatic complexity 94 (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":"core/translate/pragma.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad358b8beacb4585ecd097e730f777fd7e9815b8bcabaced66b7d470db73a30"}},{"ruleId":"D1","level":"warning","message":{"text":"SequenceCorrectnessProperty::finish_op (cyclomatic 94): SequenceCorrectnessProperty::finish_op has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d49bddf3c4cfbcc90d57dccf1ed92d3d02c3fb1a098b90a00946cb8c262e5e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Property::interactions (cyclomatic 93): Property::interactions has cyclomatic complexity 93 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c087fd355c2b0d2458e8fa55f3254c80082787f57ab355f69990d71894004a"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::balance_non_root (cyclomatic 87): BTreeCursor::balance_non_root has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":3604}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c56314f8fb6a44440de14a3a5c51dfc8463e63a766d94ece779389fddcb2e97"}},{"ruleId":"D1","level":"warning","message":{"text":"Program::abort (cyclomatic 85): Program::abort has cyclomatic complexity 85 (threshold 15). Of this number, 82 points are the body\u0027s own statements and 3 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":"core/vdbe/mod.rs"},"region":{"startLine":3546}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3102c3512568fe053efdc28de1458836114e0f5c407ab58c6d599d35cfc8d8"}},{"ruleId":"D1","level":"warning","message":{"text":"CommitStateMachine::step (cyclomatic 83): CommitStateMachine::step has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"f523d5867fb3dfe0c3ca0b6f1ee28214597e2995fe9dffb0eff1fd44767b25ac"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseSyncEngine::apply_changes_internal (cyclomatic 83): DatabaseSyncEngine::apply_changes_internal has cyclomatic complexity 83 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc87f09ed46d1593f1406648cb413005173896c7a41904377666d490339f0555"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::insert::translate_insert (cyclomatic 81): turso_core::translate::insert::translate_insert has cyclomatic complexity 81 (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":"core/translate/insert.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc189db99c4d9b74b90f50db8ff07da4a2384867b4f518e436615d2664eea4f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::schema::create_table (cyclomatic 78): turso_core::schema::create_table has cyclomatic complexity 78 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":7144}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a15a219ebfc453a3df327bfe3346365b3af2ee3249a176da5029992cf5d95d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::upsert::emit_upsert (cyclomatic 71): turso_core::translate::upsert::emit_upsert has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/upsert.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a57d25f49fef5b46f61467c38efb4ab622c3af52cc72658c17c838890c19f2"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::recover_process_frame (cyclomatic 70): MvStore::recover_process_frame 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":"core/mvcc/database/mod.rs"},"region":{"startLine":9881}}}],"partialFingerprints":{"codehealthFindingId/v1":"965df74bd121165804bf32e539ea8740a08ab712255641a5cbd81f8dcc4eade1"}},{"ruleId":"D1","level":"warning","message":{"text":"InitLoop::emit (cyclomatic 68): InitLoop::emit has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/init.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"01eadbf6f2ebe66e82339a21f97c2becea5e44e32b6ac6613c6c9e222ddfb6a3"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::update_agg_payload (cyclomatic 68): turso_core::vdbe::execute::update_agg_payload has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":7441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e12ec6990bbdb0d978f8af2579855487e081bfb80fe689d1d87636a5f76dd46"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorSparseInvertedIndexMethodCursor::query_start (cyclomatic 66): VectorSparseInvertedIndexMethodCursor::query_start has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bf7f442737a0d730dc4efc48c8d692a7c1251f7c0cfb062298beb4fecee688"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeTable::to_sql_as (cyclomatic 66): BTreeTable::to_sql_as has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":6078}}}],"partialFingerprints":{"codehealthFindingId/v1":"e420ccacc37e8b1a32da5f86270712b12572e1c27fa89a89a974541bb4b1e208"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::translate_statement (cyclomatic 66): turso_core::translate::translate_statement has cyclomatic complexity 66 (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":"core/translate/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e34cb6c9cf5a044dda5e66817c3fb4396836c7884c41dfa3584d3efe185cf60"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::binding::bind_and_rewrite_expr (cyclomatic 66): turso_core::translate::expr::binding::bind_and_rewrite_expr has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binding.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78ce41adeb2dc8e5c0d6870bb3d27bd4435bc8d65ce682a557a846db7366c3c"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::select::prepare_one_select_plan (cyclomatic 65): turso_core::translate::select::prepare_one_select_plan has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/select.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"902a4179defc0bfa046dc2933115001b01dd4e606632494e84f28542569de6be"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::functions::validate_pg_input (cyclomatic 65): turso_pg::functions::validate_pg_input has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/functions.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb62e234995df57b7bf1e958ee4c0bc923274d3c011150bc9e94c6bccf219dc"}},{"ruleId":"D1","level":"warning","message":{"text":"Jsonb::navigate_to_segment (cyclomatic 64): Jsonb::navigate_to_segment has cyclomatic complexity 64 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af04920a1a402b47cfbf77ea3cdf8d875f43be068c6e7bd7f6a20edb8ecca4e"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_expr (cyclomatic 64): PostgreSQLTranslator::translate_expr has cyclomatic complexity 64 (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":"postgres/parser/translator.rs"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"043d1188236a36a2e17db00b2129151c87664a99ff2a9d3ee96ea19f37645429"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandTag::of (cyclomatic 62): CommandTag::of has cyclomatic complexity 62 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: CommandTag::name (cyclomatic 76) 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":"postgres/parser/cmdtag.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe5bab756fef99f62b4e2006531f9f029114bc8c7dbe983c5b4d4296d386790"}},{"ruleId":"D1","level":"warning","message":{"text":"Jsonb::deserialize_string (cyclomatic 60): Jsonb::deserialize_string has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90bd04e3aa394e3f4314f10b4c72cc919b7b69f7a7d388ac524892976e7671c"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::post_balance_non_root_validation (cyclomatic 60): BTreeCursor::post_balance_non_root_validation has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":4991}}}],"partialFingerprints":{"codehealthFindingId/v1":"f848c3f50d8136f6f66352c6bd33ac5b95c5afda94e846913b2376960fc9bfe8"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::vectors::expr_vector_size (cyclomatic 60): turso_core::translate::expr::vectors::expr_vector_size has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/vectors.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5b57af824b36fbabdc24d432ef098e1f80b6d118d2e571d392750a7c0a3f60"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::constraints_from_where_clause (cyclomatic 59): turso_core::translate::optimizer::constraints::constraints_from_where_clause has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb5f8e61a7b3ba206876e94bd780ef216a6b264d47ccf6aef1376e358e08efb"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_insert (cyclomatic 59): turso_core::vdbe::execute::op_insert has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":11687}}}],"partialFingerprints":{"codehealthFindingId/v1":"2907003545b9d01d70df8fd7b714746f1a06b26274c97a5ed6a5f204a0c2978d"}},{"ruleId":"D1","level":"warning","message":{"text":"Limbo::handle_dot_command (cyclomatic 58): Limbo::handle_dot_command has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/app.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f0951696040837936bf03a1e5b2c4812e2c6c9956202084cc37498fba4c9a6"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::datetime::exec_strftime (cyclomatic 58): turso_core::functions::datetime::exec_strftime has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1456597fb1ad79f126bb956ad97a54fdb4f7dd1448c128ca40b72b4c2dda5963"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::join::join_lhs_and_rhs (cyclomatic 55): turso_core::translate::optimizer::join::join_lhs_and_rhs 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":"core/translate/optimizer/join.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"b594d60515bfea170c632106864d3310b9dc0a266fb7235823383cff2e7e1d20"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::vacuum::vacuum_target_build_step (cyclomatic 54): turso_core::vdbe::vacuum::vacuum_target_build_step has cyclomatic complexity 54 (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":"core/vdbe/vacuum.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49a2ce70a1a93da474f71e864297a19d70915255254e529e14b26c20225388e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::next_token (cyclomatic 54): Parser::next_token has cyclomatic complexity 54 (threshold 15). Of this number, 53 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44d3dadf542f9847b36387e11937183267bf4fff132b912c8bdd01a4d1e3cf8"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::apply_table_access_plan (cyclomatic 53): turso_core::translate::optimizer::apply_table_access_plan has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f356cd3a1321894f9fea424808c0f19bc52d2cf874ed689f48d482c22f49eb"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::is_nonnull (cyclomatic 53): Expr::is_nonnull has cyclomatic complexity 53 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":4007}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cc8ce649bea86d452d00d71dee9496c65fa4b2ad3fcb924b658d2dd10eec9e"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_gen::generate::select::generate_select_impl_inner (cyclomatic 53): sql_gen::generate::select::generate_select_impl_inner has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb7dcb0b56d8c1093f8705a8cb3cdb3f5d1f27bc936ef65ffac2f385da38a2a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_stress::async_main (cyclomatic 52): turso_stress::async_main has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/stress/main.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c9728767ca93d00070148510f5de0101037b98bb4920bcf9d3f11c47318c45"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::value::pattern_compare (cyclomatic 51): turso_core::vdbe::value::pattern_compare has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/value.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d4ec2497b4fa2ef89c09e5fe7ac03d7eacebd78bd1b0ddcbf22eb9a96e1425"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::to_tokens (cyclomatic 51): Expr::to_tokens has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"405c0c9c4ff8af43ef3869b7af8f26adf2ead5a144a75b6aa8713378deb645ed"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_alter_column (cyclomatic 50): turso_core::vdbe::execute::op_alter_column has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":16956}}}],"partialFingerprints":{"codehealthFindingId/v1":"80375580698d69bb73808393fbf8268ca24560c23e4924406dd6bb1f4ad05a77"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::schema::resolve_check_expr_type (cyclomatic 49): turso_core::translate::schema::resolve_check_expr_type has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb373de93e9a8855c3268519f507a40b08a8ff1ec58de5095fe2d235f9c19be"}},{"ruleId":"D1","level":"warning","message":{"text":"CommitStateMachine::step_build_log_record (cyclomatic 48): CommitStateMachine::step_build_log_record has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96b9f15782ea4fbf0104f02892a6955cae2ea5e3e5e9b7dded23ff449e02594"}},{"ruleId":"D1","level":"warning","message":{"text":"Jsonb::deserialize_number (cyclomatic 47): Jsonb::deserialize_number 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":"core/json/jsonb.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"81255fee9e2f23b75dc447f9777d38ffdaa4238aaf998a63c0092f0e3885f93f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::datetime::parse_arithmetic_modifier (cyclomatic 47): turso_core::functions::datetime::parse_arithmetic_modifier 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":"core/functions/datetime.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8b02869e0954d4345ba9459cda31eb90b80d66fd29ab5ece134af00b857368"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::inverse_agg_payload (cyclomatic 47): turso_core::vdbe::execute::inverse_agg_payload 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":"core/vdbe/execute.rs"},"region":{"startLine":8995}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbb04c261331db949d0f80f649c377f33ba19d23de6989751abac0983a6bc5f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_whopper::allocation_fault::allocation_site_id (cyclomatic 47): turso_whopper::allocation_fault::allocation_site_id 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":"testing/concurrent-simulator/allocation_fault.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b70731323764aea0e87d328078450ff2f5da45907fcf4bbaf9ea3636ae6de3"}},{"ruleId":"D1","level":"warning","message":{"text":"FtsCursor::drive_open (cyclomatic 46): FtsCursor::drive_open has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/fts/mod.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f8d31039fbf39bd3027e8c74d722d4c0289a405bd9bd3eb121745954d31a84"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::walk::walk_expr (cyclomatic 46): turso_core::translate::expr::walk::walk_expr has cyclomatic complexity 46 (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 shape REPEATS in the file: one other method here (turso_core::translate::expr::walk::walk_expr_mut) 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":"core/translate/expr/walk.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafeb79cb1e6962bcc5a04f117ed5ce4b4a5d6835b493e99c1211212dd651e89"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::walk::walk_expr_mut (cyclomatic 46): turso_core::translate::expr::walk::walk_expr_mut has cyclomatic complexity 46 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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 shape REPEATS in the file: one other method here (turso_core::translate::expr::walk::walk_expr) 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":"core/translate/expr/walk.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"e783364bbe38699be24833a97242aadb0d25cf1137c89a612e33790a7a161aa5"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::roles::check_statement_privileges (cyclomatic 46): turso_core::translate::roles::check_statement_privileges has cyclomatic complexity 46 (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":"core/translate/roles.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a697cb6e3114fce9d3701b36c687b1035687300c4d324ccf35785d79046f32"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::vacuum::vacuum_in_place_step (cyclomatic 46): turso_core::vdbe::vacuum::vacuum_in_place_step has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/vacuum.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb6c2b6825845d4fc25814826f2dcbafb4eb94f6576d3b6cc20cad63a817db4"}},{"ruleId":"D1","level":"warning","message":{"text":"Generated::parse (cyclomatic 46): Generated::parse has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/dump-fuzzer/src/summary.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fffabafa5c9128a7a2851eee6534940f979d4438ac2f824937f6f374aae25b43"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::build_select_plan_dag (cyclomatic 45): turso_core::incremental::vdbe_maintenance::plan::build_select_plan_dag has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1c0c5ae4863c60991f392c9767ea5a294759f9b35ddb49440de6b94bf2cd33"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::storage::btree::integrity_check (cyclomatic 45): turso_core::storage::btree::integrity_check has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":8405}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c5538523e22928cb37c34ea10a66dffff9a5d790a27655d3d3154f40c9e7f5"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::try_match_index_method_pattern (cyclomatic 45): turso_core::translate::optimizer::try_match_index_method_pattern has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"44be644dc291767670e5d2058afdb0910c72cc93e340b4ce749837335880dc00"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::join::compute_best_join_order_with_context (cyclomatic 45): turso_core::translate::optimizer::join::compute_best_join_order_with_context has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/join.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a459c7804969a8a7e74aa4cbb8a1c37c95b9df0c1d6ad086f0e0ce2cac1bacd"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::schema::translate_create_table (cyclomatic 45): turso_core::translate::schema::translate_create_table has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2004194f55ce5ab7fea427c2db89fc44eaf65399d66f63ab619a7874770509"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::seek_internal::inner (cyclomatic 45): turso_core::vdbe::execute::seek_internal::inner has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":6667}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe8fd66c6124494197d427c89ab7a3effe54885d4baf2d850bcf55091a17458"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::error::parse_error_sqlstate (cyclomatic 45): turso_pg::error::parse_error_sqlstate has cyclomatic complexity 45 (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":"postgres/frontend/error.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3062497149846600bef393b655dd3cd6fe3ae4dec72777ff8b299171d5aa1f"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::meta_command (cyclomatic 45): Session::meta_command has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/regress/main.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"95da50a4e3d00de2bf7825183bb784dc55b08a9dbb8f745566ff7f2310b9a6ba"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::json::jsonb::validate_element (cyclomatic 44): turso_core::json::jsonb::validate_element 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":"core/json/jsonb.rs"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e1ae182a12fe73308c2cd9849a1a9652d7384bdf5235d5b164106468722b25"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::binary::emit_binary_condition_insn (cyclomatic 44): turso_core::translate::expr::binary::emit_binary_condition_insn 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":"core/translate/expr/binary.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7712cbd66bf2694109f2afcae1fd2b5dddb80ae7ff9b4b580f37ef80aff4fd"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::classes::translate_catalog_changes (cyclomatic 44): turso_pg::classes::translate_catalog_changes 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":"postgres/frontend/classes.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e86dd91a80bd181dc42ac97bf6a193a91bdb8de25e35b14827082d3b5c2f44"}},{"ruleId":"D1","level":"warning","message":{"text":"Jsonb::serialize_string (cyclomatic 42): Jsonb::serialize_string 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":"core/json/jsonb.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71d220524720f7f2e75a94a555b26bd3546a1e4b7e637d8bfad2321a2054eb4"}},{"ruleId":"D1","level":"warning","message":{"text":"Pager::commit_wal_inner (cyclomatic 42): Pager::commit_wal_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":"core/storage/pager.rs"},"region":{"startLine":4545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8880b46f625cf64f93754bd2a0dec81a32ad5b3cca3f7c241b0a7281e6883c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner::feed_line (cyclomatic 42): Scanner::feed_line 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":"postgres/regress/main.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e12f17a3790fefa1acf58c2ddb253e4aa2c58c0b4287bda3550747f6244c2a2"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::is_constant (cyclomatic 42): Expr::is_constant 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":4117}}}],"partialFingerprints":{"codehealthFindingId/v1":"600bd854028bfb4d5a60c1b1434617b19987b36ff7c4d7d13940adb947f2d8f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::header_validation (cyclomatic 41): Database::header_validation has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc247d923dff438a96e10cf4c106418d9df3554410b9415ab97a3dfcb54b12f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::translator::translate_column_expr (cyclomatic 41): turso_core::translate::expr::translator::translate_column_expr has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb35652a0f7efb6d90bbbfe2b8ff1615fb7fdbfa7228e550749d11b3a6f9182"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::util::exprs_are_equivalent (cyclomatic 41): turso_core::util::exprs_are_equivalent has cyclomatic complexity 41 (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":"core/util.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba62494efea4e31ae8af6d8f400cd1172ebb321c2331b13586a1d332d153e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_window_step (cyclomatic 41): turso_core::vdbe::execute::op_window_step has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37d36f4136e1f435377c415c4bce108793df25573081b1730b2a0dd148a10f2"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::condition::translate_leaf_condition_expr (cyclomatic 40): turso_core::translate::expr::condition::translate_leaf_condition_expr has cyclomatic complexity 40 (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":"core/translate/expr/condition.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dfcf38f65a882acb25e1b59319e3b8b3a58d4da5b5f4fd772fce7694e99ce6"}},{"ruleId":"D1","level":"warning","message":{"text":"limbo_fuzzy::editdist::edit_distance (cyclomatic 40): limbo_fuzzy::editdist::edit_distance has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/fuzzy/src/editdist.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7d67f8b4ef3180479c6151c625307f6061909c9024e626ad95bcb46e1cb846"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_primary_expression (cyclomatic 40): Parser::parse_primary_expression has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"a107269e412f2f4cb013646f1f3b896aa3aa468a9a80fd8a22af2d6bb38fb6e5"}},{"ruleId":"D1","level":"warning","message":{"text":"Property::get_extensional_query_gen_function (cyclomatic 40): Property::get_extensional_query_gen_function has cyclomatic complexity 40 (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":"testing/simulator/generation/property.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cda85a0fcb06975135c172c84d96591faa3948b2144df1e731a992890c6d5b"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::delete (cyclomatic 39): BTreeCursor::delete 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":"core/storage/btree.rs"},"region":{"startLine":7041}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9207f883e88e6acf8348fb9e88a6e7333fbd7d805b67231490cf3294a028431"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::json::jsonb::unescape_string (cyclomatic 39): turso_core::json::jsonb::unescape_string 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":"core/json/jsonb.rs"},"region":{"startLine":4083}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbaf1122f874c1c62af3ca0aa0f4a7048f8f99c1769c5bed7a4d1c7f6fbde42"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::subquery::get_subquery_parser (cyclomatic 39): turso_core::translate::subquery::get_subquery_parser 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":"core/translate/subquery.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"798859f33a5678a9506a32993c0490e0c8878ad9e4c1d9150991d1d083288d00"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::finalize_agg_payload (cyclomatic 39): turso_core::vdbe::execute::finalize_agg_payload 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":"core/vdbe/execute.rs"},"region":{"startLine":8098}}}],"partialFingerprints":{"codehealthFindingId/v1":"33db3ddc063bbad141a33bf1a7184b979e044ca596f40fc93db6f143533d3704"}},{"ruleId":"D1","level":"warning","message":{"text":"ShadowTablesMut::apply_snapshot (cyclomatic 39): ShadowTablesMut::apply_snapshot 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":"testing/simulator/runner/env.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a95cb5f873a45d46a36d4f2f754af25d9858a41e2f71a72c869f019dd33b508"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_rename_table (cyclomatic 38): turso_core::vdbe::execute::op_rename_table 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":"core/vdbe/execute.rs"},"region":{"startLine":16455}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a9c2090cf14230f816de9ae2ae3b9cc4a5af4fb2fce2da91792d80e9f9a1fe"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::datetime::parse_modifier (cyclomatic 37): turso_core::functions::datetime::parse_modifier 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":"core/functions/datetime.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5079a1a74fd20f913f03ad7d4cc9acc7ec451fb29d68d6709af5c90ea2254dd"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::aggregation::translate_aggregation_step (cyclomatic 37): turso_core::translate::aggregation::translate_aggregation_step 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":"core/translate/aggregation.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7b9f6f89601057577f04bd3b02c61dee9a475d30f7999133a40fd464f83a00"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::build_seek_def (cyclomatic 37): turso_core::translate::optimizer::build_seek_def 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b497539ce1aaeb959f020451a76b01210f0a356a5ee4c15a395158feaa93f7d3"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_binary_expr (cyclomatic 37): PostgreSQLTranslator::translate_binary_expr 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":"postgres/parser/translator.rs"},"region":{"startLine":3894}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb8ee1b7c8d7df2b119586bd42cb247b8168c0cc582de6663ad1bb7b8cec7ec"}},{"ruleId":"D1","level":"warning","message":{"text":"Whopper::perform_work (cyclomatic 37): Whopper::perform_work 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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"9929c271635e50c26eba5dfca169b45fb2be21ad2a6e7dd964955ed3299c7247"}},{"ruleId":"D1","level":"warning","message":{"text":"turso-sql-split.transition (cyclomatic 37): turso-sql-split.transition 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":"bindings/javascript/turso-sql-split.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b80bfc3607023d307c0c73820f9368f78485ef173eea149758edb045a0721a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::emitter::select::build_materialized_build_input_plan (cyclomatic 36): turso_core::translate::emitter::select::build_materialized_build_input_plan 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":"core/translate/emitter/select.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cf533fc57bb4e3d2f73add0a81af829060c48ed9c43e1685f9c255d9b434ab"}},{"ruleId":"D1","level":"warning","message":{"text":"Session.batch (cyclomatic 36): Session.batch has cyclomatic complexity 36 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 9 belong to 5 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":"serverless/javascript/src/session.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bb020c53960171c59e40ac8b28e685989b4de0b0c74cc035a8463bdc378aae3"}},{"ruleId":"D1","level":"warning","message":{"text":"LimboColor::try_from (cyclomatic 35): LimboColor::try_from has cyclomatic complexity 35 (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":"cli/config/palette.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba53b7beb3ee5b8f95d45a2115b60b070207f364916b5957aa469a2c84ce6689"}},{"ruleId":"D1","level":"warning","message":{"text":"FtsCursor::query_start (cyclomatic 35): FtsCursor::query_start has cyclomatic complexity 35 (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":"core/index_method/fts/mod.rs"},"region":{"startLine":3216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ef756c6295ea9494661ee773d5a32757b68fd57a61f4b9456aa2b490913a90"}},{"ruleId":"D1","level":"warning","message":{"text":"Pager::checkpoint_inner (cyclomatic 35): Pager::checkpoint_inner has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":5066}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e3eb342919212a226b18a5bfd33ac092d438d285d4819deeba20c97522cecd"}},{"ruleId":"D1","level":"warning","message":{"text":"ProgramState::end_statement (cyclomatic 35): ProgramState::end_statement has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"67127cb87effaa0df6c87a1ec13eb94ab83904252c913e2bd724a06386744af9"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::aggregate::emit_group_aggregate_rows (cyclomatic 35): turso_core::incremental::vdbe_maintenance::aggregate::emit_group_aggregate_rows has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58a2447df2c02c126f983c69791d23fb3d771911a3a6c79855e74ffa793c699"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::translator::map_pg_type (cyclomatic 35): turso_pg_parser::translator::map_pg_type has cyclomatic complexity 35 (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":"postgres/parser/translator.rs"},"region":{"startLine":6329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bc5abf00223bf2c1ee7a5115eb0a6d737759ba1a74bb640096d3e652f06100"}},{"ruleId":"D1","level":"warning","message":{"text":"promise.executeBatch (cyclomatic 35): promise.executeBatch has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 15 of the 35 points are its own statements and the rest belongs to 3 function items inside it that branch (executeStatement, runRawSql, a function literal at line 764). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdef1872874681881d6d9cdef964c0b64a81397fb65d57410b1325fc29bd37bb"}},{"ruleId":"D1","level":"warning","message":{"text":"CommitStateMachine::populate_portable_changes (cyclomatic 34): CommitStateMachine::populate_portable_changes 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":"core/mvcc/database/mod.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"96de916b4ba1f98a7e1cc71d777d3a550fd098939fb86e860eeae841eb0be75e"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::maybe_complete_interrupted_checkpoint_nonblock (cyclomatic 34): MvStore::maybe_complete_interrupted_checkpoint_nonblock 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":"core/mvcc/database/mod.rs"},"region":{"startLine":9179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e59ac5621841082d395ced6054b7e97ea85fbd76a8f79281b4f4f184ab45563"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::validate_planned_node (cyclomatic 34): turso_core::incremental::vdbe_maintenance::plan::validate_planned_node 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":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeae0267668b7b72ffa31693daf0ff8e0dd396d6aa4f858f8efd69cee7d506eb"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::numeric::str_to_f64 (cyclomatic 34): turso_core::numeric::str_to_f64 has cyclomatic complexity 34 (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":"core/numeric/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"b65465ec45684e55273850b7bad67060ba63df3c7c88f1a06e0849b313867ee4"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_savepoint (cyclomatic 34): turso_core::vdbe::execute::op_savepoint 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":"core/vdbe/execute.rs"},"region":{"startLine":5455}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb50c4638a70eea4d7efe0f254349b41c486bbbbabd2598f3d20006a1411457"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::validate (cyclomatic 34): Parser::validate 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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a630c498032a3e5a6264d426780d53e4087fe24a84ef4af462b4eee472193c0"}},{"ruleId":"D1","level":"warning","message":{"text":"sqltest::run_tests (cyclomatic 34): sqltest::run_tests 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":"testing/sqltest/src/main.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"de51d6297622fe6c44d38c4e16fcd2f87a122d8c7c3df533bae6ab7b1849d2eb"}},{"ruleId":"D1","level":"warning","message":{"text":"page_diff.main (cyclomatic 34): page_diff.main 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":"scripts/corruption-debug-tools/page_diff.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fecabb94576f98241c3cc984a141f5472c9f0fdf41ba72cde2762d1e001a42c"}},{"ruleId":"D1","level":"warning","message":{"text":"TursoSyncDb.handleIoItem (cyclomatic 34): TursoSyncDb.handleIoItem 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":"bindings/go/driver_sync.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e0f56eb76ae6d2e6fd9eea45dc682ac679fa617ce7f0c337b3d5f69cb9b3a6"}},{"ruleId":"D1","level":"warning","message":{"text":"cursorDecoder.feed (cyclomatic 34): cursorDecoder.feed 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":"serverless/go/session.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f33b3076fce8ebe89b437a882d3dacd1d4b50fcc690ca3f47581fe6e3de73b"}},{"ruleId":"D1","level":"warning","message":{"text":"EqpDetail::fmt (cyclomatic 33): EqpDetail::fmt has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/eqp.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b89a5f0f49f29239fbfb921a5706e67fc98141c672f2151b5b709b4d53716cd"}},{"ruleId":"D1","level":"warning","message":{"text":"Program::normal_step::dispatch_loop (cyclomatic 33): Program::normal_step::dispatch_loop has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":2635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f87f3a7ff71fec7bc85728407cd3b3d579f036fdfb3ee2de06e5ba47b94d85d7"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::datetime::exec_timediff (cyclomatic 33): turso_core::functions::datetime::exec_timediff has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f71b94c62eecfcab5cd71a37718acdcc684639dd225b45ddb37eb240a23c85"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::schema::validate_generated_expr (cyclomatic 33): turso_core::schema::validate_generated_expr has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":6986}}}],"partialFingerprints":{"codehealthFindingId/v1":"2db3dc3363f19d6b736496d3140983a8e2d4f093d608f97d99c4aecb285de023"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::affinity::try_for_float (cyclomatic 33): turso_core::vdbe::affinity::try_for_float has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/affinity.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad5cdd95c480847f642cef4d3fc9a60db64f9061a792ee016ff2f5c79c0ecbe"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::halt (cyclomatic 33): turso_core::vdbe::execute::halt has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":3593}}}],"partialFingerprints":{"codehealthFindingId/v1":"40188d3a7b92c1a859cef714284ec1ce2a937663a3f248b7f74af5733be4a939"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_window_value (cyclomatic 33): turso_core::vdbe::execute::op_window_value has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8621}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab8688b6eae83debd10617f6d729c2de278bdc3b8289f66ef723b46b3b7f67dc"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::functions::format_type (cyclomatic 33): turso_pg::functions::format_type has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/functions.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4abc65fe039e9831cd1304f95a5d45d9703fed205364a9a0ca7c85ea36b4f1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_create_type (cyclomatic 33): Parser::parse_create_type has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":4917}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1945e0ee57695b56e111b552241ad06e27a6f354b363fce7f45d0d148454fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"WalFile::checkpoint_inner (cyclomatic 32): WalFile::checkpoint_inner 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":"core/storage/wal.rs"},"region":{"startLine":5001}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae00ddba421540a10aa0fb122bf769e3138c4e70806b026cf830f1cd65e1ec1"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::main_loop::open::emit_table_read_start (cyclomatic 32): turso_core::translate::main_loop::open::emit_table_read_start 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":"core/translate/main_loop/open.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"b354660001035bbdf360442de2687e27fc994ac879fb756b03c452fb155f5a31"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::schema::translate_drop_table (cyclomatic 32): turso_core::translate::schema::translate_drop_table 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":"core/translate/schema.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88054e2345852fa2b5ab761822f04b77fd7bff32028c9b6624c1b75406fdace"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_auto_commit (cyclomatic 32): turso_core::vdbe::execute::op_auto_commit 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":"core/vdbe/execute.rs"},"region":{"startLine":5220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea44fb72b59cdd53fd5fd97af1fb54398af8dc5c77796682a8c94e18acb421a5"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::translator::try_extract_copy_from (cyclomatic 32): turso_pg_parser::translator::try_extract_copy_from 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":"postgres/parser/translator.rs"},"region":{"startLine":8491}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2d00f82a05133e89861b00a110d3738657b233fdc9dab1c69d5e1163bf9bd5"}},{"ruleId":"D1","level":"warning","message":{"text":"Lexer::next (cyclomatic 32): Lexer::next has cyclomatic complexity 32 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/lexer.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b91fd062a1d632eca148bfb8f52eacf26432f3ba1dc94f72e9e9800b15774f"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedSqliteStatementParser.Parse (cyclomatic 31): ManagedSqliteStatementParser.Parse 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":"bindings/dotnet/src/Turso.Data.Sqlite/ManagedSqliteStatement.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5236c94128561cc899a6e4d3241d548227a66b39cf862a99ff95cdeb68fefd6e"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamingLogicalLogReader::parse_next_portable_changes_frame (cyclomatic 31): StreamingLogicalLogReader::parse_next_portable_changes_frame 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed584e2041e4821679f90dd01f04f313f0a3368ecca9f981f73fef06d62c6b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::printf::exec_printf_values (cyclomatic 31): turso_core::functions::printf::exec_printf_values 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":"core/functions/printf.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3654c50455652675708e30c8636100e683a4d517d2b77e5bb8d65874088e1ae3"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::apply_expr_column_ref_with_context (cyclomatic 31): turso_core::translate::alter::apply_expr_column_ref_with_context 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":"core/translate/alter.rs"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e7bf89cac91180e050ff166f1d5d02f2e55b18e99d7a07777408acf8541411"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::emitter::select::emit_query (cyclomatic 31): turso_core::translate::emitter::select::emit_query has cyclomatic complexity 31 (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":"core/translate/emitter/select.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5419799e7360feefdb758585c92f2aa5d20dc682bf9bb441089d78b4bc6067"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::integrity_check::translate_integrity_check_for_schema (cyclomatic 31): turso_core::translate::integrity_check::translate_integrity_check_for_schema 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":"core/translate/integrity_check.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5141bf282a30ca55304e016e24a8c22269e68e68aa04852f5ea8e4e1b7abcf02"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::planner::parse_table (cyclomatic 31): turso_core::translate::planner::parse_table 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":"core/translate/planner.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83df4dbeeaa9672ad1fbbd1e7460488245d26378f4242c9a2944d4fd3ab66ab"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vector::operations::convert::vector_convert (cyclomatic 31): turso_core::vector::operations::convert::vector_convert has cyclomatic complexity 31 (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":"core/vector/operations/convert.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b5f369b1ca441e52d545156babfa636e1897737a73ddb2dde285333f5d16f7"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_data_type (cyclomatic 31): Parser::parse_data_type 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":"postgres/parser/parser.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb0b7632d8de9e6d879e34249f3c2f7537ed7b68add65e82bc0a5617400af1a"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiprocessWhopper::perform_work (cyclomatic 31): MultiprocessWhopper::perform_work 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":"testing/concurrent-simulator/multiprocess.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e0cc3d9b88dda0d9675ca495a19c9b6620136d0ca60acf197d8aba8c8a1c07"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::maybe_recover_logical_log (cyclomatic 30): MvStore::maybe_recover_logical_log 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":"core/mvcc/database/mod.rs"},"region":{"startLine":9609}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77e899d2fb1e53da5752db4cb5e51d29907b84840e76e6550260cab8d0a4b22"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema::handle_schema_row (cyclomatic 30): Schema::handle_schema_row 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":"core/schema.rs"},"region":{"startLine":4281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5384c3b0d3fd24e431c63f5c985f3484ff627f338a177e6d6ebb221c5fe4db"}},{"ruleId":"D1","level":"warning","message":{"text":"EmitWindow::emit_window_step (cyclomatic 30): EmitWindow::emit_window_step 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":"core/translate/window.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f964f3f8b566843112212ae9644002179c4c647191f80e610577fb449e77dca"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::binary::emit_binary_insn (cyclomatic 30): turso_core::translate::expr::binary::emit_binary_insn has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binary.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb90f702740f558a7ef9a6a52992b7996aa444b71ef17e9337e93aef478e17a0"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::index::translate_create_index (cyclomatic 30): turso_core::translate::index::translate_create_index 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":"core/translate/index.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb9a32adfcad004e8a701b6d6ffc98431721361098cb83a98d4a66b66a7dba3"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::schema::validate (cyclomatic 30): turso_core::translate::schema::validate 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":"core/translate/schema.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f36b328e198ebac99140b83e25684a6226f7168aa8712cb1c0d82b2d9e6b58b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::array::parse_pg_text_array (cyclomatic 30): turso_core::vdbe::array::parse_pg_text_array 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":"core/vdbe/array.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f64fe7f61d0c420eacd8a71fbd014dd602490c071294d60162647ea85691757"}},{"ruleId":"D1","level":"warning","message":{"text":"CsvVTabModule::create (cyclomatic 30): CsvVTabModule::create 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":"extensions/csv/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c6979653cc22fefbe1778d77d0128187f82419ac03e359ee5b7668f16539ec2"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_create_table (cyclomatic 30): PostgreSQLTranslator::translate_create_table 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":"postgres/parser/translator.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae21b14b9dc2fc2d2d484c2fc873486d4a246c215dcc41cfc5c3532690c65d12"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_create_table_column (cyclomatic 30): PostgreSQLTranslator::translate_create_table_column 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":"postgres/parser/translator.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc78391ad89cfa09ec25da23bba82b8fcf9c09d6106eac38c903a08d108e10b"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_test_or_snapshot (cyclomatic 30): Parser::parse_test_or_snapshot 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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d727909116d7b0247860ba3101d4c4bd06aa07310934a2da4883b3beba1e9f71"}},{"ruleId":"D1","level":"warning","message":{"text":"track_rowid.main (cyclomatic 30): track_rowid.main 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":"scripts/corruption-debug-tools/track_rowid.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d742c06c03b80eb4175b38d3ab4d1ca05bbc96e606111bdb4ce99cd7b4a4381d"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::destroy_btree_contents (cyclomatic 29): BTreeCursor::destroy_btree_contents 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":"core/storage/btree.rs"},"region":{"startLine":5606}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f00f2a58accfaefa986f014980af01fd18553846500be27fe683efdc3a41b15"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenLoop::emit (cyclomatic 29): OpenLoop::emit 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":"core/translate/main_loop/open.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17a39e69bc290ea19855d69139bc115cff931381a7ee6ac6e56a5c7aeb1fbca"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::exec_math_unary (cyclomatic 29): Value::exec_math_unary 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":"core/vdbe/value.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"164e054374af340e72edc5b9665e285ee8459a68e7bcf6a138073c3f2cc63c67"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::printf::format_general_inner (cyclomatic 29): turso_core::functions::printf::format_general_inner 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":"core/functions/printf.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1db3947dcc84376c4a2a991a2dcda3d9620251aa233277efc882c353fd7feb"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::expr_type::type_of (cyclomatic 29): turso_core::translate::expr::expr_type::type_of 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":"core/translate/expr/expr_type.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3ed7c1199ff048961f260173aa01447aacdb4393b3399995085d5e245ef480"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::window::emit_window_op (cyclomatic 29): turso_core::translate::window::emit_window_op 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":"core/translate/window.rs"},"region":{"startLine":2859}}}],"partialFingerprints":{"codehealthFindingId/v1":"25be6361d7b3fa9bd71a2c64dbcad956d679378e6ec609d7b65bfd3834b0f4c3"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_agg_step (cyclomatic 29): turso_core::vdbe::execute::op_agg_step 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":"core/vdbe/execute.rs"},"region":{"startLine":9229}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e1998c41590f275dc208445b10c3f195a7f2a1fd04e2d33519be283428395b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_macros::atomic_enum::derive_atomic_enum_inner (cyclomatic 29): turso_macros::atomic_enum::derive_atomic_enum_inner 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":"macros/src/atomic_enum.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a2ebb70c181afd5c101bc50369b0199d6264cd140b2cba824c9f4c044bbb0"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_alter_table (cyclomatic 29): PostgreSQLTranslator::translate_alter_table 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":"postgres/parser/translator.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"382b9b557841d2d28a84eedd8ec4e2ecac8531faea44771828e191622a50b41e"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::decode_raw_mvcc_logical_log_to_file (cyclomatic 29): turso_sync_engine::database_sync_operations::decode_raw_mvcc_logical_log_to_file 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c65fae96e703408313df91ffd4b9a9443b5dcbe0c8bd7084e558f36dc5fcb27"}},{"ruleId":"D1","level":"warning","message":{"text":"ImportFile::import_csv (cyclomatic 28): ImportFile::import_csv 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":"cli/commands/import.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a805a789a1f922a8020d40365e536e13ff027479aabe072dfbc7c1b01593ac4a"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::delete_from_table_or_index (cyclomatic 28): MvStore::delete_from_table_or_index has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":5647}}}],"partialFingerprints":{"codehealthFindingId/v1":"33522591af124ca827547465e59f1b47d85c8b7b79ab8fdf875ceb019a75dc3f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::storage::btree::free_cell_range (cyclomatic 28): turso_core::storage::btree::free_cell_range 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":"core/storage/btree.rs"},"region":{"startLine":9797}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03152b85a8290828a43b309f7f9a74e4dd98ce7dbd03aade15f173b02a10079"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::try_rewrite_single_value_aggregate (cyclomatic 28): turso_core::translate::optimizer::unnest::try_rewrite_single_value_aggregate has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/unnest.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a00ab2fde2685fc85de4e064613457a714f553100e75b36a4774f92f7628994"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::decode_serial_type_into_register (cyclomatic 28): turso_core::vdbe::decode_serial_type_into_register 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":"core/vdbe/mod.rs"},"region":{"startLine":4389}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff8e480f5a28a0066b58e09625bf25753e9bf1cafef6e1cd014486b93c0dd3f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_vacuum_into_inner (cyclomatic 28): turso_core::vdbe::execute::op_vacuum_into_inner 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":"core/vdbe/execute.rs"},"region":{"startLine":19152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b34070c11cca22f9c99444cdf287222aadb3d46d936c6e84e267e5ac6deb3bc"}},{"ruleId":"D1","level":"warning","message":{"text":"lib_sync._process_http_item (cyclomatic 28): lib_sync._process_http_item 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":"bindings/python/turso/lib_sync.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc90ad239b62663376d1f0c5c5d2b4f1e46cd46e9f017e805b08b1f1b6eb090b"}},{"ruleId":"D1","level":"warning","message":{"text":"tursoDbConnection.executeFully (cyclomatic 28): tursoDbConnection.executeFully 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":"bindings/go/driver_db.go"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae59b1cff6d5e05e4866656a354a0009e37d82d310ae8df643713a169b5f81f"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamingLogicalLogReader::parse_streaming_payload (cyclomatic 27): StreamingLogicalLogReader::parse_streaming_payload 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d5991cf11206eeadf8f0a3afeb18685cc58ba1245a40f6cb71b0ee88b67189"}},{"ruleId":"D1","level":"warning","message":{"text":"CloseLoop::emit (cyclomatic 27): CloseLoop::emit 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":"core/translate/main_loop/close.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1300d77f471eba5c2da852aa79a6f31932086d350a483c8b94735630ba34dc9"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::fkeys::emit_fk_child_update_counters (cyclomatic 27): turso_core::translate::fkeys::emit_fk_child_update_counters 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":"core/translate/fkeys.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e464d427e9cb66f98019ce2bac575951319c8260f059f372c3c257bfa641ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::main_loop::body::emit_loop_source (cyclomatic 27): turso_core::translate::main_loop::body::emit_loop_source 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":"core/translate/main_loop/body.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fcda99a332f1317a3e81390ec6b7b8206ccb3da7a3aa43a416b95cbe432acc"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::find_table_access_plan (cyclomatic 27): turso_core::translate::optimizer::find_table_access_plan 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"33db9642f99922dda0a99b086f7f80abc22572eb867669bfdba86b8a38b376e2"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::translator::deparse_default_expr (cyclomatic 27): turso_pg_parser::translator::deparse_default_expr has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":8711}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c39f5d85efb170723152a4ae0c4f769c6259d797b75aa89fb712e0e163bbb73"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::check_always_true_or_false (cyclomatic 27): Expr::check_always_true_or_false 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":4217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1386c5972482b7372f3c096aa3cadf239c4169a8cd36827f044111a3b0e1ecdf"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_whopper::worker::execute_sql_inner (cyclomatic 27): turso_whopper::worker::execute_sql_inner has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a2bb3eea2e76c6e403a68780f7d8ead692a06c2b8642b76abbfb0d4f387f18"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectStmt::unordered_limit_reason (cyclomatic 27): SelectStmt::unordered_limit_reason 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b0174d8246df67ffd3f4e1305868634d0202e122352977759373aabb396dab"}},{"ruleId":"D1","level":"warning","message":{"text":"CliDatabaseInstance::run_sql (cyclomatic 27): CliDatabaseInstance::run_sql 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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0678b4ea923fee66ed1ec0e2a1c8498ceee15d1512e764bd8c2a91d712941e4"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_sqlite3::sqlite3_open_v2 (cyclomatic 26): turso_sqlite3::sqlite3_open_v2 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":"bindings/c/src/lib.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70cdfc865abe2f623ba39d065d3091e42f8d57955bb64a39b6455e4b053b2ac"}},{"ruleId":"D1","level":"warning","message":{"text":"FtsIndexAttachment::new (cyclomatic 26): FtsIndexAttachment::new 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":"core/index_method/fts/mod.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf39487b3d8e60772403023f4e3fa442f5bae718b2a861c261009677ef8f2c5"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::insert_into_page (cyclomatic 26): BTreeCursor::insert_into_page 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":"core/storage/btree.rs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff921d62fe9c46b2e6f95616f9a6ba9dad4ffd88e39c1c5a7c0f95793220c37"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::datetime::exec_datetime_general (cyclomatic 26): turso_core::functions::datetime::exec_datetime_general 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":"core/functions/datetime.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2b5ad35fa805a3da16f38794013eeb0101d914fb61b5b5c00d3824a4de1be6"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::printf::fp_decode (cyclomatic 26): turso_core::functions::printf::fp_decode 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":"core/functions/printf.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01d395c281784746fc31b0ac9165e6b94467697be486f9e31148425d90cec2e"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::find_select_plan_form (cyclomatic 26): turso_core::translate::optimizer::find_select_plan_form 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ea59339a8941db3aee6b101921bb2b92277ab67c8c79f1f9dfc5042b5816e6"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::order::index_columns_order_consumed (cyclomatic 26): turso_core::translate::optimizer::order::index_columns_order_consumed 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":"core/translate/optimizer/order.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9369bb107fb5592c5467a7159947888729994dd901765f35c7bb05676e647ef"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::subquery::emit_from_clause_subqueries (cyclomatic 26): turso_core::translate::subquery::emit_from_clause_subqueries 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":"core/translate/subquery.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d48c06a946118816c6322e2fdfe55fc49546e592ca52b65c80305acd7c3811"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::new_rowid_inner (cyclomatic 26): turso_core::vdbe::execute::new_rowid_inner 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":"core/vdbe/execute.rs"},"region":{"startLine":12629}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e39f552443ee8390127451bdc17633cf9325b1a9ee7b067c3535c6fda5a50c9"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::apply_affinity_char_slow (cyclomatic 26): turso_core::vdbe::execute::apply_affinity_char_slow 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":"core/vdbe/execute.rs"},"region":{"startLine":18315}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1be414007b6c2606a994627b246efc8db55220053d4b24af4a0226dc3668380"}},{"ruleId":"D1","level":"warning","message":{"text":"limbo_fuzzy::phonetic::phonetic_hash (cyclomatic 26): limbo_fuzzy::phonetic::phonetic_hash 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":"extensions/fuzzy/src/phonetic.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67dad0edfda5086fcb6a02d5226160845eb7715101996829128c3b84398cfa9"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_range_function (cyclomatic 26): PostgreSQLTranslator::translate_range_function has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, 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":"postgres/parser/translator.rs"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71477de4c2d251c2d74b0ebbf33f6a333c5a1afd50d82abee6db217a4b39eb6"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorSparseInvertedIndexMethodCursor::delete (cyclomatic 25): VectorSparseInvertedIndexMethodCursor::delete 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51ecf24dda58aee438dfc210d54eb5bac72a25d4aa75fd73b9992b01183e782"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::get_prev_record (cyclomatic 25): BTreeCursor::get_prev_record 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":"core/storage/btree.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fe4764ba30c7f991aaa7e2802481db69d855ac4b6bddb87cdbf3fdb61c92c0"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::tablebtree_leaf_search::leaf_search (cyclomatic 25): BTreeCursor::tablebtree_leaf_search::leaf_search 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":"core/storage/btree.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4d4fb078453d4be70dd149975ff23eb71fa92f34b4c1bcfabe0f0ba594e8a5"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::mvcc::persistent_storage::logical_log::try_parse_one_op_from_buf (cyclomatic 25): turso_core::mvcc::persistent_storage::logical_log::try_parse_one_op_from_buf 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cc5b29fbceed948c6442391f7f2615ef3809d76694d51990f57690244adccb"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::binding::resolve_qualified_name (cyclomatic 25): turso_core::translate::expr::binding::resolve_qualified_name 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":"core/translate/expr/binding.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"654ee0357dcfc1bd10591c63fa50adf3d09336e6c4b58bc73d206b5ed0e3bf9d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::condition::translate_in_list (cyclomatic 25): turso_core::translate::expr::condition::translate_in_list 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":"core/translate/expr/condition.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7892ec48b7112cd571076a3ab651fd6a9d2f33f18beaddc14010096e30e8fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::optimize_table_access_with_custom_modules (cyclomatic 25): turso_core::translate::optimizer::optimize_table_access_with_custom_modules 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cda6fef200bdd248c0a528ce372cd1aec7b8720d9cbf9e0b16c78914cbc8670"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::planner::resolve_window_and_aggregate_functions (cyclomatic 25): turso_core::translate::planner::resolve_window_and_aggregate_functions 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":"core/translate/planner.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b51eb708d7d14e91cdd9cd1f8bcbeb4d1675a200f53c9134b52f07b318bdff"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::result_row::emit_columns_to_destination (cyclomatic 25): turso_core::translate::result_row::emit_columns_to_destination 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":"core/translate/result_row.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb4104f93e63e0f7f04e1627155bc2d6d0576408a786fa15f04a37b5f7cb90b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::util::rename_column_view::rewrite_expr_column_ref_view (cyclomatic 25): turso_core::util::rename_column_view::rewrite_expr_column_ref_view 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":"core/util.rs"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e6979405f3ef66a702a561c170ba3ce3dbacb03837ce96c4cb6120d785ada8"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_journal_mode_inner (cyclomatic 25): turso_core::vdbe::execute::op_journal_mode_inner 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":"core/vdbe/execute.rs"},"region":{"startLine":18618}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eee5dad46438ef8cb495bd11214cdb7f3302553f5fb0a0c71ef0d2eb33b905d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_dump_fuzzer::main (cyclomatic 25): turso_pg_dump_fuzzer::main 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":"postgres/dump-fuzzer/src/main.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7a77d0c9f228251678ab42af9839ebc1e4d6ba30dd395af2b01d8809ee129a"}},{"ruleId":"D1","level":"warning","message":{"text":"sqltest::runner::run_single (cyclomatic 25): sqltest::runner::run_single 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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"c804c99b18a9df63b658a347ca1563f92c44efcdf3a9785cc6663a297ecab87d"}},{"ruleId":"D1","level":"warning","message":{"text":"page_history.main (cyclomatic 25): page_history.main 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":"scripts/corruption-debug-tools/page_history.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"e85ac73a8827e1861fcdc9fde502bf60a826573b5e773afa87f1243051427755"}},{"ruleId":"D1","level":"warning","message":{"text":"turso-sql-split.nextToken (cyclomatic 25): turso-sql-split.nextToken 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":"bindings/javascript/turso-sql-split.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e82a93f2424052c84db406c505a0c17c1c4982d40b94de7c97414ac6237ea71"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_sqlite3::sqlite3_table_column_metadata (cyclomatic 24): turso_sqlite3::sqlite3_table_column_metadata 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":"bindings/c/src/lib.rs"},"region":{"startLine":3614}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb470ad60ae92e99186159ef29653011490afdae3dc211e3a8aaf02f67fb5a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::do_open_async_internal (cyclomatic 24): Database::do_open_async_internal 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":"core/database.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7184c57cbcb99bddfaac45a68a8c125843b6e23ca6d8ec6b04d7eb8d15cfaa7"}},{"ruleId":"D1","level":"warning","message":{"text":"CommitStateMachine::check_version_conflicts (cyclomatic 24): CommitStateMachine::check_version_conflicts 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":"core/mvcc/database/mod.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e76ec8f6198687e523c058876c41aa979ce2f2579fef64bb05e1317c4333a5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema::make_from_btree_internal (cyclomatic 24): Schema::make_from_btree_internal 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":"core/schema.rs"},"region":{"startLine":3351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5afff600fce7add05764af0c64fab4e7d1ac698746d3abbb640e720bee5a784"}},{"ruleId":"D1","level":"warning","message":{"text":"Pager::try_spill_dirty_pages (cyclomatic 24): Pager::try_spill_dirty_pages 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":"core/storage/pager.rs"},"region":{"startLine":4225}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f86f53be32718030d1b29028e36b3e6b9f9a2664b158149af37372fd2d9f58"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectPlan::to_tokens (cyclomatic 24): SelectPlan::to_tokens 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":"core/translate/display.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"93741ff18128c96d758205c08632da2425949a038b129261017059eaf885e041"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::join::emit_join_phase (cyclomatic 24): turso_core::incremental::vdbe_maintenance::join::emit_join_phase 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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"028de1c4ec2ad1875b540463c0b719165fcc852e5ba768de74e37051c22bba80"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::json::jsonb::validate_float_payload (cyclomatic 24): turso_core::json::jsonb::validate_float_payload 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":"core/json/jsonb.rs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"6475d705edf936d76e0b2e039fad68d3f60c0e61c2f4a076d7628bcf6a968ee8"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::emitter::update::emit_update_column_values (cyclomatic 24): turso_core::translate::emitter::update::emit_update_column_values 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":"core/translate/emitter/update.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a467bdfb3732cefb566358bdee237a36cd488b4e38149d1834bce1716ce5849"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::insert::bind_insert (cyclomatic 24): turso_core::translate::insert::bind_insert 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":"core/translate/insert.rs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d5328d6008605bf4fa46161c5bf9e9d99d8e6cbd0d6c7917ce5af2ddedf7d6"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_open_read (cyclomatic 24): turso_core::vdbe::execute::op_open_read 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":"core/vdbe/execute.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a64233b162509ef2a076203472e9afca1d2e1578a0dcf63d5b4214d95e31604"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_create_sequence (cyclomatic 24): PostgreSQLTranslator::translate_create_sequence 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. This is NOT this file\u0027s highest cyclomatic complexity: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":5388}}}],"partialFingerprints":{"codehealthFindingId/v1":"391df9ec2085c4ba2707ad5bac737b147d55f1255fe2b4b1336d76e10561fad2"}},{"ruleId":"D1","level":"warning","message":{"text":"TursoSession.BatchAsync (cyclomatic 23): TursoSession.BatchAsync 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":"bindings/dotnet/src/Turso.Serverless.Client/TursoSession.cs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"184b5d96cc377bf00629445c6551b284661f71832a2d8d1d0144e84957e6a5a0"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::drive_reparse_building (cyclomatic 23): Connection::drive_reparse_building 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":"core/connection.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2608cf66bceab9412b657f541bfc759357b484fa9b1de70d78607fc29be2735"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::_init_nonblock (cyclomatic 23): Database::_init_nonblock 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":"core/database.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"487e2d7e40cff0192096ce68bbc5efeec751981804c9f9a0a8866f4695289907"}},{"ruleId":"D1","level":"warning","message":{"text":"VectorSparseInvertedIndexMethodCursor::insert (cyclomatic 23): VectorSparseInvertedIndexMethodCursor::insert 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75c5b30659dd988ae81089c274755c1d96bb1c553264017f5049a62ffe51fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"MvccLazyCursor::seek (cyclomatic 23): MvccLazyCursor::seek 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":"core/mvcc/cursor.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9efeb522db4456b099b045f46839f5eab175e01912c554aba88ba70e9f8cd82"}},{"ruleId":"D1","level":"warning","message":{"text":"EqpDetail::write_json (cyclomatic 23): EqpDetail::write_json 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":"core/translate/eqp.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36049c385ef1264fd5aa0c1f4fca48de1f2073e61be54855b4261cfc14c90cc"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::storage::sqlite3_ondisk::read_value_serial_type (cyclomatic 23): turso_core::storage::sqlite3_ondisk::read_value_serial_type 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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d85a2c6097ad811923a6df0ce827d43b3a2191135c9275d3c39fd50319925f4"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::emitter::update::emit_program_for_update (cyclomatic 23): turso_core::translate::emitter::update::emit_program_for_update 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":"core/translate/emitter/update.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea52304667e3c0a88fe447311a950f25f3d24d428c02c030df86f8f6d951aec5"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::multi_index::analyze_and_terms_for_multi_index (cyclomatic 23): turso_core::translate::optimizer::multi_index::analyze_and_terms_for_multi_index 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":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d51689f047decb27e933c142f5156037d30e7163182c2c3ad05c3ffa07ccad"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::select::validate_expr_correct_column_counts (cyclomatic 23): turso_core::translate::select::validate_expr_correct_column_counts 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":"core/translate/select.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fc9ba73637cf7d36b9e10b0a6117b39d650532de8303d7ad51892f8d28a94d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_open_write (cyclomatic 23): turso_core::vdbe::execute::op_open_write 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":"core/vdbe/execute.rs"},"region":{"startLine":13125}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb82ccdcfbcb940bf466f8675904b257211f14f4c0bd1ff38066b00b882b2ddb"}},{"ruleId":"D1","level":"warning","message":{"text":"tursopg::handle_meta_command (cyclomatic 23): tursopg::handle_meta_command 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":"postgres/cli/main.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31dbe99b922d15640d3c99ad438975ab189f5fcd06a990dacc89fde165655a1"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::functions::pg_to_char_numeric (cyclomatic 23): turso_pg::functions::pg_to_char_numeric 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":"postgres/frontend/functions.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afc0f04a8c38323527b14a21a0621fe4486a943a222a768adb91418d64ef942"}},{"ruleId":"D1","level":"warning","message":{"text":"Session::execute_cursor_stmt (cyclomatic 23): Session::execute_cursor_stmt 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":"serverless/rust/session.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e17a2b9921b2355f3caf1d4912b5ad5d2308ce5eb32f043c202c324dfc245b0"}},{"ruleId":"D1","level":"warning","message":{"text":"ColumnConstraint::to_tokens (cyclomatic 23): ColumnConstraint::to_tokens 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. This is NOT this file\u0027s highest cyclomatic complexity: Operator::to_tokens (cyclomatic 25) 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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26565e35813495f0de6e3626c3939d4cae6ded6f1fbeca1eb35b7c0b16104ff"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_expr_inner (cyclomatic 23): Parser::parse_expr_inner 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d220d5a338474f5f338fda34b1e922c218a6d3244e3399527d9edcf50ffa75fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_named_column_constraints (cyclomatic 23): Parser::parse_named_column_constraints 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":4235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3203213bcec4f32f32c31da26c0be5fb0b5557fe25abf19e7d80b17d1897ec76"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectStmt::fmt (cyclomatic 23): SelectStmt::fmt 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. This is NOT this file\u0027s highest cyclomatic complexity: BinOp::fmt (cyclomatic 26) 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e43459079c8e30c7e8a6987e9d26833d455725d1ee39137bc2a720c80f05eb"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_gen::generate::select::generate_join_clauses (cyclomatic 23): sql_gen::generate::select::generate_join_clauses 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":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0925713714ff039a8905a6528d436ff28fe6bf838b7ef8cf19f3ddf6a7eacd"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_gen::generate::stmt::collect_capability_allowed_stmts (cyclomatic 23): sql_gen::generate::stmt::collect_capability_allowed_stmts 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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"224889e86f1b7f25b7207fe3126bb1ec4efeee8d60210300042b2b0439c305a5"}},{"ruleId":"D1","level":"warning","message":{"text":"session.executeStmt (cyclomatic 23): session.executeStmt 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":"serverless/go/session.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d28bb22dbce246726bc9fe6107e64449deed985d60c687ada7d024c09b8a868"}},{"ruleId":"D1","level":"warning","message":{"text":"run.process (cyclomatic 23): run.process 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":"bindings/javascript/sync/packages/common/run.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bc5fdb049ebc97ad80bdde8e0fb61fedf6e0c4fa696f7e6066f630fd29f63a"}},{"ruleId":"D1","level":"warning","message":{"text":"Connection::attach_database_with_config (cyclomatic 22): Connection::attach_database_with_config 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":"core/attach.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8982f99aed0000d96aca9470f166b1727ca81c1f09433faeb7c99266ef17a54"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStateMachine::collect_table_row_versions (cyclomatic 22): CheckpointStateMachine::collect_table_row_versions has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7644d601d8d40674f769e8714894d26b08533a334645ce18f53f34c6205350"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::begin_exclusive_tx_with_checkpoint_read_guard (cyclomatic 22): MvStore::begin_exclusive_tx_with_checkpoint_read_guard 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":"core/mvcc/database/mod.rs"},"region":{"startLine":6453}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e43d859cd3c6538b224afe8e95ab0128fdd7524c03becfe244c72f4fe84ed98"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::rollback_savepoint_changes (cyclomatic 22): MvStore::rollback_savepoint_changes 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":"core/mvcc/database/mod.rs"},"region":{"startLine":7508}}}],"partialFingerprints":{"codehealthFindingId/v1":"2744d426d45e0983d995a27d06d7fbd07de6a229da4c198eae7006c758628ff7"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::indexbtree_seek_impl (cyclomatic 22): BTreeCursor::indexbtree_seek_impl has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 5 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":"core/storage/btree.rs"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7a0a6e17e18200a5e318efdd671dd2bf82981edd91613a1c7c1852dbaa07ac"}},{"ruleId":"D1","level":"warning","message":{"text":"HashTable::load_spilled_partition (cyclomatic 22): HashTable::load_spilled_partition 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":"core/vdbe/hash_table.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3787a511953a6fe0dbf619caa2f0a5947b1bff66b845d90d00064c28ed25554"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::validate_one_select_column_refs_after_drop (cyclomatic 22): turso_core::translate::alter::validate_one_select_column_refs_after_drop 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":"core/translate/alter.rs"},"region":{"startLine":5449}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c69f4921d073f13bb41fc126c087429aca40da533f55f130f07816c23da943"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::main_loop::close::replace_subquery_output (cyclomatic 22): turso_core::translate::main_loop::close::replace_subquery_output has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 belong to 3 function items inside it that branch. 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":"core/translate/main_loop/close.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"252d0edcbeb9e689a7c274cb0d595d6725651fe4e431ff732b251c5734fc33b8"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::choose_best_btree_candidate (cyclomatic 22): turso_core::translate::optimizer::access_method::choose_best_btree_candidate 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c8961b6f5db11fe3c6d864cacd7b26f4077dd7854e6dcb60e0855c0d00f0b8"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::choose_best_in_seek_candidate (cyclomatic 22): turso_core::translate::optimizer::access_method::choose_best_in_seek_candidate 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"74434cf2b55aabbfd55267865b31f21cd0ae88b87333e4dfed0fc3a9215ba82f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::find_best_index_for_constraint (cyclomatic 22): turso_core::translate::optimizer::constraints::find_best_index_for_constraint 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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a4552aca9fff86c9764877878e36620dd6cd8201993d7a7ee982e60ef723aa"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::planner::keep_parenthesized_join_columns (cyclomatic 22): turso_core::translate::planner::keep_parenthesized_join_columns 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":"core/translate/planner.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed67285d3d5fe05da2ca6de76ada788118b70c2de05e17de614d9e8837bafaa"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::upsert::upsert_matches_index (cyclomatic 22): turso_core::translate::upsert::upsert_matches_index 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":"core/translate/upsert.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7b6cb57470dc58fec35ca80d125371c24a911df9df322fc537a4381d77d972"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::view::translate_drop_view (cyclomatic 22): turso_core::translate::view::translate_drop_view 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":"core/translate/view.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd124cbfacda43fe4c3c6faa6d2b11baf751ce9bd7c94d44a1a5d5be7851687"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::util::try_capture_parameters_column_agnostic (cyclomatic 22): turso_core::util::try_capture_parameters_column_agnostic 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":"core/util.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee8c3cc18b9208b7802186deac988690a97d6f93b6249a6e2a6264e2f4010b1"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_set_cookie (cyclomatic 22): turso_core::vdbe::execute::op_set_cookie 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":"core/vdbe/execute.rs"},"region":{"startLine":15328}}}],"partialFingerprints":{"codehealthFindingId/v1":"510510887456c69512f5bc351aaeb00b8a89ed4c2171fbac6950121816bfdbaf"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_open_ephemeral (cyclomatic 22): turso_core::vdbe::execute::op_open_ephemeral 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":"core/vdbe/execute.rs"},"region":{"startLine":15687}}}],"partialFingerprints":{"codehealthFindingId/v1":"612151ac3cfc751c1cfec3264f3f855cad17a18d7e7cbdba1d5b8e6017118065"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokenizer::next (cyclomatic 22): Tokenizer::next 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. This is NOT this file\u0027s highest cyclomatic complexity: ReadState::transition (cyclomatic 45) 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":"postgres/cli/read_state_machine.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2ac8ab37151548c29973ccdead4653e621fbcc148d5fbf7d5b9a190606a3aa"}},{"ruleId":"D1","level":"warning","message":{"text":"ClassCatalog::apply (cyclomatic 22): ClassCatalog::apply 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":"postgres/frontend/classes.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a440b8c8e2b652ea3479575d27eae35ecb68607832b54b21dd1fe5c90fbf983"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_func_call (cyclomatic 22): PostgreSQLTranslator::translate_func_call has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":4297}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfcde019274afc431560d71879c664876b551b27150dd773a7cdbfc3653ad1b2"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::translator::validate_generation_expression (cyclomatic 22): turso_pg_parser::translator::validate_generation_expression 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. This is NOT this file\u0027s highest cyclomatic complexity: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":7143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f320550476b0e0b0af51c805a5a9f4c358047074d1e953f263cad4ffe5420852"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::translator::similar_to_regex (cyclomatic 22): turso_pg_parser::translator::similar_to_regex 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. This is NOT this file\u0027s highest cyclomatic complexity: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":8899}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f23f1f5ca439943f24963f374f9b7c7bbeac52c421941e7b080978cbd30f748"}},{"ruleId":"D1","level":"warning","message":{"text":"Update::shadow (cyclomatic 22): Update::shadow 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":"testing/simulator/model/mod.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"382d21a4de06ec89bd8a0f3026d2327d181d92afd74a3ae2d6d5155adffbf0e3"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectStmt::non_unique_order_by_reason (cyclomatic 22): SelectStmt::non_unique_order_by_reason 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. This is NOT this file\u0027s highest cyclomatic complexity: BinOp::fmt (cyclomatic 26) 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b82ba1e1e17b47c4f6b7b260bd3bb179f27255daaabdbc29c747a46fe9f61c"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::bootstrap_nonblock (cyclomatic 21): MvStore::bootstrap_nonblock 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":"core/mvcc/database/mod.rs"},"region":{"startLine":5128}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a2f05f01c0489ad51dc238c2a9d8d519d67ed1a7f5e039501aa728d38d3154"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamingLogicalLogReader::parse_next_transaction (cyclomatic 21): StreamingLogicalLogReader::parse_next_transaction 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16b9110d6b5874633666e36754ee463d9e64ca302f2ec7d67e07484fe3addca"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement::finish_step (cyclomatic 21): Statement::finish_step 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":"core/statement.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c4cec6d360dded027ed28875a4a3dc9f8dc5afbb24e55726c336c65b8bc48a"}},{"ruleId":"D1","level":"warning","message":{"text":"SeekEmitter::emit_start_bound (cyclomatic 21): SeekEmitter::emit_start_bound 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":"core/translate/main_loop/seek.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abbb11c22c821cb80c2ea473e1a9ad6fbfb9b7d817f3451317a9e0220adb476"}},{"ruleId":"D1","level":"warning","message":{"text":"SeekEmitter::emit_termination (cyclomatic 21): SeekEmitter::emit_termination 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":"core/translate/main_loop/seek.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"54802b51f99496bfe944ab9ab6dede590f367232f0a83dd732291a2ec1bbb93d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::string::pad (cyclomatic 21): turso_core::functions::string::pad 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":"core/functions/string.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a05853676e21fc2c2c1ba0ca4d68a9dfc731d5c069191bebc3a5d53a80cb416b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::aggregation::emit_ungrouped_aggregation (cyclomatic 21): turso_core::translate::aggregation::emit_ungrouped_aggregation 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":"core/translate/aggregation.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e620cc8550c4f529636cbcf50983ded2aa08f16e720158b54994751efae2db2"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::validate_trigger_columns_after_drop (cyclomatic 21): turso_core::translate::alter::validate_trigger_columns_after_drop 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":"core/translate/alter.rs"},"region":{"startLine":4869}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4e92ea9fa76116d4f99ccb60511dbed8b6b5b2e61b2c0f2ab4285b1353b157"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::insert::emit_fk_child_insert_checks (cyclomatic 21): turso_core::translate::insert::emit_fk_child_insert_checks 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":"core/translate/insert.rs"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"e173bbeaa593dd7a0dc229113fcaab4d91aa19aa9ce15a13c9e63c78bfc79b8d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::rewrite_as_semi_or_anti_join (cyclomatic 21): turso_core::translate::optimizer::unnest::rewrite_as_semi_or_anti_join 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":"core/translate/optimizer/unnest.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"7407edbe8f1de62e6763f97578892371b989718fc3c215c079d784157786c0ca"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::schema::validate_check_expr (cyclomatic 21): turso_core::translate::schema::validate_check_expr 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. This is NOT this file\u0027s highest cyclomatic complexity: turso_core::translate::schema::resolve_func_return_type (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":"core/translate/schema.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"77dc35a329455a883d3d91caaffbaca4c261695b965a4e6b4dc3d7d65f47dffe"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::trigger_exec::execute_trigger_commands (cyclomatic 21): turso_core::translate::trigger_exec::execute_trigger_commands 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":"core/translate/trigger_exec.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"29326f5f947d890cfb8fbad4a0204a5e8d29a968a8ee4adbe298b99ba385b7ce"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_column_range_fetch_other (cyclomatic 21): turso_core::vdbe::execute::op_column_range_fetch_other has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"3945fa68370c92b1b8ffa41530a238500c225522bc50ccb53b1cd6f705dd79ba"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::flatten_join_tree (cyclomatic 21): PostgreSQLTranslator::flatten_join_tree 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. This is NOT this file\u0027s highest cyclomatic complexity: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6943065d9d2ed604f781946b2b90321d14267c6072ee400aeef4765b1c2150c7"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_server::scalar_pg_type_to_array_type (cyclomatic 21): turso_pg_server::scalar_pg_type_to_array_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. This is NOT this file\u0027s highest cyclomatic complexity: turso_pg_server::sqlite_type_to_pg_type (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":"postgres/server/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0ad20b8ee9d32281d6d32ad54e39778c2180ad9c5f0fce49bc1f96f32c9e5"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_serverless::batch::decode_batch_result (cyclomatic 21): turso_serverless::batch::decode_batch_result 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":"serverless/rust/batch.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6040dce8fe1f7f3864eee1ce9ff5513105a3a9165fbfa14bd5da19a4b6f59"}},{"ruleId":"D1","level":"warning","message":{"text":"Insert::shadow (cyclomatic 21): Insert::shadow 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. This is NOT this file\u0027s highest cyclomatic complexity: Query::fmt (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":"testing/simulator/model/mod.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19fb48ce547a56df7bfe421910f67a219b54dabcea9a3a70fbec342630f0086"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_frame_opt (cyclomatic 21): Parser::parse_frame_opt 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"92692715fca1f85ed407264dddce8dc548d79a119db9a7f05e2da2ac81564a6c"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::logical_op_to_tape_operations (cyclomatic 21): turso_sync_engine::database_sync_operations::logical_op_to_tape_operations 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2964c58159a0fccf36ac95f8cc9ce8a0bd47ce6b23bd1fd9fd3314516cfb4d"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::contains_aggregate (cyclomatic 21): Expr::contains_aggregate 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. This is NOT this file\u0027s highest cyclomatic complexity: BinOp::fmt (cyclomatic 26) 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"4777be59a2bde39cb8a908bfd70757a242db8c529eae6fb81760243420cf9aab"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_gen::generate::select::generate_aggregate_call (cyclomatic 21): sql_gen::generate::select::generate_aggregate_call 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":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecca03d8904e2692a73b610bf740cd6d6de9be6bfc04de37f0fbb021537e8b8"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_gen::generate::stmt::generate_create_table (cyclomatic 21): sql_gen::generate::stmt::generate_create_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. This is NOT this file\u0027s highest cyclomatic complexity: sql_gen::generate::stmt::dispatch_stmt_generation (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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d1112c3cb3f1ef4dad65efc0c3803c5af38179ab5f0ad6db27061770026cef"}},{"ruleId":"D1","level":"warning","message":{"text":"Expression::fmt (cyclomatic 21): Expression::fmt 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":"testing/differential-oracle/sql_gen_prop/expression.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3792a2756d907b999754e7bf8e6a229a47885c8675ef8c7df437e9a1141e8cf"}},{"ruleId":"D1","level":"warning","message":{"text":"page_info.main (cyclomatic 21): page_info.main 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":"scripts/corruption-debug-tools/page_info.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b381d8a0a6c6af52f4a03b07970881c952bbcfcd43ed2c016b9f2607327636f4"}},{"ruleId":"D1","level":"warning","message":{"text":"tursoDbRows.Next (cyclomatic 21): tursoDbRows.Next 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":"bindings/go/driver_db.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a9e92fdab0d29e31f435964d4295a1e67998dec1751e7b4461263f5b1a656d"}},{"ruleId":"D1","level":"warning","message":{"text":"session.executePipeline (cyclomatic 21): session.executePipeline 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":"serverless/go/session.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeab9db66c851775f78dcfced362e16efee7f4c4f42c304b391b442a81da5e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"Database.batch (cyclomatic 21): Database.batch 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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eae9af6897eab1c32db64f6087d9e55c3799c2fcdde8b90e4f894db4185e1ff"}},{"ruleId":"D1","level":"warning","message":{"text":"IncrementalView::referenced_tables (cyclomatic 20): IncrementalView::referenced_tables has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 1 of the 20 points is its own statement and the rest belongs to 3 function items inside it that branch (collect_one, collect_source, collect_select). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/view.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd35ab5ee5755b4dc1713f9a142332b5767cd211257577ef9be7a01f65b46af7"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStateMachine::maybe_get_checkpointable_versions (cyclomatic 20): CheckpointStateMachine::maybe_get_checkpointable_versions 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1fc58c5d808864cc6858a224c391a169f5ac1fa49d7c41faaed24f3f0f6828"}},{"ruleId":"D1","level":"warning","message":{"text":"SeqCompactDriver::step (cyclomatic 20): SeqCompactDriver::step 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"7436c51c014b2824336242b178a4a8c5e6132e90324aecdc43a7ad5a9283b783"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement::reset_internal (cyclomatic 20): Statement::reset_internal has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"962c58cdc792f33d39fd685c216d7ee02471b584b8b8695d83619697b5736da4"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::count (cyclomatic 20): BTreeCursor::count 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":"core/storage/btree.rs"},"region":{"startLine":7495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1baf30b04f739e625a0bbce394aac59759230d1fd8f5c3b94e1facae72e3fc"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectPlan::fmt (cyclomatic 20): SelectPlan::fmt 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":"core/translate/display.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea771e4e793650779c78dfa549d6ae824f1fbc49f4a04563861c3f3b45f1b89"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdatePlan::fmt (cyclomatic 20): UpdatePlan::fmt 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":"core/translate/display.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9992efd67c80b0e901377bd2ac2c6fd6b7d0548a413ac01b7f6c8e8d52aa5429"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::exec_substring (cyclomatic 20): Value::exec_substring has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 2 function items inside it that branch (calculate_postions, ceil_char_boundary). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/value.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad29ca18253102d1006148cac3d815ecd5715cb2863ca8b026378cb5f520f295"}},{"ruleId":"D1","level":"warning","message":{"text":"Value::exec_cast (cyclomatic 20): Value::exec_cast 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":"core/vdbe/value.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac117858cf440952df9dba996d1bac63038aaa1d4b69990423e27f40c52bb592"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::dbpage::update_dbpage (cyclomatic 20): turso_core::dbpage::update_dbpage 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":"core/dbpage.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"a951306faeb4a5ba20bab951d1d76b2ed02b8744b4ffe79314cf6b461db35ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::join::emit_semi_or_anti_join (cyclomatic 20): turso_core::incremental::vdbe_maintenance::join::emit_semi_or_anti_join 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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f3486f5c13488143a00a04a088b2b56efdff61a141b15e7370afe2c93eff26"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::apply_upsert_for_column_rename (cyclomatic 20): turso_core::translate::alter::apply_upsert_for_column_rename 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":"core/translate/alter.rs"},"region":{"startLine":3980}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada192d5a4e5129e4e55a5a3691a72c7dcf7d9bf692fbb84ee49fe187e6643eb"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::collate::for_each_operand (cyclomatic 20): turso_core::translate::collate::for_each_operand 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":"core/translate/collate.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bc4c2ac054e8f172bcbddbffea4eff59e173039fcabb2ed8f04ee8c8fc7a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::group_by::group_by_process_single_group (cyclomatic 20): turso_core::translate::group_by::group_by_process_single_group 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":"core/translate/group_by.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e91855186846351b0d18d5199b77864f8552c9e1885da5dbc3f2f05a0d12528"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::estimate_selectivity (cyclomatic 20): turso_core::translate::optimizer::constraints::estimate_selectivity 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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"8556b228db01de4a4cb6bf4bfb56f4f5de0dd7629ed4dc051487ef00f47fb2bf"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::planner::parse_join (cyclomatic 20): turso_core::translate::planner::parse_join 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":"core/translate/planner.rs"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3ba91a24fff976404547d985b74d46ccb49b70953ba66ed30ed6553fdce76a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::pragma::emit_columns_for_table_info (cyclomatic 20): turso_core::translate::pragma::emit_columns_for_table_info 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":"core/translate/pragma.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e85c88d99e040de3214bc0a4d874980c13d23e06e2fe7deb2a35d22ea4e75d6"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::schema::validate_check_types_in_expr (cyclomatic 20): turso_core::translate::schema::validate_check_types_in_expr 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. This is NOT this file\u0027s highest cyclomatic complexity: turso_core::translate::schema::resolve_func_return_type (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":"core/translate/schema.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3779fdd9311b93fed22e27f6a91caede239f6edd2728f96fb50a07b41d873f0"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::subquery::assign_select_subquery_eval_phases (cyclomatic 20): turso_core::translate::subquery::assign_select_subquery_eval_phases 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":"core/translate/subquery.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1d91864ff34565793cf7dec66984914c282614b0e2bc2eca2335f8962438f0"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::trigger::translate_create_trigger (cyclomatic 20): turso_core::translate::trigger::translate_create_trigger 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":"core/translate/trigger.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a1582cd2abb1def61b9e9884d329c4ffe5fa272b072261d624eff5484a9596"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::window::emit_window_range_test (cyclomatic 20): turso_core::translate::window::emit_window_range_test 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":"core/translate/window.rs"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d24c580e659d687aedae4306b53f348e08b19fedc042ac93712e395eda52f3"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::array::exec_array_to_string (cyclomatic 20): turso_core::vdbe::array::exec_array_to_string 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":"core/vdbe/array.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39292d89af9f5b1e9108ed7c60c85c06341b974f9d51da7540bba5b2766bcc7"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_agg_final (cyclomatic 20): turso_core::vdbe::execute::op_agg_final 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":"core/vdbe/execute.rs"},"region":{"startLine":9489}}}],"partialFingerprints":{"codehealthFindingId/v1":"de48b7411bd3f592e8ba8fdbd8429c5523a4937a78831a1eee47f3d4a4b12f4c"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_idx_insert (cyclomatic 20): turso_core::vdbe::execute::op_idx_insert 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":"core/vdbe/execute.rs"},"region":{"startLine":12423}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e6b646ac04f42a7df181d66701cea8d1826f837b464ebacedbda60a3aac63b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::translator::try_extract_grant (cyclomatic 20): turso_pg_parser::translator::try_extract_grant 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. This is NOT this file\u0027s highest cyclomatic complexity: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":8250}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b3efcd31a405dbbd50d26659aef27d160b39c0a4669869a1327e8a68092d3d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_regress::split_meta_args (cyclomatic 20): turso_pg_regress::split_meta_args 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":"postgres/regress/main.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0d2dbf688cfe1ac83bdbd87842663672fd514739288e3ff100af7c1d006a8f"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_create_table_args (cyclomatic 20): Parser::parse_create_table_args 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. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_stmt (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":"sqlite/parser/src/parser.rs"},"region":{"startLine":3672}}}],"partialFingerprints":{"codehealthFindingId/v1":"678967f84a5929a5a716173c92ed06211cf08a214e98713df945acd0d8d597c0"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_sync_engine::database_sync_lazy_storage::read_page (cyclomatic 20): turso_sync_engine::database_sync_lazy_storage::read_page 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":"sync/engine/src/database_sync_lazy_storage.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c97422af090fcf5dde2d5adc467fac23835725846a74f47362a2b5da69f87"}},{"ruleId":"D1","level":"warning","message":{"text":"ElleHistoryRecorder::finish_op (cyclomatic 20): ElleHistoryRecorder::finish_op 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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba09ad4b9a81b372a36d45643f40ffad971a07633d27320fc3dca5a6cdc7747"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_whopper::worker::run_worker (cyclomatic 20): turso_whopper::worker::run_worker 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":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f782594a0bac4ae4d82a5c97d4fdede17a3dfa6c302d91f6cd500418d6976c"}},{"ruleId":"D1","level":"warning","message":{"text":"protocol.executeCursor (cyclomatic 20): protocol.executeCursor has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceeb338de549bfebc6aaef7d240d02347681894791a42fcf6038f537a9af2009"}},{"ruleId":"D1","level":"warning","message":{"text":"ManagedSqliteStatementParser.TryReadParameter (cyclomatic 19): ManagedSqliteStatementParser.TryReadParameter has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/ManagedSqliteStatement.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edf92103f97f4422273dc6bece6169f7f50e2eebade718fecb69d816966791e"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteDataReader.GetSchemaTable (cyclomatic 19): SqliteDataReader.GetSchemaTable 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"97faa75b89c58fb53f5fbe8e15b3dae0dd08fe103cc3e0c6508607bdd53f2e9d"}},{"ruleId":"D1","level":"warning","message":{"text":"IoWorker::process_http (cyclomatic 19): IoWorker::process_http 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":"bindings/rust/src/sync.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"805913e5bd03447b05f5209fad20f879e04c1683d6110ddcecf7a673729b5230"}},{"ruleId":"D1","level":"warning","message":{"text":"CheckpointStateMachine::publish_checkpointed_schema_roots (cyclomatic 19): CheckpointStateMachine::publish_checkpointed_schema_roots 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77a086eee944e2a70e890f3c97355ccb2c1bcfdba50d4959da6144f08bf76ab"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildLocalSchemaViewStateMachine::step (cyclomatic 19): BuildLocalSchemaViewStateMachine::step 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":3806}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d8d525777cf929ec3f8f428d48d16eca38c5261ed9a10b3dd9439d0fa321b1"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalLog::frame_and_pwrite_tx (cyclomatic 19): LogicalLog::frame_and_pwrite_tx 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ba7762e59515d9327a0829989423f6f058a9d8b4d164f97c85af16a2731706"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::get_next_record (cyclomatic 19): BTreeCursor::get_next_record 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":"core/storage/btree.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad244041bf3571fbf0e6577774d44839dc8c8a2f0e6567dd1711041fa3f4502e"}},{"ruleId":"D1","level":"warning","message":{"text":"Pager::allocate_page (cyclomatic 19): Pager::allocate_page has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":5836}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b0a409312281c1a277badf3a4926cd73159c902e35eda07b578a1d1ba34ca3"}},{"ruleId":"D1","level":"warning","message":{"text":"PreparedHashBuild::emit (cyclomatic 19): PreparedHashBuild::emit 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":"core/translate/main_loop/hash.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c1d3a64dbb2cdf91beea7fe38c531ad76ac65c45ba1f535eafe36c5bf97c69"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::functions::printf::printf_c_arg_plan (cyclomatic 19): turso_core::functions::printf::printf_c_arg_plan 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":"core/functions/printf.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"454676b2108cdf288a276d27f9c07bd49fbc8eeea0187b0a500e352e0048ed0a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::validate_stream_expr (cyclomatic 19): turso_core::incremental::vdbe_maintenance::plan::validate_stream_expr 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":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fdb5ba2e7d16d1a0a0dcd078372fbc154c0ca2bd2161d0cfe36ed1fc5dd2ab9"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::rewrite_trigger_sql_for_column_rename (cyclomatic 19): turso_core::translate::alter::rewrite_trigger_sql_for_column_rename 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":"core/translate/alter.rs"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"992a5122193440f55c1c2919a80c2bf2d68778f67e7ca954c550de3dde44b0ee"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::check_column_ref_valid (cyclomatic 19): turso_core::translate::alter::check_column_ref_valid 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":"core/translate/alter.rs"},"region":{"startLine":5896}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ff47d403562568a63524016430738cc1771917b36019572f257b123a304e6e"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::eqp::seek_constraint_parts (cyclomatic 19): turso_core::translate::eqp::seek_constraint_parts 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":"core/translate/eqp.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca86bb2e63871f8ce9f52cd7dfbf64fea05d9d6e1aef73e49a6fa17b3efab855"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::main_loop::close::emit_table_read_advance (cyclomatic 19): turso_core::translate::main_loop::close::emit_table_read_advance 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":"core/translate/main_loop/close.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac44f50a066983144cf2f5708e4279536e19516bf24cb4ee8dbe1e6b645a1c1f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::where_term_rejects_null_row (cyclomatic 19): turso_core::translate::optimizer::where_term_rejects_null_row has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f2c8accc2de1d0b4cc846f76a04ca0a1cde5058b34db897888528c38bc9e47"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::order::plan_satisfies_order_target (cyclomatic 19): turso_core::translate::optimizer::order::plan_satisfies_order_target 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":"core/translate/optimizer/order.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebde7cdfb292983a96025b0d87db49889870dee70752489cf3b04bc42523310"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::plan::expand_star (cyclomatic 19): turso_core::translate::plan::expand_star 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":"core/translate/plan.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"44cdc2097b63fbd8e0434990a8fef9051181c6a1cbc6d4110ac7a8168c9d8676"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::trigger_exec::rewrite_trigger_expr_single_for_when_clause (cyclomatic 19): turso_core::translate::trigger_exec::rewrite_trigger_expr_single_for_when_clause 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":"core/translate/trigger_exec.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52d06f6df76f6d6373e284007389520806162b6c25c47a1017d09641922057f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::util::try_capture_parameters (cyclomatic 19): turso_core::util::try_capture_parameters 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":"core/util.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"44baf03018922582cf5a5d908f05c9d140d40a9117a439ad67490001bc88bf11"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::util::parse_numeric_str (cyclomatic 19): turso_core::util::parse_numeric_str 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":"core/util.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02fbba7acb29948c9abd22771dc5cf2a503908430e7dde45ca3d2d91e48d54a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_integrity_check (cyclomatic 19): turso_core::vdbe::execute::op_integrity_check 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":"core/vdbe/execute.rs"},"region":{"startLine":16192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c004dcec3b27a13ad2be341301bd7341b06f65cade7a319c6ed21c48d2ee2156"}},{"ruleId":"D1","level":"warning","message":{"text":"Generated::column (cyclomatic 19): Generated::column 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":"postgres/dump-fuzzer/src/summary.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"79d38060ff5aaf577eb62b4b5e1c25c6a744e9ef05ac2c1530d06ffe939b6337"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::copy::unescape_copy_field (cyclomatic 19): turso_pg::copy::unescape_copy_field 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":"postgres/frontend/copy.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5c783668fc492bff24b08e2cccac76303e4090b05480f7b7d04a2532622fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_generation::generation::query::gen_insert_upsert_values (cyclomatic 19): sql_generation::generation::query::gen_insert_upsert_values 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":"sql_generation/generation/query.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b5256c20ee115588c19e1ce777e9595e85ab4ce780a6a9c6e7954c53cf5800"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_whopper::run_inprocess (cyclomatic 19): turso_whopper::run_inprocess 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":"testing/concurrent-simulator/main.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf1699a8b0ba7c7f1d8b766e7ace9ad86ebc19dc435bbdbed129c779218b73c"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_gen::generate::select::generate_window_frame (cyclomatic 19): sql_gen::generate::select::generate_window_frame 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":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b856d6876befb826d275b63afadfc37878acac936abbdf354bf836a932cf3eb"}},{"ruleId":"D1","level":"warning","message":{"text":"InteractionPlan::remove_properties (cyclomatic 19): InteractionPlan::remove_properties 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":"testing/simulator/shrink/plan.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"d105784b3551f38a4aed2baef02ca4379cced54f790a7b30595dd25e05feb63f"}},{"ruleId":"D1","level":"warning","message":{"text":"release-status.main (cyclomatic 19): release-status.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":"scripts/release-status.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce1bcc0ad32246f8b52e276b18b62a38aa437a3bf9d27f94e72f67d561070f8b"}},{"ruleId":"D1","level":"warning","message":{"text":"docker-entrypoint.sqlancer.main (cyclomatic 19): docker-entrypoint.sqlancer.main 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":"testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecbe762bc75989ffd33b1544a837a1d2a2b1108028a5258d35c9751554e91ba"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteCommand.SplitStatements (cyclomatic 18): SqliteCommand.SplitStatements 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: SqliteCommand.GetRemoteSqliteErrorCodes (cyclomatic 66) 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 method is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"998092266aa6499bb505af295ceb43e997553ff98551d081da44d8b882a1ca70"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema::resolve_fk (cyclomatic 18): Schema::resolve_fk 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":"core/schema.rs"},"region":{"startLine":4679}}}],"partialFingerprints":{"codehealthFindingId/v1":"54531868b6907c597b072652b66ecd0e69762a1defe45bb329deb64ed06d4ec3"}},{"ruleId":"D1","level":"warning","message":{"text":"Index::validate_where_expr (cyclomatic 18): Index::validate_where_expr 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":"core/schema.rs"},"region":{"startLine":8993}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceaeb5cb2ff5c2c6554eff2ea5b233d19c13d324c96953a4d120f91ff4733576"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::balance (cyclomatic 18): BTreeCursor::balance 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":"core/storage/btree.rs"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5dbfa136ab8b12e00e4738b8190cc39bf6070e577d3ee06a61044aab76b196"}},{"ruleId":"D1","level":"warning","message":{"text":"ShmWalCoordination::try_begin_read_tx (cyclomatic 18): ShmWalCoordination::try_begin_read_tx 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":"core/storage/wal.rs"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4952927c7691e0ef05fdf1c287ad0afd26b68fbc24c4c121ae5208e21948113"}},{"ruleId":"D1","level":"warning","message":{"text":"Program::commit_txn_mvcc (cyclomatic 18): Program::commit_txn_mvcc 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: ActiveOpState::fmt (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"62faff883968d6c4ca30f421a309ae08b939adb846605d3464829061b7d35ffc"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::plan_node_output (cyclomatic 18): turso_core::incremental::vdbe_maintenance::plan::plan_node_output has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfc5355e6add43eea000260b5f24bb375f873316115e89b35dc9465133049ee"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::set_op::emit_deduplicating_set_op (cyclomatic 18): turso_core::incremental::vdbe_maintenance::set_op::emit_deduplicating_set_op 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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be67e99bf8365f30d249cff1392d728de4d87ff48e2fd48894add5ad8b085ff"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::json::json_string_to_db_type (cyclomatic 18): turso_core::json::json_string_to_db_type 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":"core/json/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e1dec158dae91712887ccc92e819965b855daece87797ddcd5bb01869ddcc0"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::json::is_json_valid (cyclomatic 18): turso_core::json::is_json_valid 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":"core/json/mod.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"7258209605b85e491d7ace69f3445f5cf8fb43730fcae595efc0f8bb8a7d3778"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::numeric::decompose_float (cyclomatic 18): turso_core::numeric::decompose_float 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":"core/numeric/mod.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ec43630e9f069d55d69769cff253425d92a1ce25f095036ccaf9f09a9e803a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::storage::btree::defragment_page_fast (cyclomatic 18): turso_core::storage::btree::defragment_page_fast 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":"core/storage/btree.rs"},"region":{"startLine":9976}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb97c97e647c1201be24ac6e3db48240c7d4de6c6055f853965abee25fe0b921"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::apply_trigger_cmd_for_column_rename (cyclomatic 18): turso_core::translate::alter::apply_trigger_cmd_for_column_rename 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":"core/translate/alter.rs"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"3afe3a858a10266c36a3fb5bbc14658ff20f72191b3dce9b26e0a9f553ab61e3"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::expr_type::result_type (cyclomatic 18): turso_core::translate::expr::expr_type::result_type 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":"core/translate/expr/expr_type.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"418cee97b253bc931288a87a159ba1d355d62085504dec7c3e08d21cea2b36c2"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::main_loop::body::emit_unmatched_row_conditions_and_loop (cyclomatic 18): turso_core::translate::main_loop::body::emit_unmatched_row_conditions_and_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":"core/translate/main_loop/body.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db3847ba12a2a0eed9ad42128e3b6d61692349acce25950a8505348ee00d978"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::find_best_access_method_for_btree (cyclomatic 18): turso_core::translate::optimizer::access_method::find_best_access_method_for_btree 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"32fc6846a680a132a14703bdbb15a26187788dd31269853ccdc4ce492b615425"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::try_hash_join_access_method (cyclomatic 18): turso_core::translate::optimizer::access_method::try_hash_join_access_method 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2c4ad35674e8f1710cd4529a933507c2ed9ee367c61d2d458cad4cad8f1fb1"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::find_best_access_method_for_subquery (cyclomatic 18): turso_core::translate::optimizer::access_method::find_best_access_method_for_subquery 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc734166285d7783e6241e92604ca7f93146c504796084e7da0c7f5334b82bfd"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::estimate_bound_expr_selectivity (cyclomatic 18): turso_core::translate::optimizer::constraints::estimate_bound_expr_selectivity 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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde1f1b91d68256314aa217d41d6c88b1ee9566906a9f8e2f5db9866208b48ab"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::plan::expand_table_star (cyclomatic 18): turso_core::translate::plan::expand_table_star 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":"core/translate/plan.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd03768862cc3a4a11c41348599f67e34cf9df63ba8dd38ba3d1a0dff62800d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::util::visit_stmt (cyclomatic 18): turso_core::util::visit_stmt 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":"core/util.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"039121b4f0837a814daaae79f97ee023a1f49f2c059f2773d0055d9b5a3833f5"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_checkpoint (cyclomatic 18): turso_core::vdbe::execute::op_checkpoint has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a24ea3f542e628359a7529d333a69605aa93ee2c950f49824e58a9a345ae0cd"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::handle_text_sum (cyclomatic 18): turso_core::vdbe::execute::handle_text_sum 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":"core/vdbe/execute.rs"},"region":{"startLine":17329}}}],"partialFingerprints":{"codehealthFindingId/v1":"562d65a89a712031d63dd67bf0d8dc67373af601ce558f8c3164b8cd9a440285"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_dump_fuzzer::decode_field (cyclomatic 18): turso_pg_dump_fuzzer::decode_field has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/dump-fuzzer/src/lib.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0865a702617e0afbce435262a40cb1c902a513d65c5db4b22b72d2fc3dc64fba"}},{"ruleId":"D1","level":"warning","message":{"text":"DeferredExecution::cleanup_nonblock (cyclomatic 18): DeferredExecution::cleanup_nonblock 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":"postgres/frontend/session.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc743cbebd5c0497067a937316deaf9a9b212961dfb88cc49186092d5e9b2b6"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::catalog::pg_get_constraintdef (cyclomatic 18): turso_pg::catalog::pg_get_constraintdef 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: turso_pg::catalog::sqlite_type_to_pg_oid (cyclomatic 24) 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":"postgres/frontend/catalog.rs"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0f1655e1937c4ee7b33a6e7f9af9b01be1140eaaca12589f24b4475c7fb7a1"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::open::open_database_async (cyclomatic 18): turso_pg::open::open_database_async 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":"postgres/frontend/open.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9419566e34709afe61670f21150859fac61e8b339b7359eaa73a424c6def7f"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_a_expr (cyclomatic 18): PostgreSQLTranslator::translate_a_expr 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: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":3765}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f815940d2f6b33e7160523f5413321f4ebaaa0cf07022a7294f03dbbdee3e0b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::translator::validate_generated_columns (cyclomatic 18): turso_pg_parser::translator::validate_generated_columns 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: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":7019}}}],"partialFingerprints":{"codehealthFindingId/v1":"a280c3fd1759df2ffcb47fe131f28a7bccdab85de9c454f9fe914edb73a5c041"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseSyncEngine::bootstrap_db (cyclomatic 18): DatabaseSyncEngine::bootstrap_db 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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"719219669087fea07bd974003a0d115a3b35d8899d8de6034ebadfc5027d6a62"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseReplaySession::replay (cyclomatic 18): DatabaseReplaySession::replay 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":"sync/engine/src/database_tape.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f753d679bf10276fbc23f002bac8c75643b57a78b15286ef3748f0b343eb9f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::send_push_batch (cyclomatic 18): turso_sync_engine::database_sync_operations::send_push_batch 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5afdf17ab6532d19a5d49a6478260d88d96d2d1e2b1b9bbbc7545c303187480"}},{"ruleId":"D1","level":"warning","message":{"text":"UpdateStmt::fmt (cyclomatic 18): UpdateStmt::fmt 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: BinOp::fmt (cyclomatic 26) 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"f693e743c9f3496f1341bd20e17576cc956d8db6b37ad7e6ed1133ec60245469"}},{"ruleId":"D1","level":"warning","message":{"text":"CoverageReport::fmt (cyclomatic 18): CoverageReport::fmt has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 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":"testing/differential-oracle/sql_gen/src/trace.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1f2d286a271a21d3bb47372b5f2e44586c3d27082b9565ee7de765d145fc17"}},{"ruleId":"D1","level":"warning","message":{"text":"JsDatabaseInstance::run_sql (cyclomatic 18): JsDatabaseInstance::run_sql 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":"testing/sqltest/src/backends/js.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c7d369fefbb11a8928cd7c355e071c05b78bbe14227e6c3832519c3661bbb9"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyOutput::write_summary (cyclomatic 18): PrettyOutput::write_summary 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":"testing/sqltest/src/output/pretty.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b065f1cbbeeabff7f99e3fca13514cd2151a208ad94f0f5a3d43263e5095cb8"}},{"ruleId":"D1","level":"warning","message":{"text":"sqltest::tcl_converter::parser::parse_tcl_file (cyclomatic 18): sqltest::tcl_converter::parser::parse_tcl_file 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":"testing/sqltest/src/tcl_converter/parser.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e55cb11d7f7a4767b558db8e6c04b41fcc0b9e6a8f7d89f1cfd211064f1f54"}},{"ruleId":"D1","level":"warning","message":{"text":"diff_to_targeted_coverage.squash (cyclomatic 18): diff_to_targeted_coverage.squash 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":"scripts/antithesis/diff_to_targeted_coverage.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"faddb02d323248bbebce1d875a25879e24c2ef1474d6d153585de5932217eff5"}},{"ruleId":"D1","level":"warning","message":{"text":"record.parse_record (cyclomatic 18): record.parse_record 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":"scripts/corruption-debug-tools/lib/record.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70094f76819c126b97ba0498999f7c97acfe5c0281e5039c510d7bbb77fa66f"}},{"ruleId":"D1","level":"warning","message":{"text":"update-version.update_package_json (cyclomatic 18): update-version.update_package_json 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":"scripts/update-version.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bbeb48cc46acc135f5f3da10362ce8baf0af9f4db17fb566abdf20fe4ae8d8"}},{"ruleId":"D1","level":"warning","message":{"text":"TursoSqliteRelationalConnection.InitializeTursoConnection (cyclomatic 17): TursoSqliteRelationalConnection.InitializeTursoConnection has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 71, 93, 122, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteRelationalConnection.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13de1ccecff984eae29b9979a1515c33c9bc2fd00bc1e416516c891e43c9733"}},{"ruleId":"D1","level":"warning","message":{"text":"SyncEngine::new (cyclomatic 17): SyncEngine::new 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":"bindings/javascript/sync/src/lib.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ac3758bf131151e3e4d8f6d0ff96cbd562e775f39efec348a31054695269ad"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonVirtualTable::best_index (cyclomatic 17): JsonVirtualTable::best_index 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":"core/json/vtab.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f17dc3c5c959214b8fd8bce3c64ccb052f9a739e55538dc37b75f22c2a396fb"}},{"ruleId":"D1","level":"warning","message":{"text":"WriteRowStateMachine::step (cyclomatic 17): WriteRowStateMachine::step 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: CommitState::fmt (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":"core/mvcc/database/mod.rs"},"region":{"startLine":3783}}}],"partialFingerprints":{"codehealthFindingId/v1":"632e3df308766fbcf7b506be6d3c4f207ec9e4fa0a18ec8391b4874f1958cf55"}},{"ruleId":"D1","level":"warning","message":{"text":"StreamingLogicalLogReader::parse_frame_header (cyclomatic 17): StreamingLogicalLogReader::parse_frame_header 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f15faa405b4cf33ed882134b67ee344214b58051cc87730866b61d44f7db714"}},{"ruleId":"D1","level":"warning","message":{"text":"Time::time_date (cyclomatic 17): Time::time_date 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: Time::time_get (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":"core/time/internal.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4744558dd733a1f7ce727c07594c8bfb7cf969778d884a2c0c949b2c623d80"}},{"ruleId":"D1","level":"warning","message":{"text":"HashTable::spill_multiple_partitions (cyclomatic 17): HashTable::spill_multiple_partitions 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":"core/vdbe/hash_table.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe5a772db90cf223bac6c2c35064c69b859629b29a0355704b7a942fcc3ec16"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::storage::sqlite3_ondisk::read_integer (cyclomatic 17): turso_core::storage::sqlite3_ondisk::read_integer 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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b6542168298b8df0b4bd889da1e0a75864edbe53638785004a065cc804cb014"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::alter::emit_column_constraints_validation (cyclomatic 17): turso_core::translate::alter::emit_column_constraints_validation 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":"core/translate/alter.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb3ee02f785a372e4593e3588cc1434117a73961a379964d2ad0ca22565645f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::emitter::select::prune_join_order_for_materialized_inputs (cyclomatic 17): turso_core::translate::emitter::select::prune_join_order_for_materialized_inputs 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":"core/translate/emitter/select.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"010da83e95a1c5302cfc1415d299fb195ede82cabb7226d419904263663ce73e"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::expr::binary::emit_binary_expr_row_valued (cyclomatic 17): turso_core::translate::expr::binary::emit_binary_expr_row_valued 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":"core/translate/expr/binary.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f131e605a778914a281affd604ec6158ed49a45f41144c20cfd4e8e1e5e69fe"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::index::validate_index_expression (cyclomatic 17): turso_core::translate::index::validate_index_expression 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":"core/translate/index.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7782494d7e59166d43c6721a8a75d043798f77a40b80f5d420a683199e5482d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::main_loop::close::emit_unmatched_right_rows (cyclomatic 17): turso_core::translate::main_loop::close::emit_unmatched_right_rows has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/close.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"369fe04bd5dc83ac175dc777bc7dc5d2960cc2d3aa47bdf0a8738ff7517e59af"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::usable_constraints_for_lhs_mask (cyclomatic 17): turso_core::translate::optimizer::constraints::usable_constraints_for_lhs_mask 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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"d27e80a74df35414be777e7438abe9d4fe217208a8ba170e40cc4debca00b7ff"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::subquery::update_column_used_masks (cyclomatic 17): turso_core::translate::subquery::update_column_used_masks has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function items inside it that branch (propagate_outer_refs_from_select_plan, propagate_outer_refs_from_plan). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/subquery.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e68443f1c652bf30028dbbb5a5f6680a8a9433f851e4f8f16da7db908ff5206"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::execute::op_program (cyclomatic 17): turso_core::vdbe::execute::op_program 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":"core/vdbe/execute.rs"},"region":{"startLine":5940}}}],"partialFingerprints":{"codehealthFindingId/v1":"3392125ab3503075de2769bb5b00cbdde30afb199d4497ae68317b41a3a13566"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::sorter::normalized_first_key (cyclomatic 17): turso_core::vdbe::sorter::normalized_first_key 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":"core/vdbe/sorter.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa83f01ee51d703d95b9259f7afbe02ec251e00dde838e6d556d8f68654db347"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::vacuum::build_copy_sql (cyclomatic 17): turso_core::vdbe::vacuum::build_copy_sql 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":"core/vdbe/vacuum.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"973db76b0eadde81e00ddba4523181f000e27b570ae6a23204e7def09a987afc"}},{"ruleId":"D1","level":"warning","message":{"text":"limbo_fuzzy::translit::script_code (cyclomatic 17): limbo_fuzzy::translit::script_code 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":"extensions/fuzzy/src/translit.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4497a8e36823e86bf6b84c81b47cf5a89a341c9cc46ca26248e699cd436ac4ab"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_macros::ext::match_ignore_ascii_case::match_ignore_ascci_case (cyclomatic 17): turso_macros::ext::match_ignore_ascii_case::match_ignore_ascci_case has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. 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":"macros/src/ext/match_ignore_ascii_case.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c74701501cdfeb1352b42db217028e69050d7627c7d5ef9eb86aca69387fd60"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement::fmt (cyclomatic 17): Statement::fmt 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":"postgres/dump-fuzzer/src/generation/model.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef39bf62fef4c76bddd8510b3a73c3d305fbccc8ead04e86782b5e6998759c3"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_dump_fuzzer::generation::access_control::access_control (cyclomatic 17): turso_pg_dump_fuzzer::generation::access_control::access_control 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":"postgres/dump-fuzzer/src/generation/access_control.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5111ac24b603ffb7b744cc44fcdd3e12f7ac656d6e12e43891ea3a6c424ae732"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::functions::like_matches (cyclomatic 17): turso_pg::functions::like_matches 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":"postgres/frontend/functions.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a08c5667f32f98b52046934bf184833fec553593bf3bf591a3cdb3b3f1b0a52"}},{"ruleId":"D1","level":"warning","message":{"text":"Insert::fmt (cyclomatic 17): Insert::fmt 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":"sql_generation/model/query/insert.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de928d10d18f44b949e7c06b477e824c7f4d7d7cf420a03b9cde551561a1fd7"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_generation::generation::generated_expr::generate_expr_inner (cyclomatic 17): sql_generation::generation::generated_expr::generate_expr_inner 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":"sql_generation/generation/generated_expr.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc224f448717b963d2692b04ebc3f7f6e2c288f0e5bd248f84a5f216844c773"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_type (cyclomatic 17): Parser::parse_type 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. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_stmt (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":"sqlite/parser/src/parser.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a510f3ab06d9c6af43a4cdc8e537c80cbd290e1c35f6d91564f069f155248cc0"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseReplayGenerator::execute_ddl_idempotent (cyclomatic 17): DatabaseReplayGenerator::execute_ddl_idempotent 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":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"85b1e01d00858938db46636058e5e3f92ad7ca19f7c80a0549acc0bbc3ed58cb"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::wal_pull_to_file_legacy (cyclomatic 17): turso_sync_engine::database_sync_operations::wal_pull_to_file_legacy 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1d81b97df1aaf63ef1c89b92161cc3e6c88ca05658f657aee77882d6c9f085"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_gen_prop::cte::recursive_cte_definition (cyclomatic 17): sql_gen_prop::cte::recursive_cte_definition 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":"testing/differential-oracle/sql_gen_prop/cte.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab5f6b2cbfdf91205375a080ba2646e9c0517d0499c4bd2123732e2f05d3e12"}},{"ruleId":"D1","level":"warning","message":{"text":"SimulatorEnv::new (cyclomatic 17): SimulatorEnv::new 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":"testing/simulator/runner/env.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b7887a67e46e5c6ffdd799bba23d7daaed18d017ce22c10acb15fe6ff52856c"}},{"ruleId":"D1","level":"warning","message":{"text":"limbo_sim::run_simulator (cyclomatic 17): limbo_sim::run_simulator 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":"testing/simulator/main.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2f9877ea9c54f5674e6a1aa8f877059b405863f1c2d6843e0a206542d87db6"}},{"ruleId":"D1","level":"warning","message":{"text":"JDBC4PreparedStatement.setObject (cyclomatic 17): JDBC4PreparedStatement.setObject 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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a8a538e0dff404649f307d537b604948f88cfd685c295525b8dc105c78b037"}},{"ruleId":"D1","level":"warning","message":{"text":"SqliteDataReader.GetFieldValue (cyclomatic 16): SqliteDataReader.GetFieldValue 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"824ac901185ccbd0e5ed53df7ce2aa969401aea39e3549ee4a3644539bace1d6"}},{"ruleId":"D1","level":"warning","message":{"text":"TursoSqliteCommandInterceptor.TrySkipTriviaOrString (cyclomatic 16): TursoSqliteCommandInterceptor.TrySkipTriviaOrString has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function, or replace a long branch ladder over a single value with a data-driven lookup or dispatch table."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteRelationalConnection.cs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6300123325e9a0b1fea4210f544341bae0f2448e9d3dd50a86f2991012999c72"}},{"ruleId":"D1","level":"warning","message":{"text":"Database::init_pager (cyclomatic 16): Database::init_pager 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":"core/database.rs"},"region":{"startLine":3347}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a522feea1e2d6cebfbf0b1339e41df8965a67e740994044dc38e050bbcfac52"}},{"ruleId":"D1","level":"warning","message":{"text":"FtsCursor::stage_statement_commit (cyclomatic 16): FtsCursor::stage_statement_commit 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":"core/index_method/fts/mod.rs"},"region":{"startLine":3583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b11c47bb209debd131e07b74bdd72a9d3d87e5352a56a83fe84f733ded5634"}},{"ruleId":"D1","level":"warning","message":{"text":"Jsonb::serialize_int5 (cyclomatic 16): Jsonb::serialize_int5 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":"core/json/jsonb.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"668d06ccb45281729d56162270f958517858c084485a0e718e3060da88411f58"}},{"ruleId":"D1","level":"warning","message":{"text":"Jsonb::deserialize_obj (cyclomatic 16): Jsonb::deserialize_obj 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":"core/json/jsonb.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23178050cb77214441e46de07410d7477419222c393baf0c58e5d4ce96ac3b4"}},{"ruleId":"D1","level":"warning","message":{"text":"Jsonb::container_property_iterator (cyclomatic 16): Jsonb::container_property_iterator 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":"core/json/jsonb.rs"},"region":{"startLine":3441}}}],"partialFingerprints":{"codehealthFindingId/v1":"562b513ce8b880e79e1761aaa7de2faef25ef1456670a530de07c993b4aa8b54"}},{"ruleId":"D1","level":"warning","message":{"text":"MvccLazyCursor::next (cyclomatic 16): MvccLazyCursor::next has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MvccLazyCursor::prev) 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":"core/mvcc/cursor.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c339e3cce1a5cbf5d90cb3ca4119f17e3b34fe5ca22932855d7dc4f0ec9e54"}},{"ruleId":"D1","level":"warning","message":{"text":"MvccLazyCursor::prev (cyclomatic 16): MvccLazyCursor::prev has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (MvccLazyCursor::next) 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":"core/mvcc/cursor.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b123680b85106933be58b849f5a292481ab0508823413e1d263d4d5cb3f2c0"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::rollback_tx_inner (cyclomatic 16): MvStore::rollback_tx_inner has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: CommitState::fmt (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":"core/mvcc/database/mod.rs"},"region":{"startLine":7144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e36b90f3a7d4a680de168f1861ba6798103feac2a57b8335bf1f90c0fefd6fcc"}},{"ruleId":"D1","level":"warning","message":{"text":"MvStore::gc_incremental (cyclomatic 16): MvStore::gc_incremental has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: CommitState::fmt (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":"core/mvcc/database/mod.rs"},"region":{"startLine":8203}}}],"partialFingerprints":{"codehealthFindingId/v1":"594c4afa3cdf84ec957d577e013898911d6d0c9db8f44f80c986bb376682f897"}},{"ruleId":"D1","level":"warning","message":{"text":"GeneratedColGraph::build (cyclomatic 16): GeneratedColGraph::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":"core/schema.rs"},"region":{"startLine":5562}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f44a7594a7b76da75c708770052e0c1ad670667d911d72259d0ba525cf15695"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement::get_column_name (cyclomatic 16): Statement::get_column_name has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb8c252946d90bbe17fd30d05f74f602a0bf8943890f01e8d824828f7919bd8"}},{"ruleId":"D1","level":"warning","message":{"text":"BTreeCursor::indexbtree_move_to_inner (cyclomatic 16): BTreeCursor::indexbtree_move_to_inner 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":"core/storage/btree.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"9093179a4020583a11686a81b661861ae3a0dd59830324f0a2451c181660e694"}},{"ruleId":"D1","level":"warning","message":{"text":"InProcessWalCoordination::try_begin_read_tx (cyclomatic 16): InProcessWalCoordination::try_begin_read_tx 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":"core/storage/wal.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"de34a600ea6e236964f05de0680059d12907096be1e5f456be59bece2a5b1354"}},{"ruleId":"D1","level":"warning","message":{"text":"GraceHashLoop::emit (cyclomatic 16): GraceHashLoop::emit 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":"core/translate/main_loop/hash.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5703be18984ae224eca6ce69b1f5ba201a449fdbdffa862c586bd455266b2c1"}},{"ruleId":"D1","level":"warning","message":{"text":"EmitOrderBy::sorter_insert (cyclomatic 16): EmitOrderBy::sorter_insert 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":"core/translate/order_by.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae85399cd58630ca32a8ae5a5f9f8855e3e743dbe820242af619e4ae54c446f"}},{"ruleId":"D1","level":"warning","message":{"text":"EmitWindow::init (cyclomatic 16): EmitWindow::init 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":"core/translate/window.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14d1a7ca6fd039e1264f432c7cb80a4d4b222e969aba36df96867dcfd46d79c"}},{"ruleId":"D1","level":"warning","message":{"text":"ProgramBuilder::emit_column (cyclomatic 16): ProgramBuilder::emit_column 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: ProgramBuilder::resolve_labels (cyclomatic 65) 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":"core/vdbe/builder.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f06f678eaff663cebdaa61a5a2ed7850ce496e5585d30b8a1885021c6767c81"}},{"ruleId":"D1","level":"warning","message":{"text":"HashTable::insert_distinct (cyclomatic 16): HashTable::insert_distinct 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":"core/vdbe/hash_table.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc555a0b9150908883fa3c15ec088180b87edd52603fd9db30bdae54c4f979bc"}},{"ruleId":"D1","level":"warning","message":{"text":"SortedChunk::next (cyclomatic 16): SortedChunk::next 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":"core/vdbe/sorter.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f97ea013b097e00f4b9d979ecdf16418b720feb130c51fb25c6ff0bb310e1e"}},{"ruleId":"D1","level":"warning","message":{"text":"Vector::from_data_with_dims (cyclomatic 16): Vector::from_data_with_dims 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":"core/vector/vector_types.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39e76fd3130a6f15d0ab07088c13a1814f35e7afc8d7c71f23082168c9991b6"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::arrangement::emit_output_arrangement (cyclomatic 16): turso_core::incremental::vdbe_maintenance::arrangement::emit_output_arrangement 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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30dae299c55d0a8bbb9158c34838badfb484eb126a46fbb8b8ff25ff5afa94d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::join::emit_inner_join (cyclomatic 16): turso_core::incremental::vdbe_maintenance::join::emit_inner_join 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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9332616515a5ee3617233f4947a34c0f19f14c89a2977831e62f343f3a5ad10"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::storage::wal::classify_authority_snapshot_against_wal (cyclomatic 16): turso_core::storage::wal::classify_authority_snapshot_against_wal 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":"core/storage/wal.rs"},"region":{"startLine":5747}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f773811ba07aa77174f5eb3dbe8f067dfcf5e67fa5a3771704dcc1bba717bde"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::compound_select::emit_program_for_compound_select (cyclomatic 16): turso_core::translate::compound_select::emit_program_for_compound_select 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":"core/translate/compound_select.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f18bbcaac3da500365c9f1048252b850a1eb544d5e593108c1742fc20a08b14f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::compound_select::emit_compound_select (cyclomatic 16): turso_core::translate::compound_select::emit_compound_select 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":"core/translate/compound_select.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0d852f46c0d54f9d51aa5d2b0c9443e408f3d29c8c73f09678866701f8b27"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::emitter::delete::emit_delete_insns (cyclomatic 16): turso_core::translate::emitter::delete::emit_delete_insns 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":"core/translate/emitter/delete.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"52192356a1c1c138058e4035d4de1bac8bd29e2a85fa928323831a8c13bdfa8b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::update_write_set_reason (cyclomatic 16): turso_core::translate::optimizer::update_write_set_reason 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"9363b67c2a96b860768004a4bc4edf9c3e2bdd9b6bfa680448f7942333dee31e"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::join::compute_indexed_seek_benefits (cyclomatic 16): turso_core::translate::optimizer::join::compute_indexed_seek_benefits 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":"core/translate/optimizer/join.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b00406ce6b0cff4f1946a162860c31c0297aaf2d770cfeed82d346d8b95625"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::replace_subquery_value (cyclomatic 16): turso_core::translate::optimizer::unnest::replace_subquery_value 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":"core/translate/optimizer/unnest.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9b8ad967f5746bad147f2aa0da39c90be2365b23a7546befea3d57db929368"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::planner::prepare_recursive_cte_plan (cyclomatic 16): turso_core::translate::planner::prepare_recursive_cte_plan has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"96127091ee3f179a916076ce49496cdadd0c205c072f2c1ae069ff1f25cca811"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::select::resolve_compound_order_by_expr (cyclomatic 16): turso_core::translate::select::resolve_compound_order_by_expr 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":"core/translate/select.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"342495f2749b4a71ec3e14bb3f6a83bb8e3398041087fee1958fac69c2954a7f"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::trigger_exec::rewrite_trigger_expr_single_for_subprogram (cyclomatic 16): turso_core::translate::trigger_exec::rewrite_trigger_expr_single_for_subprogram 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":"core/translate/trigger_exec.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2a94586d85f66a964bdac91a94b74aeeb6769a0a313af0963b687a5c0c8a57"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::update::collect_indexes_to_update (cyclomatic 16): turso_core::translate::update::collect_indexes_to_update 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":"core/translate/update.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70d331d5bf456bc5854e5a32709fab4bd3a387f65a28b6e07d68185c33e785d"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::translate::upsert::rewrite_expr_to_registers (cyclomatic 16): turso_core::translate::upsert::rewrite_expr_to_registers 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":"core/translate/upsert.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d3f07dbbe8592fdb0397e8de1bd07d502ccce639fc781cc527a174f972dcdb"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::util::rewrite_one_select_table_refs (cyclomatic 16): turso_core::util::rewrite_one_select_table_refs 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":"core/util.rs"},"region":{"startLine":4453}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a37d89b888590d9ac5ebf7b5ef1b189a2a0c01ea4031e28a4052c06da17b016"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::step_view_delta_batch (cyclomatic 16): turso_core::vdbe::step_view_delta_batch has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: ActiveOpState::fmt (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c0239d8e6c1a7df7f7d5e6eed88c6f796ae4e4a9629564933ffa7118311ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_core::vdbe::affinity::create_result_from_significand (cyclomatic 16): turso_core::vdbe::affinity::create_result_from_significand 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":"core/vdbe/affinity.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"06592843ced27f29e2d3ba526ccb03dbf7c588b93e40140ef82dae6cac528fce"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg::functions::copy_without_null_fields (cyclomatic 16): turso_pg::functions::copy_without_null_fields 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":"postgres/frontend/functions.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2205cfcd8a29d1d00733e07b95713404ecd701bad35327ac13a2b4c5fc9f0a"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_postfix_expression (cyclomatic 16): Parser::parse_postfix_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. This is NOT this file\u0027s highest cyclomatic complexity: Parser::parse_statement (cyclomatic 30) 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":"postgres/parser/parser.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84afaa04ff01160a0fbc959cdfbbfbf2e78498c7bf2b4b464f8cd6cad49205f"}},{"ruleId":"D1","level":"warning","message":{"text":"PostgreSQLTranslator::translate_frame_options (cyclomatic 16): PostgreSQLTranslator::translate_frame_options has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: turso_pg_parser::translator::expression_name (cyclomatic 25) 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":"postgres/parser/translator.rs"},"region":{"startLine":4536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e10026ab240c5b7a3173bde8edf900e75403c5074c7b3b298e3bf5f1b65f01"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::copy::try_extract_copy_to_stdout (cyclomatic 16): turso_pg_parser::copy::try_extract_copy_to_stdout 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":"postgres/parser/copy.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9226b1daee32243bde0ba2758d3bd186ceea0bddb663653d86bc46947b55fd2"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_parser::create_function::check_create_function (cyclomatic 16): turso_pg_parser::create_function::check_create_function 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":"postgres/parser/create_function.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dea0fe4afc5f90647b8016ef038167036d9f1bce93232603da88f3da6bd0c1b"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_pg_regress::describe::table_footers (cyclomatic 16): turso_pg_regress::describe::table_footers 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":"postgres/regress/describe.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f29724089a9c341e8ffed97258e23bdf95b1434f74e3f692ca3539a0d92cdad9"}},{"ruleId":"D1","level":"warning","message":{"text":"AlterTable::shadow (cyclomatic 16): AlterTable::shadow 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: Query::fmt (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":"testing/simulator/model/mod.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1adf72e705c94d07ab7512f00091c8e2431ae0dd14c94d1003236e39a8de0a"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseSyncEngine::apply_logical_mvcc_changes_internal (cyclomatic 16): DatabaseSyncEngine::apply_logical_mvcc_changes_internal 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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8a9e0ecdfc38754ee80ce6310b11c4b817f60faee075a9e8901812ab458db8"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::decode_recovery_ops_to_logical_txn (cyclomatic 16): turso_sync_engine::database_sync_operations::decode_recovery_ops_to_logical_txn 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c1c41e0b4466dfa530e5834f411b248ac0515ea679f4c62abd97ceca990ce4"}},{"ruleId":"D1","level":"warning","message":{"text":"Whopper::maybe_probe_checkpoint_on_suspended_statement (cyclomatic 16): Whopper::maybe_probe_checkpoint_on_suspended_statement 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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7d7d4b61a09e0a2f607092cb9f43ac1e8e2fecb65c1a3b92f04a758d855d9a"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_whopper::run_multiprocess (cyclomatic 16): turso_whopper::run_multiprocess 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":"testing/concurrent-simulator/main.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed29bf6b477848a1be172a5f1265fe6a5693f43bafe350795f8e819a8c98d34"}},{"ruleId":"D1","level":"warning","message":{"text":"turso_whopper::build_inprocess_opts (cyclomatic 16): turso_whopper::build_inprocess_opts 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":"testing/concurrent-simulator/main.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d13bd4e4ea2db9a5787c9b86e7c51fbf782867f02f7e009151d6b90a4be57b7"}},{"ruleId":"D1","level":"warning","message":{"text":"sql_gen::generate::stmt::generate_update_sets (cyclomatic 16): sql_gen::generate::stmt::generate_update_sets has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: sql_gen::generate::stmt::dispatch_stmt_generation (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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8881e14b78b56b53ea3b511ab91eaf5fb2c35bda3e1643542a403f1c433e69"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse (cyclomatic 16): Parser::parse 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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8943727af6877743c859fef4cb1c29a6754ba71e19aa86381425eac67783e1a0"}},{"ruleId":"D1","level":"warning","message":{"text":"TestRunner::run_loaded_tests (cyclomatic 16): TestRunner::run_loaded_tests 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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3417c72b550c365fc3404068e2ba2c3fc5577a5f5eb5a7add82a6cf8b1edb137"}},{"ruleId":"D1","level":"warning","message":{"text":"JDBC4DatabaseMetaData.getTables (cyclomatic 16): JDBC4DatabaseMetaData.getTables 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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4DatabaseMetaData.java"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d20d7cfe8e63100635522507b424a654190b06db65a7c844153a296466b0ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"lib._first_keyword (cyclomatic 16): lib._first_keyword 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":"bindings/python/turso/lib.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e3bb69197a132f027149579944bb39dcc9a6485f4675d8f7c125ec4fdbe795"}},{"ruleId":"D1","level":"warning","message":{"text":"dbapi._first_keyword (cyclomatic 16): dbapi._first_keyword 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":"serverless/python/turso_serverless/dbapi.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb55b6141bab3e4f30d14cad4787dd7272e113f65134db948570bac2dd0188e"}},{"ruleId":"D1","level":"warning","message":{"text":"ioProcessor.processHttpRequest (cyclomatic 16): ioProcessor.processHttpRequest 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":"bindings/react-native/src/internal/ioProcessor.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"5361b795a62710a69ed4f6df0bdbb6c708adb592dd2264f3c7fe7a7a4eb26bfb"}},{"ruleId":"D1","level":"warning","message":{"text":"protocol.encodeValue (cyclomatic 16): protocol.encodeValue 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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ea802c4388c58f0d780bb7a7eeb8349f3d07e4680b7036683bdabb736ef8db"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_function (cognitive 405): turso_core::vdbe::execute::op_function has cognitive complexity 405 (threshold 15). Drivers by points: if/else 66 (217 pts), match/switch 37 (101 pts), loops 16 (85 pts), boolean chains 2 (nesting depth added 284). 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":"core/vdbe/execute.rs"},"region":{"startLine":10010}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c70439327378f3c6a5f1dd12766914f6fc78e62dd92876bb7e094373bab508"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::translate_alter_table (cognitive 372): turso_core::translate::alter::translate_alter_table has cognitive complexity 372 (threshold 15). Drivers by points: if/else 112 (270 pts), loops 23 (56 pts), boolean chains 25, match/switch 8 (21 pts) (nesting depth added 204). 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":"core/translate/alter.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f6e63c5eb690d1a96ff47716c755ca7f3c622a9bd87281181a79686b09e7acb"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_transaction_inner (cognitive 350): turso_core::vdbe::execute::op_transaction_inner has cognitive complexity 350 (threshold 15). Drivers by points: if/else 74 (291 pts), match/switch 8 (36 pts), boolean chains 22, loops 1 (nesting depth added 245). 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":"core/vdbe/execute.rs"},"region":{"startLine":4529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec926f972339fffeff0c67c1d3eed46ebfec7c65130a14d092f23894e9fd59c8"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::balance_non_root (cognitive 311): BTreeCursor::balance_non_root has cognitive complexity 311 (threshold 15). Drivers by points: if/else 75 (224 pts), loops 21 (67 pts), match/switch 4 (14 pts), boolean chains 6 (nesting depth added 205). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":3604}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4337f26d6502d22110ff60afddd15c592ed3413ea3095fafb482691104ae69"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::update::emit_update_insns (cognitive 253): turso_core::translate::emitter::update::emit_update_insns has cognitive complexity 253 (threshold 15). Drivers by points: if/else 110 (192 pts), loops 12 (26 pts), boolean chains 23, match/switch 8 (12 pts) (nesting depth added 100). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e40ed43ee602bd8993274219d51bffcb47548f96e1b3b5df48de2e272a34a9"}},{"ruleId":"D2","level":"warning","message":{"text":"SequenceCorrectnessProperty::finish_op (cognitive 250): SequenceCorrectnessProperty::finish_op has cognitive complexity 250 (threshold 15). Drivers by points: if/else 58 (209 pts), boolean chains 22, loops 3 (10 pts), match/switch 4 (9 pts) (nesting depth added 163). 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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0f11c789acbe18befc1b9de70d895fc3c12628ec3580ead37aa9264e4afa58"}},{"ruleId":"D2","level":"warning","message":{"text":"Property::interactions (cognitive 244): Property::interactions has cognitive complexity 244 (threshold 15). Drivers by points: if/else 68 (168 pts), loops 11 (36 pts), match/switch 14 (36 pts), boolean chains 4 (nesting depth added 147). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb867d53c8abfebbafe5d52e6372953544459338800b229858f1a3c32ed216c"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStateMachine::step_inner (cognitive 197): CheckpointStateMachine::step_inner has cognitive complexity 197 (threshold 15). Drivers by points: if/else 80 (170 pts), match/switch 11 (21 pts), boolean chains 6 (nesting depth added 100). 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f788ac338c8cb9f35f4c3a8640da93192bb115247fb897409f00a7432b6f6ea"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::pragma::query_pragma (cognitive 194): turso_core::translate::pragma::query_pragma has cognitive complexity 194 (threshold 15). Drivers by points: if/else 36 (80 pts), loops 26 (66 pts), match/switch 20 (46 pts), boolean chains 2 (nesting depth added 110). 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":"core/translate/pragma.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f2fb0e8f936cb92b0c329637d0d706fdd4cb40145709cb37e9b156d1d7ac32"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::binding::bind_and_rewrite_expr (cognitive 189): turso_core::translate::expr::binding::bind_and_rewrite_expr has cognitive complexity 189 (threshold 15). Drivers by points: if/else 44 (137 pts), loops 9 (42 pts), match/switch 3 (6 pts), boolean chains 4 (nesting depth added 129). 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":"core/translate/expr/binding.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2257f495088fefe77c2c098c47c569f1d021dd40712af9215d6c1a1d451e57f"}},{"ruleId":"D2","level":"warning","message":{"text":"Stmt::to_tokens (cognitive 189): Stmt::to_tokens has cognitive complexity 189 (threshold 15). Drivers by points: if/else 77 (170 pts), loops 5 (14 pts), match/switch 3 (5 pts) (nesting depth added 104). 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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bd02063c06629f6d503828a155820ad36dd0b924dd86d9ba5a5bd21d1125ce"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorSparseInvertedIndexMethodCursor::query_start (cognitive 187): VectorSparseInvertedIndexMethodCursor::query_start has cognitive complexity 187 (threshold 15). Drivers by points: if/else 51 (169 pts), match/switch 4 (12 pts), boolean chains 5, loops 1 (nesting depth added 126). 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05dea7a7c5ceeaac2e2468463784c7dbbe4d9bf6a048cb5726480f69e14de41"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::dialect::engine::call_builtin_scalar (cognitive 184): turso_core::dialect::engine::call_builtin_scalar has cognitive complexity 184 (threshold 15). Drivers by points: if/else 55 (107 pts), match/switch 34 (67 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 87). 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":"core/dialect/engine.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff429f9d3aa121a56768ecad827e2fad50aa3397a9d890406c189596d41327cb"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::value::pattern_compare (cognitive 178): turso_core::vdbe::value::pattern_compare has cognitive complexity 178 (threshold 15). Drivers by points: if/else 34 (141 pts), loops 5 (19 pts), boolean chains 12, match/switch 2 (6 pts) (nesting depth added 125). 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":"core/vdbe/value.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c883e959959463ffcb6bd60c8d217cf0de2cd0b3577f09a1fe7c55976559036"}},{"ruleId":"D2","level":"warning","message":{"text":"InitLoop::emit (cognitive 175): InitLoop::emit has cognitive complexity 175 (threshold 15). Drivers by points: if/else 31 (113 pts), match/switch 11 (35 pts), loops 10 (23 pts), boolean chains 4 (nesting depth added 119). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/init.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70afae8478bb6a0e8cd940fac84fce34bd9a7bdaa2eb4b04f080a52e8139f96"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::schema::create_table (cognitive 175): turso_core::schema::create_table has cognitive complexity 175 (threshold 15). Drivers by points: if/else 42 (122 pts), loops 11 (25 pts), match/switch 7 (21 pts), boolean chains 7 (nesting depth added 108). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":7144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9839bf92b69da5f09de5392c42ae77c98c4434fc1f424ce2e05ca073131461f"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::post_balance_non_root_validation (cognitive 174): BTreeCursor::post_balance_non_root_validation has cognitive complexity 174 (threshold 15). Drivers by points: if/else 38 (132 pts), loops 7 (17 pts), match/switch 5 (17 pts), boolean chains 8 (nesting depth added 116). 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":"core/storage/btree.rs"},"region":{"startLine":4991}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c3c81cb0599cd2f01be588806c1899923d1cdb8eb704515d9176bcee00033"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::constraints_from_where_clause (cognitive 174): turso_core::translate::optimizer::constraints::constraints_from_where_clause has cognitive complexity 174 (threshold 15). Drivers by points: if/else 29 (111 pts), match/switch 8 (36 pts), loops 6 (14 pts), boolean chains 13 (nesting depth added 118). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a25124fd02b9fb329fc43f36c0961866462384278f3e1bf68a2316cddbd127a"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::recover_process_frame (cognitive 167): MvStore::recover_process_frame has cognitive complexity 167 (threshold 15). Drivers by points: if/else 45 (136 pts), match/switch 11 (23 pts), boolean chains 5, loops 3 (nesting depth added 103). 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":"core/mvcc/database/mod.rs"},"region":{"startLine":9881}}}],"partialFingerprints":{"codehealthFindingId/v1":"47af9644b5803f03f866119c5005c16b8a0a1f06f8d058b4ed0440bb330f57b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::navigate_to_segment (cognitive 166): Jsonb::navigate_to_segment has cognitive complexity 166 (threshold 15). Drivers by points: if/else 42 (117 pts), loops 8 (29 pts), boolean chains 10, match/switch 4 (10 pts) (nesting depth added 102). 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":"core/json/jsonb.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dceecf96c2486ba65e6b63f911804e6ce5dbb68da42ce4d604e7841fba2ffd"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::translator::translate_function_call_expr (cognitive 162): turso_core::translate::expr::translator::translate_function_call_expr has cognitive complexity 162 (threshold 15). Drivers by points: if/else 40 (110 pts), loops 14 (40 pts), match/switch 6 (11 pts), boolean chains 1 (nesting depth added 101). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b9ff312dee62201b889311d64ea0ab751bb209ae919ba5d1697f3d3779b06c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::upsert::emit_upsert (cognitive 157): turso_core::translate::upsert::emit_upsert has cognitive complexity 157 (threshold 15). Drivers by points: if/else 69 (122 pts), loops 11 (26 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 69). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/upsert.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"1009244755526c329769e9175d1be85b240b154a0245cb18215c9fcf566d67e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::abort (cognitive 155): Program::abort has cognitive complexity 155 (threshold 15). Drivers by points: if/else 38 (106 pts), boolean chains 22, match/switch 8 (22 pts), loops 1 (5 pts) (nesting depth added 86). Of this number, 153 points are the body\u0027s own statements and 2 belong to 2 function items inside it that branch. 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":"core/vdbe/mod.rs"},"region":{"startLine":3546}}}],"partialFingerprints":{"codehealthFindingId/v1":"910934ad5c2fffb809526eb9b7a1168e7f772327f48e7b58946ed9a97f876ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::join::join_lhs_and_rhs (cognitive 155): turso_core::translate::optimizer::join::join_lhs_and_rhs has cognitive complexity 155 (threshold 15). Drivers by points: if/else 41 (122 pts), boolean chains 19, loops 4 (8 pts), match/switch 2 (6 pts) (nesting depth added 89). 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":"core/translate/optimizer/join.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"742bb32bbfbe92654ed1a4f6daf19f870d4b27a15d99cbd6194ee003c09c08d2"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::select::prepare_one_select_plan (cognitive 154): turso_core::translate::select::prepare_one_select_plan has cognitive complexity 154 (threshold 15). Drivers by points: if/else 33 (90 pts), loops 15 (37 pts), match/switch 6 (17 pts), boolean chains 10 (nesting depth added 90). 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":"core/translate/select.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2cfa7f6af97bca7d27e48894d0cb1b28099bf9cad4fcf21526bf4bdf22d919"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSyncEngine::apply_changes_internal (cognitive 150): DatabaseSyncEngine::apply_changes_internal has cognitive complexity 150 (threshold 15). Drivers by points: if/else 59 (101 pts), match/switch 10 (23 pts), boolean chains 19, loops 4 (7 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0687408439cc6544ab8602e51c426486e6d7fedd24a6a5c12ba7f92afc6dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::join::compute_best_join_order_with_context (cognitive 146): turso_core::translate::optimizer::join::compute_best_join_order_with_context has cognitive complexity 146 (threshold 15). Drivers by points: if/else 36 (110 pts), loops 9 (25 pts), match/switch 4 (9 pts), boolean chains 2 (nesting depth added 95). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/join.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e83a807a8d118653d082142f4845e690831ba830bf36fc01f32bafcbec552ce"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_insert (cognitive 146): turso_core::vdbe::execute::op_insert has cognitive complexity 146 (threshold 15). Drivers by points: if/else 48 (124 pts), match/switch 9 (16 pts), boolean chains 5, loops 1 (nesting depth added 83). 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":"core/vdbe/execute.rs"},"region":{"startLine":11687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ff8d8f69440f5daf8b783904ebdcc9478655f2c511cfae815bdbadb6d22684"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::datetime::parse_arithmetic_modifier (cognitive 137): turso_core::functions::datetime::parse_arithmetic_modifier has cognitive complexity 137 (threshold 15). Drivers by points: if/else 53 (129 pts), boolean chains 8 (nesting depth added 76). 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":"core/functions/datetime.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"c275c20b84851b9a202b868e5ad5769dc35f5a62f992c0707d5b4be9e9db78a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::next_token (cognitive 134): Parser::next_token has cognitive complexity 134 (threshold 15). Drivers by points: match/switch 26 (87 pts), if/else 17 (43 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 89). Of this number, 133 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"33adc84d1e8779d2309d785c790c9cafa12ddd900270ede6d698d46cb2da0191"}},{"ruleId":"D2","level":"warning","message":{"text":"CommitStateMachine::step (cognitive 131): CommitStateMachine::step has cognitive complexity 131 (threshold 15). Drivers by points: if/else 52 (102 pts), match/switch 8 (16 pts), boolean chains 11, loops 1 (2 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41c14c9a0b91e83511ccddc8c07d9c35c116e01db0c84addff3ffb4535d6162"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::jsonb::unescape_string (cognitive 130): turso_core::json::jsonb::unescape_string has cognitive complexity 130 (threshold 15). Drivers by points: if/else 24 (110 pts), loops 4 (16 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 100). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":4083}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd478873c6d088efe67e951631794759634d9c3a98f3b461970b6e737b9b676"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::seek_internal::inner (cognitive 129): turso_core::vdbe::execute::seek_internal::inner has cognitive complexity 129 (threshold 15). Drivers by points: match/switch 17 (65 pts), if/else 25 (60 pts), boolean chains 3, loops 1 (nesting depth added 83). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"core/vdbe/execute.rs"},"region":{"startLine":6667}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6614684cc150eb05225add0bbd166d95ad944118cf0860617ecca1e0860d6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Generated::parse (cognitive 125): Generated::parse has cognitive complexity 125 (threshold 15). Drivers by points: if/else 29 (91 pts), loops 6 (20 pts), match/switch 3 (14 pts) (nesting depth added 87). 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":"postgres/dump-fuzzer/src/summary.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3dc0567a9b74dd881bc5a01242337a9839e7eb3aeb9b999990a3a7c79cac15"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeTable::to_sql_as (cognitive 122): BTreeTable::to_sql_as has cognitive complexity 122 (threshold 15). Drivers by points: if/else 38 (88 pts), loops 10 (18 pts), boolean chains 10, match/switch 2 (6 pts) (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":6078}}}],"partialFingerprints":{"codehealthFindingId/v1":"8125eec9f3d00db002ed6f52fddd458b75cbb3d56b13b5d107b6e358cd727280"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::btree::integrity_check (cognitive 119): turso_core::storage::btree::integrity_check has cognitive complexity 119 (threshold 15). Drivers by points: if/else 34 (101 pts), loops 4 (9 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":8405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa535060979d263241d6539f8ee335a33aa0ff38cea081228ddb0a30a738926"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_stress::async_main (cognitive 119): turso_stress::async_main has cognitive complexity 119 (threshold 15). Drivers by points: if/else 31 (75 pts), loops 11 (29 pts), match/switch 4 (10 pts), boolean chains 5 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/stress/main.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fcbb8ddd33f83889afbc2612e8afda46837224137d979880f0a523e895f68a"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::deserialize_string (cognitive 110): Jsonb::deserialize_string has cognitive complexity 110 (threshold 15). Drivers by points: if/else 34 (86 pts), loops 4 (11 pts), boolean chains 10, match/switch 1 (3 pts) (nesting depth added 61). 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":"core/json/jsonb.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"0159b943b428506eb1e60666706187240e2b5d48675fb902ab52f233ded09e0e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_alter_column (cognitive 110): turso_core::vdbe::execute::op_alter_column has cognitive complexity 110 (threshold 15). Drivers by points: if/else 32 (74 pts), loops 16 (32 pts), boolean chains 4 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":16956}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4daee65a333ced812777251b7f8d3416179da575b6d546271b797e47eb7c707"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::insert::translate_insert (cognitive 109): turso_core::translate::insert::translate_insert has cognitive complexity 109 (threshold 15). Drivers by points: if/else 58 (72 pts), boolean chains 22, loops 5 (8 pts), match/switch 4 (7 pts) (nesting depth added 20). 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":"core/translate/insert.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"c251f74b1bc3fba1c6632452b8e296c0398d6df9c3fb4af566c02382a3d7e52c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::update_agg_payload (cognitive 107): turso_core::vdbe::execute::update_agg_payload has cognitive complexity 107 (threshold 15). Drivers by points: if/else 37 (77 pts), match/switch 10 (23 pts), loops 1 (5 pts), boolean chains 2 (nesting depth added 57). 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":"core/vdbe/execute.rs"},"region":{"startLine":7441}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a43c373792fe3ba4f8ce12d986d0ac53884729bcacb1fbf54541fe646589c0"}},{"ruleId":"D2","level":"warning","message":{"text":"FtsCursor::drive_open (cognitive 104): FtsCursor::drive_open has cognitive complexity 104 (threshold 15). Drivers by points: if/else 29 (89 pts), match/switch 6 (14 pts), loops 1 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/fts/mod.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e32614dd5ea93552e180282dd8b82ee4a9642efb2aa2551e00397be85b3095c"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowTablesMut::apply_snapshot (cognitive 103): ShadowTablesMut::apply_snapshot has cognitive complexity 103 (threshold 15). Drivers by points: if/else 12 (52 pts), loops 12 (48 pts), match/switch 1 (3 pts) (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/env.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"9edfe3804f80d2dabc97c286316859f755b7def3f7b1d563ad14b7eb7014d155"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::translator::translate_column_expr (cognitive 102): turso_core::translate::expr::translator::translate_column_expr has cognitive complexity 102 (threshold 15). Drivers by points: if/else 43 (93 pts), boolean chains 5, match/switch 2 (4 pts) (nesting depth added 52). 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":"core/translate/expr/translator.rs"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f1edf3a5046b1e32bf7f0024c9aec8e3bf0ca27ebd2612f7930df7f5492667"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::vacuum::vacuum_in_place_step (cognitive 98): turso_core::vdbe::vacuum::vacuum_in_place_step has cognitive complexity 98 (threshold 15). Drivers by points: if/else 27 (80 pts), match/switch 4 (11 pts), loops 3 (7 pts) (nesting depth added 64). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/vacuum.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4633d48dbdb65a85300f61a2138c8b5a91408b8fca6bee063e19a262e436964"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::classes::translate_catalog_changes (cognitive 96): turso_pg::classes::translate_catalog_changes has cognitive complexity 96 (threshold 15). Drivers by points: if/else 26 (76 pts), loops 4 (10 pts), boolean chains 5, match/switch 2 (5 pts) (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/classes.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b96e3127b631fd46a014d289c378ab59bcca082e75f6f8a45df0c778d20b5e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::header_validation (cognitive 94): Database::header_validation has cognitive complexity 94 (threshold 15). Drivers by points: if/else 31 (78 pts), match/switch 3 (8 pts), boolean chains 7, loops 1 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"55decdacffbb37864a62755fcef8393a67e3e05995df4b92ca407d9f1715d378"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::apply_table_access_plan (cognitive 94): turso_core::translate::optimizer::apply_table_access_plan has cognitive complexity 94 (threshold 15). Drivers by points: if/else 29 (68 pts), loops 13 (20 pts), match/switch 2 (4 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eed63fdf797c363e9a466bead1ea623852d4fdb4e580683f19dccee88d9ca4b"}},{"ruleId":"D2","level":"warning","message":{"text":"Pager::commit_wal_inner (cognitive 93): Pager::commit_wal_inner has cognitive complexity 93 (threshold 15). Drivers by points: if/else 22 (70 pts), loops 4 (10 pts), match/switch 3 (9 pts), boolean chains 4 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":4545}}}],"partialFingerprints":{"codehealthFindingId/v1":"322c45a4b89b0d292d4db2408eb5d99c6fcec1784279dc94353a7272b2771f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_agg_step (cognitive 92): turso_core::vdbe::execute::op_agg_step has cognitive complexity 92 (threshold 15). Drivers by points: if/else 17 (74 pts), match/switch 4 (17 pts), boolean chains 1 (nesting depth added 70). 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":"core/vdbe/execute.rs"},"region":{"startLine":9229}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2228a530b898490f9c2c4fcf1832693cb4e5bc781bcc558e37419d08e2994a0"}},{"ruleId":"D2","level":"warning","message":{"text":"Limbo::handle_dot_command (cognitive 91): Limbo::handle_dot_command has cognitive complexity 91 (threshold 15). Drivers by points: if/else 26 (71 pts), match/switch 5 (12 pts), loops 2 (8 pts) (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/app.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fb398b1db2a273f2d41bc134e97300358f8b0846790e533107d216ee745fb5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::functions::validate_pg_input (cognitive 91): turso_pg::functions::validate_pg_input has cognitive complexity 91 (threshold 15). Drivers by points: if/else 34 (62 pts), match/switch 10 (19 pts), boolean chains 10 (nesting depth added 37). 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":"postgres/frontend/functions.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb57270160a12458008169de32726b9155ee781a342cbcd68a04c03038744cf"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::walk::walk_expr (cognitive 90): turso_core::translate::expr::walk::walk_expr has cognitive complexity 90 (threshold 15). Drivers by points: if/else 13 (45 pts), loops 11 (37 pts), match/switch 3 (8 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. This shape REPEATS in the file: one other method here (turso_core::translate::expr::walk::walk_expr_mut) 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":"core/translate/expr/walk.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17b6ec592056b9070ba11620d76a47507b97a2b8b0332aa6fd9c448e6539a74"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::walk::walk_expr_mut (cognitive 90): turso_core::translate::expr::walk::walk_expr_mut has cognitive complexity 90 (threshold 15). Drivers by points: if/else 13 (45 pts), loops 11 (37 pts), match/switch 3 (8 pts) (nesting depth added 63). Of this number, 80 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. This shape REPEATS in the file: one other method here (turso_core::translate::expr::walk::walk_expr) 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":"core/translate/expr/walk.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2cbea2a6a12fa5fa7c031d030f514305a03e4e071da3c0ac757b0de735a0dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgramState::end_statement (cognitive 86): ProgramState::end_statement has cognitive complexity 86 (threshold 15). Drivers by points: if/else 24 (60 pts), loops 6 (17 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 50). 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":"core/vdbe/mod.rs"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d636a1d88398b95177921a27aec8467c672d414ddd7ec535b6b3ff17f1bd81f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::translate_create_table (cognitive 86): turso_core::translate::schema::translate_create_table has cognitive complexity 86 (threshold 15). Drivers by points: if/else 32 (57 pts), loops 7 (17 pts), match/switch 5 (9 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":"core/translate/schema.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0c596454ae2688b2301f9ae2430e7fafcf4ae2dd88736a7e6f035227819dbc"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::select::generate_select_impl_inner (cognitive 86): sql_gen::generate::select::generate_select_impl_inner has cognitive complexity 86 (threshold 15). Drivers by points: if/else 36 (58 pts), boolean chains 11, match/switch 8 (10 pts), loops 2 (7 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a2e6f1710e44a24642566012a9091c7825687214ce316b3da73774137065efc"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::delete (cognitive 85): BTreeCursor::delete has cognitive complexity 85 (threshold 15). Drivers by points: if/else 24 (62 pts), match/switch 5 (14 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":7041}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a28a1e541a766a602b9e330f2c5db50e900921555d49be4c6586b74af854f35"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::select::build_materialized_build_input_plan (cognitive 81): turso_core::translate::emitter::select::build_materialized_build_input_plan has cognitive complexity 81 (threshold 15). Drivers by points: if/else 17 (52 pts), loops 10 (22 pts), match/switch 4 (7 pts) (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/select.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef2d3f4ff1f43bcd242b302f89b117c4758c8a9e4825da8bac673f1af5bc8bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner::feed_line (cognitive 81): Scanner::feed_line has cognitive complexity 81 (threshold 15). Drivers by points: if/else 29 (68 pts), boolean chains 10, match/switch 1 (2 pts), loops 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/regress/main.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab60f480d53bd91d136a374624c2bf3c6eb53130f3abe33c7e43939d1841bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::maybe_complete_interrupted_checkpoint_nonblock (cognitive 80): MvStore::maybe_complete_interrupted_checkpoint_nonblock has cognitive complexity 80 (threshold 15). Drivers by points: if/else 18 (54 pts), match/switch 7 (24 pts), boolean chains 1, loops 1 (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":9179}}}],"partialFingerprints":{"codehealthFindingId/v1":"324e781a4247a6ee55860fe9211590c63dd54a2108e5c77fd961f4db8f08bdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::inverse_agg_payload (cognitive 80): turso_core::vdbe::execute::inverse_agg_payload has cognitive complexity 80 (threshold 15). Drivers by points: if/else 34 (66 pts), match/switch 4 (9 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 38). 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":"core/vdbe/execute.rs"},"region":{"startLine":8995}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55b974f85c48ac9c2b3e667a00b227b1df3a4f119e0af49233423674de11e3c"}},{"ruleId":"D2","level":"warning","message":{"text":"tursoDbConnection.executeFully (cognitive 80): tursoDbConnection.executeFully has cognitive complexity 80 (threshold 15). Drivers by points: if/else 19 (72 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/go/driver_db.go"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6df92fcbb5a1bf26ea434b7626965ffa9ad1c3b23b81beb34524bd4665a882"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::destroy_btree_contents (cognitive 79): BTreeCursor::destroy_btree_contents has cognitive complexity 79 (threshold 15). Drivers by points: if/else 13 (42 pts), match/switch 9 (36 pts), loops 1 (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":5606}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8796d39b9c60bfb26f3d429cb5d060388b8b19ae67c847fac7294f4cee01d5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::integrity_check::translate_integrity_check_for_schema (cognitive 79): turso_core::translate::integrity_check::translate_integrity_check_for_schema has cognitive complexity 79 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 11 (25 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/integrity_check.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e7f9a09c3afb2ba7904a747e0d29dd8f9bbc43ff00b84ce159396605ba4dcb"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_fuzzy::editdist::edit_distance (cognitive 79): limbo_fuzzy::editdist::edit_distance has cognitive complexity 79 (threshold 15). Drivers by points: if/else 35 (58 pts), loops 9 (15 pts), boolean chains 6 (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":"extensions/fuzzy/src/editdist.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac438d44e4bbf370ca891722d7d7c17441cc50606a7be7371aa1fcf6a97b3f13"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::fkeys::emit_fk_child_update_counters (cognitive 78): turso_core::translate::fkeys::emit_fk_child_update_counters has cognitive complexity 78 (threshold 15). Drivers by points: if/else 29 (65 pts), loops 5 (10 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":"core/translate/fkeys.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"98012f2a91704e74787822994d80189cfb273a073a3e8fae0f90bce17df254f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::handle_schema_row (cognitive 77): Schema::handle_schema_row has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (64 pts), match/switch 5 (13 pts) (nesting depth added 48). 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":"core/schema.rs"},"region":{"startLine":4281}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f14ee89ba678c1bbf18d5501202a7dba740bdbb93c44f9d086d094198d020b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::subquery::get_subquery_parser (cognitive 77): turso_core::translate::subquery::get_subquery_parser has cognitive complexity 77 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 7 (20 pts), boolean chains 7, loops 2 (6 pts) (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":"core/translate/subquery.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60a035c7b58c9f06b24618ee725d806ff4dd5f4330853f5c684614a8c4c98a3"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_savepoint (cognitive 77): turso_core::vdbe::execute::op_savepoint has cognitive complexity 77 (threshold 15). Drivers by points: if/else 27 (60 pts), match/switch 6 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":5455}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f79bc3d441b26cc31dcf6ff6fd1b818a5fc9b8a08265415d81f4f07af0f6a1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::vacuum::vacuum_target_build_step (cognitive 77): turso_core::vdbe::vacuum::vacuum_target_build_step has cognitive complexity 77 (threshold 15). Drivers by points: if/else 14 (40 pts), match/switch 9 (22 pts), loops 4 (14 pts), boolean chains 1 (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":"core/vdbe/vacuum.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d5ab8d98dd704ff840d537f97ef2611c8951cbd6543c40793cb35699860b4"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_create_type (cognitive 77): Parser::parse_create_type has cognitive complexity 77 (threshold 15). Drivers by points: match/switch 13 (40 pts), if/else 13 (31 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 47). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":4917}}}],"partialFingerprints":{"codehealthFindingId/v1":"b268f7b7934f3bd655e4fd53cbdc40ac0197e6adc7fde616751d62de8bfa061b"}},{"ruleId":"D2","level":"warning","message":{"text":"WalFile::checkpoint_inner (cognitive 76): WalFile::checkpoint_inner has cognitive complexity 76 (threshold 15). Drivers by points: if/else 24 (65 pts), boolean chains 5, loops 2 (4 pts), match/switch 1 (2 pts) (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":"core/storage/wal.rs"},"region":{"startLine":5001}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e4c697f0c8b52b8a36a7b77894f00e6a1747590ec2d85ec042fef475076f1a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::main_loop::open::emit_table_read_start (cognitive 76): turso_core::translate::main_loop::open::emit_table_read_start has cognitive complexity 76 (threshold 15). Drivers by points: if/else 21 (59 pts), match/switch 6 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 47). 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":"core/translate/main_loop/open.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"4537cfe201bc3c10c4ed27503e350b9ff74732f718b56580f817cad2a7b297a0"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::parse_table (cognitive 76): turso_core::translate::planner::parse_table has cognitive complexity 76 (threshold 15). Drivers by points: if/else 32 (72 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a90fede44be363e073637175f748aea8bc80e043c3941b729ace4c4951b65bc"}},{"ruleId":"D2","level":"warning","message":{"text":"MvccLazyCursor::seek (cognitive 75): MvccLazyCursor::seek has cognitive complexity 75 (threshold 15). Drivers by points: if/else 17 (51 pts), match/switch 6 (22 pts), boolean chains 1, loops 1 (nesting depth added 50). 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":"core/mvcc/cursor.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8742b0efd3e634e870e3704dbefb0ae64cebc0892cb2abf8811728c5a7c05ec"}},{"ruleId":"D2","level":"warning","message":{"text":"Pager::checkpoint_inner (cognitive 75): Pager::checkpoint_inner has cognitive complexity 75 (threshold 15). Drivers by points: if/else 25 (65 pts), match/switch 2 (5 pts), boolean chains 4, loops 1 (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":"core/storage/pager.rs"},"region":{"startLine":5066}}}],"partialFingerprints":{"codehealthFindingId/v1":"347b02b62b49ee9d9dacf99e4c3830a2208ca2f86059258e89a1dfb900219641"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_rename_table (cognitive 75): turso_core::vdbe::execute::op_rename_table has cognitive complexity 75 (threshold 15). Drivers by points: if/else 20 (46 pts), loops 11 (20 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":16455}}}],"partialFingerprints":{"codehealthFindingId/v1":"84680ba341025c3e7a32421f2a2f5c902152406db54e3a7976fe798ffe99c792"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::explain::insn_to_row (cognitive 75): turso_core::vdbe::explain::insn_to_row has cognitive complexity 75 (threshold 15). Drivers by points: if/else 39 (57 pts), match/switch 10 (18 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":"core/vdbe/explain.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"51a88945dc5352e0e0e8ca9075b531faba0586201edff7e23235a0ffbd5e5a36"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::try_match_index_method_pattern (cognitive 74): turso_core::translate::optimizer::try_match_index_method_pattern has cognitive complexity 74 (threshold 15). Drivers by points: if/else 31 (57 pts), boolean chains 9, loops 4 (6 pts), match/switch 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e397b61b5962eedd2cc9cbf888ffbe0b46df92f19bad1e5e6ee5b6b9e2a04e85"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::new_rowid_inner (cognitive 74): turso_core::vdbe::execute::new_rowid_inner has cognitive complexity 74 (threshold 15). Drivers by points: if/else 18 (58 pts), match/switch 4 (15 pts), loops 1 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":12629}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62bc01006a5ea4bc145752fe9fbb6df2369501aba6d1649b656e389e897cea2"}},{"ruleId":"D2","level":"warning","message":{"text":"Insert::shadow (cognitive 74): Insert::shadow has cognitive complexity 74 (threshold 15). Drivers by points: if/else 10 (40 pts), loops 7 (23 pts), match/switch 4 (11 pts) (nesting depth added 53). 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":"testing/simulator/model/mod.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b8bb38c57466328914b3cbcd9a1e2c1c2f804085b7a7a3260180bcfa665cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::delete_from_table_or_index (cognitive 73): MvStore::delete_from_table_or_index has cognitive complexity 73 (threshold 15). Drivers by points: if/else 21 (58 pts), loops 4 (10 pts), boolean chains 4, match/switch 1 (nesting depth added 43). 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":"core/mvcc/database/mod.rs"},"region":{"startLine":5647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47c43620d98a4abeda2e50a4944efaef8e5f2ba250b7cc67ca1816b5ff67354"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenLoop::emit (cognitive 73): OpenLoop::emit has cognitive complexity 73 (threshold 15). Drivers by points: if/else 26 (68 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 43). 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":"core/translate/main_loop/open.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a58690294eb4293d4f978da43179fdea7673bd9f8a1911b63617976beb50e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::deserialize_number (cognitive 72): Jsonb::deserialize_number has cognitive complexity 72 (threshold 15). Drivers by points: if/else 26 (47 pts), boolean chains 17, loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"227134a83f0bd85f36ddb9511d2af0615bc7ada58627303ac25fbf0fd917353b"}},{"ruleId":"D2","level":"warning","message":{"text":"CommitStateMachine::step_build_log_record (cognitive 72): CommitStateMachine::step_build_log_record has cognitive complexity 72 (threshold 15). Drivers by points: if/else 30 (49 pts), loops 7 (12 pts), boolean chains 11 (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":"core/mvcc/database/mod.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"b848e0cea4b061d76c28c7562ee21541b9627b1432aaa3af678a6caed84ddcd5"}},{"ruleId":"D2","level":"warning","message":{"text":"Whopper::perform_work (cognitive 72): Whopper::perform_work has cognitive complexity 72 (threshold 15). Drivers by points: if/else 26 (52 pts), match/switch 3 (8 pts), loops 3 (7 pts), boolean chains 5 (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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e536c3d74dc70b3a180bfb4f4c9cfa433548d0c021ef6a5adc4b5213ed6b5f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::jsonb::validate_element (cognitive 70): turso_core::json::jsonb::validate_element has cognitive complexity 70 (threshold 15). Drivers by points: if/else 28 (57 pts), loops 4 (8 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":"core/json/jsonb.rs"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e45bbdc1ecea95f5fa843f80b58324ad42cdeac20ec55bf4b8984efdc2e4a17"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::validate (cognitive 70): turso_core::translate::schema::validate has cognitive complexity 70 (threshold 15). Drivers by points: if/else 15 (42 pts), loops 8 (22 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 44). 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":"core/translate/schema.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe76a10ae03a05a99ef9d0380cc0f311fad49df5dd95f600960e28a1a54357c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::subquery::emit_from_clause_subqueries (cognitive 70): turso_core::translate::subquery::emit_from_clause_subqueries has cognitive complexity 70 (threshold 15). Drivers by points: if/else 16 (55 pts), loops 4 (8 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 46). 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":"core/translate/subquery.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee333d68c188770208f4290fb142356c97f249fbf8fd3edac97b385335748d3"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::_init_nonblock (cognitive 69): Database::_init_nonblock has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (55 pts), match/switch 3 (9 pts), loops 2 (4 pts), boolean chains 1 (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":"core/database.rs"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee2bcb49da0515c7fb4beada5e5c4e13f04e421d560a607ea4ceb2bf0a809630"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::update::emit_update_column_values (cognitive 69): turso_core::translate::emitter::update::emit_update_column_values has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (60 pts), boolean chains 5, match/switch 1 (3 pts), loops 1 (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"995c498b33b3df48a3b5d38d72cab8720436fd9dea396be1c149946fbcf78bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_primary_expression (cognitive 69): Parser::parse_primary_expression has cognitive complexity 69 (threshold 15). Drivers by points: if/else 35 (62 pts), loops 1 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 30). 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":"postgres/parser/parser.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"5273cb4e768bafc06d5fa00e143b199374d30f9f3244593b1ae0584a0eb245c4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::insert::emit_fk_child_insert_checks (cognitive 68): turso_core::translate::insert::emit_fk_child_insert_checks has cognitive complexity 68 (threshold 15). Drivers by points: if/else 23 (55 pts), loops 4 (10 pts), boolean chains 3 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec6a8826affeac3408860e8e356c1e453a13b4f9cafc18dfd500f9f75a0af5e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::pragma::update_pragma (cognitive 68): turso_core::translate::pragma::update_pragma has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (34 pts), match/switch 14 (31 pts), boolean chains 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/pragma.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"3407776525f92d35a2200bdf62e524a5b161070b51360a51276822225d980f53"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_expr (cognitive 68): PostgreSQLTranslator::translate_expr has cognitive complexity 68 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 9 (24 pts), loops 2 (7 pts), boolean chains 1 (nesting depth added 40). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"e580d2b53409472dab74b46798b9cd0b8f45a0c110c7eee3d52f2f3769870161"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sqlite3::sqlite3_table_column_metadata (cognitive 67): turso_sqlite3::sqlite3_table_column_metadata has cognitive complexity 67 (threshold 15). Drivers by points: if/else 19 (41 pts), match/switch 6 (20 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 39). 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":"bindings/c/src/lib.rs"},"region":{"startLine":3614}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a7a22a0c47f402df407d6e3a2ccde2754de4c08df28f5133b02bfb8167a81e"}},{"ruleId":"D2","level":"warning","message":{"text":"Pager::try_spill_dirty_pages (cognitive 67): Pager::try_spill_dirty_pages has cognitive complexity 67 (threshold 15). Drivers by points: if/else 12 (40 pts), loops 5 (16 pts), match/switch 3 (10 pts), boolean chains 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":4225}}}],"partialFingerprints":{"codehealthFindingId/v1":"57be564689ff117c093ceaeed80455206d0f2198be1c262034b0175fb539a2ae"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::insert::bind_insert (cognitive 67): turso_core::translate::insert::bind_insert has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 6 (18 pts), match/switch 3 (10 pts), boolean chains 2 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcf15f3482fe157afad4fbdac6e797d3b68472fe27627dbcecd144c7aba2f42"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoSyncDb.handleIoItem (cognitive 67): TursoSyncDb.handleIoItem has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (57 pts), loops 3 (6 pts), boolean chains 3, match/switch 1 (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/go/driver_sync.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cd095ad62fbc08bd1a7b64d4a4f269c8e165930e090197d5241f0250aa5687"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::apply_expr_column_ref_with_context (cognitive 66): turso_core::translate::alter::apply_expr_column_ref_with_context has cognitive complexity 66 (threshold 15). Drivers by points: if/else 24 (54 pts), boolean chains 7, match/switch 3 (5 pts) (nesting depth added 32). 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":"core/translate/alter.rs"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a43900632642ebca4a1737ab7262dab627f41c0e132785faee2f43dcd5cf5d4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_window_step (cognitive 66): turso_core::vdbe::execute::op_window_step has cognitive complexity 66 (threshold 15). Drivers by points: if/else 32 (65 pts), match/switch 1 (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":"core/vdbe/execute.rs"},"region":{"startLine":8337}}}],"partialFingerprints":{"codehealthFindingId/v1":"381a750fe82374c382eafd8215e39d13cd9309a37c8f0f02b9aacd3714bbd5ab"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_vacuum_into_inner (cognitive 66): turso_core::vdbe::execute::op_vacuum_into_inner has cognitive complexity 66 (threshold 15). Drivers by points: if/else 20 (46 pts), match/switch 5 (15 pts), boolean chains 4, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":19152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e44e7a12c0ae7aa535e9794167f3026671272630a185c6f014a46589757fac"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::datetime::exec_strftime (cognitive 65): turso_core::functions::datetime::exec_strftime has cognitive complexity 65 (threshold 15). Drivers by points: if/else 25 (53 pts), match/switch 3 (5 pts), boolean chains 4, loops 2 (3 pts) (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":"core/functions/datetime.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"913acdfaa242a69bd56f4452f9939517da5c164d78d8495bba27e25f8e445ed4"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_target_list (cognitive 65): PostgreSQLTranslator::translate_target_list has cognitive complexity 65 (threshold 15). Drivers by points: if/else 14 (56 pts), match/switch 2 (8 pts), loops 1 (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"253b9f1967248c9d02e8fcae706ed9df717f2016305d28302141d32c65133fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::validate (cognitive 65): Parser::validate has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (45 pts), loops 11 (16 pts), boolean chains 4 (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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb576468fba6783195582047041b501459df80c2e68db97af19dcaca8d41f540"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::insert_into_page (cognitive 64): BTreeCursor::insert_into_page has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (55 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f87881f466ac354432439a6ad745f2d9d173eab77976b865871423af1a15e1a"}},{"ruleId":"D2","level":"warning","message":{"text":"CloseLoop::emit (cognitive 64): CloseLoop::emit has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (50 pts), loops 4 (7 pts), match/switch 2 (5 pts), boolean chains 2 (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":"core/translate/main_loop/close.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0647a5fa6c75bae331842a6abf8fbe2f245ac04bcdaa2fc14df6e40e95cfba"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::find_select_plan_form (cognitive 64): turso_core::translate::optimizer::find_select_plan_form has cognitive complexity 64 (threshold 15). Drivers by points: if/else 19 (46 pts), loops 4 (12 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd17c44aae07e483705a469806cc991f359c0366121d698e5987e70effc4ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::build_select_plan_dag (cognitive 63): turso_core::incremental::vdbe_maintenance::plan::build_select_plan_dag has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (39 pts), loops 7 (12 pts), boolean chains 6, match/switch 3 (6 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9677835cb68a80637c0b2e5ae47cacb573b96ba5e560394aa28c7e672e6a7e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::condition::translate_in_list (cognitive 62): turso_core::translate::expr::condition::translate_in_list has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (42 pts), loops 5 (16 pts), boolean chains 4 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/condition.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc6aa36fe7c3978b8ed4bb01338f6f3fdc89a2794bd67a5aee8046b98fdc1b8"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::maybe_recover_logical_log (cognitive 61): MvStore::maybe_recover_logical_log has cognitive complexity 61 (threshold 15). Drivers by points: if/else 17 (46 pts), match/switch 3 (9 pts), loops 2 (4 pts), boolean chains 2 (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":"core/mvcc/database/mod.rs"},"region":{"startLine":9609}}}],"partialFingerprints":{"codehealthFindingId/v1":"763c67d791d08e49ead2078b924ab2f4b5094c4e06c2ea6f4472790f398a1c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::validate_one_select_column_refs_after_drop (cognitive 61): turso_core::translate::alter::validate_one_select_column_refs_after_drop has cognitive complexity 61 (threshold 15). Drivers by points: if/else 13 (42 pts), loops 7 (18 pts), match/switch 1 (nesting depth added 40). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":5449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a618f5bdf56a393895886d5c7e58a914cc8be49d4499a9a76e48260643b75f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::main_loop::body::emit_loop_source (cognitive 61): turso_core::translate::main_loop::body::emit_loop_source has cognitive complexity 61 (threshold 15). Drivers by points: if/else 15 (37 pts), loops 7 (18 pts), match/switch 3 (6 pts) (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/body.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"864dbd9351d588acfaf368c1a4456e4c03ea1e7d8bce39f0bf9d7ef4111f0b6b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::resolve_window_and_aggregate_functions (cognitive 61): turso_core::translate::planner::resolve_window_and_aggregate_functions has cognitive complexity 61 (threshold 15). Drivers by points: if/else 23 (55 pts), match/switch 3 (5 pts), boolean chains 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":"core/translate/planner.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cd1ab38718d8a888128a7541a930f21dea62cc711cf3df0e096bfb4dcd92a05"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::array::parse_pg_text_array (cognitive 61): turso_core::vdbe::array::parse_pg_text_array has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 6 (14 pts), match/switch 2 (9 pts), boolean chains 4 (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":"core/vdbe/array.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2b3af79cb2176cdef960fe09134b389a0ff4980c64ab3463ceaeb32c68891d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::decode_raw_mvcc_logical_log_to_file (cognitive 61): turso_sync_engine::database_sync_operations::decode_raw_mvcc_logical_log_to_file has cognitive complexity 61 (threshold 15). Drivers by points: if/else 25 (55 pts), boolean chains 3, loops 2 (3 pts) (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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ff7801a6e5d1ed87c44419e7b5a73b87f83355f506b6dd0baf1ff48013044b"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::serialize_string (cognitive 60): Jsonb::serialize_string has cognitive complexity 60 (threshold 15). Drivers by points: if/else 12 (33 pts), match/switch 6 (20 pts), loops 2 (4 pts), boolean chains 3 (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":"core/json/jsonb.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9522ba3d31d7cee9881b74c0c71b3e3b66a966d6c6ca2cea8bc9328f810e1f93"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::vectors::expr_vector_size (cognitive 60): turso_core::translate::expr::vectors::expr_vector_size has cognitive complexity 60 (threshold 15). Drivers by points: if/else 19 (46 pts), loops 4 (8 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 32). 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":"core/translate/expr/vectors.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f190748947fc2a1ea2671f56c99b3860470a4fe8fcbb0dfa16f0c31143d327"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::resolve_check_expr_type (cognitive 60): turso_core::translate::schema::resolve_check_expr_type has cognitive complexity 60 (threshold 15). Drivers by points: if/else 21 (43 pts), match/switch 4 (7 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 27). 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":"core/translate/schema.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dc508525983ea19804941a073e5237b392dca490de5657992e2f39d81caf05"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::halt (cognitive 60): turso_core::vdbe::execute::halt has cognitive complexity 60 (threshold 15). Drivers by points: if/else 25 (52 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":3593}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7f186c53cfa068df294692911c1fa8f900376c70907e4ae903bb308b67272d"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectPlan::to_tokens (cognitive 59): SelectPlan::to_tokens has cognitive complexity 59 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 4 (11 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":"core/translate/display.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc6564173fbc5d7f5b6a60d2fef935f3a742e93f0bb59337ecdeae68ef26eaf"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::aggregate::emit_group_aggregate_rows (cognitive 59): turso_core::incremental::vdbe_maintenance::aggregate::emit_group_aggregate_rows has cognitive complexity 59 (threshold 15). Drivers by points: if/else 27 (43 pts), loops 9 (11 pts), boolean chains 3, 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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a6a5942418d7a2c601511f8c007b6ef9a9b7d2350e97664cd59c55d1c0a2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"top-level statements (cognitive 58): top-level statements has cognitive complexity 58 (threshold 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":"bindings/dotnet/src/Turso.Platform.Client/tools/OpenApiTitler/Program.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba07e67e7c2b4b35e39ddf02f139b5897d0c5acc57f9aef77743c4958fa4cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::apply_upsert_for_column_rename (cognitive 58): turso_core::translate::alter::apply_upsert_for_column_rename has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (50 pts), loops 3 (8 pts) (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":"core/translate/alter.rs"},"region":{"startLine":3980}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28219612ec82179bb732ec9cf69124fea3aae92d616471ef549b204346dc943"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::upsert::upsert_matches_index (cognitive 58): turso_core::translate::upsert::upsert_matches_index has cognitive complexity 58 (threshold 15). Drivers by points: if/else 13 (42 pts), loops 3 (7 pts), match/switch 2 (5 pts), boolean chains 4 (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":"core/translate/upsert.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0038bd553fc580cfa1c5a0984381b55ed8e5d0cae48168e8c556e630f156c749"}},{"ruleId":"D2","level":"warning","message":{"text":"CommitStateMachine::populate_portable_changes (cognitive 57): CommitStateMachine::populate_portable_changes has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (43 pts), loops 8 (10 pts), match/switch 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1b3efee6a2e5a7b54bbcf84acacb7fe317701e007c475fefdeee850a4f74c7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::optimize_table_access_with_custom_modules (cognitive 57): turso_core::translate::optimizer::optimize_table_access_with_custom_modules has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 5 (13 pts), boolean chains 5 (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":"core/translate/optimizer/mod.rs"},"region":{"startLine":1920}}}],"partialFingerprints":{"codehealthFindingId/v1":"400b8cfd353d9fe8d282a7d52f059f168e01ba876246f670c00af003ad961be2"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_journal_mode_inner (cognitive 57): turso_core::vdbe::execute::op_journal_mode_inner has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (49 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (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":"core/vdbe/execute.rs"},"region":{"startLine":18618}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79152e99385dcb17d3b483e8d9cad404a43b9efd7b63308f1d5cd65c0abd39f"}},{"ruleId":"D2","level":"warning","message":{"text":"page_diff.main (cognitive 57): page_diff.main has cognitive complexity 57 (threshold 15). Drivers by points: if/else 19 (29 pts), loops 5 (14 pts), boolean chains 9, ternaries 3 (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":"scripts/corruption-debug-tools/page_diff.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0726590e5ddd6ff93ec40ac7c0ddabba475dc84e82ca2bdbd75c8ac11a49fb"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::get_prev_record (cognitive 56): BTreeCursor::get_prev_record has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (46 pts), boolean chains 4, loops 2 (4 pts), match/switch 1 (2 pts) (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":"core/storage/btree.rs"},"region":{"startLine":1453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca68a9ed0f8b878bd47f842c1cf6aa5cfc855816c3622242ff5e7057accb5e80"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::count (cognitive 56): BTreeCursor::count has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (40 pts), match/switch 3 (10 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":7495}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ebaf825d90a38f7bce54cfb989e6f88133eb6ec798038ffa17bea09242ec40"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::printf::format_general_inner (cognitive 56): turso_core::functions::printf::format_general_inner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (38 pts), loops 4 (10 pts), boolean chains 8 (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":"core/functions/printf.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"37e841abbe90210e9176ee2e3441943f5d8d5193ba53e8af060ffc40184e4a98"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectPlan::fmt (cognitive 55): SelectPlan::fmt has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (42 pts), match/switch 4 (12 pts), loops 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":"core/translate/display.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c8bbdc59dff57d4caadcf69db41cf728a551185df172ea3f4aee04e09b1b6e"}},{"ruleId":"D2","level":"warning","message":{"text":"CsvVTabModule::create (cognitive 55): CsvVTabModule::create has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (41 pts), loops 4 (9 pts), boolean chains 3, match/switch 1 (2 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":"extensions/csv/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"0950e53a3f1dcd49b2a324e293f2affb0447596cf110afde0e0ef6084e4c8a01"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_macros::atomic_enum::derive_atomic_enum_inner (cognitive 55): turso_macros::atomic_enum::derive_atomic_enum_inner has cognitive complexity 55 (threshold 15). Drivers by points: if/else 28 (45 pts), match/switch 4 (5 pts), boolean chains 4, 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":"macros/src/atomic_enum.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c426ac67e284605a83ec1dfbdbe7babbd4b722a43d34d8f3b1c8c69000fbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::dialect::engine::resolve_builtin_function_name (cognitive 54): turso_core::dialect::engine::resolve_builtin_function_name has cognitive complexity 54 (threshold 15). Drivers by points: if/else 26 (50 pts), boolean chains 3, match/switch 1 (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":"core/dialect/engine.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"740e8ba9a74cad1869f7e8eb81ff0ff210e1402e0fd1de9db71dc1ced2fd655e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::datetime::parse_modifier (cognitive 54): turso_core::functions::datetime::parse_modifier has cognitive complexity 54 (threshold 15). Drivers by points: if/else 22 (43 pts), match/switch 4 (6 pts), boolean chains 5 (nesting depth added 23). 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":"core/functions/datetime.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50674fd20277b838ca2896911484a0ccd9384bfaebaddab677503ea31fc259f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::multi_index::analyze_and_terms_for_multi_index (cognitive 54): turso_core::translate::optimizer::multi_index::analyze_and_terms_for_multi_index has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (44 pts), loops 4 (7 pts), boolean chains 3 (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":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"32bb240baa02d5603e31d281d36ac346d13a0e8cbf4c4227962550626432ad44"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_create_table (cognitive 54): PostgreSQLTranslator::translate_create_table has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (40 pts), match/switch 3 (7 pts), loops 4 (6 pts), boolean chains 1 (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":"postgres/parser/translator.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c277e5d94341dbe617cbaf59066c15cc7d5c91f01ce84a72a46232aebd755c"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedSqliteStatementParser.Parse (cognitive 53): ManagedSqliteStatementParser.Parse has cognitive complexity 53 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/ManagedSqliteStatement.cs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"155f13d25aa182e516c08db1daa23fd89b2b4c4817d6f3fbf7629b4875914c53"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::drive_reparse_building (cognitive 53): Connection::drive_reparse_building has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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":"core/connection.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"a624da617efbd2783ba1f0b9e231b431866f46d85b297922c93162dd2acde5fe"}},{"ruleId":"D2","level":"warning","message":{"text":"FtsCursor::query_start (cognitive 53): FtsCursor::query_start has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 8 (14 pts), match/switch 8 (14 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":"core/index_method/fts/mod.rs"},"region":{"startLine":3216}}}],"partialFingerprints":{"codehealthFindingId/v1":"344d6de9c3e3bc1d3f87e5a4e4059a5aa5df1003b4a3e0a334a0f0aa853e9c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdatePlan::fmt (cognitive 53): UpdatePlan::fmt has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (38 pts), match/switch 4 (12 pts), loops 2 (3 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":"core/translate/display.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"0372c2e7003e6fc78b9b992cfbaf755fe7221f8f8bf11b21cb69e9030e769641"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::numeric::str_to_f64 (cognitive 53): turso_core::numeric::str_to_f64 has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 12 (21 pts), boolean chains 7, match/switch 3 (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":"core/numeric/mod.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22185aed46cc0a54355b5728c933118e0bb498097a75951c4c13353f3912ebd"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::aggregation::emit_ungrouped_aggregation (cognitive 53): turso_core::translate::aggregation::emit_ungrouped_aggregation has cognitive complexity 53 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 7 (15 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":"core/translate/aggregation.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c8bfb85491a2afefc223d5a89edf7537f6184012e51c5a1db10c534dafa0db"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::check_always_true_or_false (cognitive 53): Expr::check_always_true_or_false has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (38 pts), match/switch 5 (11 pts), boolean chains 4 (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":"core/translate/optimizer/mod.rs"},"region":{"startLine":4217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce08cc5b8aa4a2668680acadaccd5aca14552c37476d7a3782763fd619d8f12e"}},{"ruleId":"D2","level":"warning","message":{"text":"docker-entrypoint.sqlancer.main (cognitive 52): docker-entrypoint.sqlancer.main has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (41 pts), error handling 3 (7 pts), boolean chains 2, loops 2 (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":"testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c7c91865e64687c5f7683cdcefa548c8ce89347194e324de27bd7cb6a187f5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::datetime::exec_datetime_general (cognitive 51): turso_core::functions::datetime::exec_datetime_general has cognitive complexity 51 (threshold 15). Drivers by points: if/else 24 (44 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d1a2c355221f22ab365f472e7b31fdf2c1ecfd30e92d26b6309968535fb95b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::datetime::exec_timediff (cognitive 51): turso_core::functions::datetime::exec_timediff has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 5, loops 2 (4 pts), match/switch 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":"core/functions/datetime.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebc9a066530b4f0cdc843f77c610ae7a6924e53e108ea9df4093ba000ffa36d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::trigger_exec::rewrite_trigger_expr_single_for_subprogram (cognitive 51): turso_core::translate::trigger_exec::rewrite_trigger_expr_single_for_subprogram has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (50 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":"core/translate/trigger_exec.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e340d09fa6c84f7856d8ac3dc7857dc40514cfead5b04580aaa1f799ee108c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_auto_commit (cognitive 51): turso_core::vdbe::execute::op_auto_commit has cognitive complexity 51 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 5 (9 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":5220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b356541e2b913f17527b0ce0c4cb3156fd392e4f8a0d9d1993e7dd3a0ff27dbd"}},{"ruleId":"D2","level":"warning","message":{"text":"CommitStateMachine::check_version_conflicts (cognitive 50): CommitStateMachine::check_version_conflicts has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (34 pts), match/switch 5 (15 pts), loops 1 (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":"core/mvcc/database/mod.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aaec9dbd3f822d3b5512d60167c21a171f01c5afc66d4cd0c80cea4f0d66176"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingLogicalLogReader::parse_streaming_payload (cognitive 50): StreamingLogicalLogReader::parse_streaming_payload has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (33 pts), match/switch 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f41ca29780bfdfc90a38843869e00ad7210c77673055b4acbda22d7b35e1b11"}},{"ruleId":"D2","level":"warning","message":{"text":"EmitWindow::emit_window_step (cognitive 50): EmitWindow::emit_window_step has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"97851309d73a9538260bfa6d2e7d5e695db27b02d481a92e92bbfaf6ca1cda78"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::exec_unhex (cognitive 50): Value::exec_unhex has cognitive complexity 50 (threshold 15). Drivers by points: if/else 6 (27 pts), match/switch 5 (13 pts), loops 2 (9 pts), boolean chains 1 (nesting depth added 36). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/value.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd317ec3d04b059fd59e23dc119aa3cc5cbaf1fe567eeb4867b8a3cf18fec5be"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::choose_best_in_seek_candidate (cognitive 50): turso_core::translate::optimizer::access_method::choose_best_in_seek_candidate has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (39 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fc89b248db6f9407953c542faa851593e4d9d44cd0a78631ba622397fc544b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::run_tests (cognitive 50): sqltest::run_tests has cognitive complexity 50 (threshold 15). Drivers by points: if/else 23 (36 pts), match/switch 7 (9 pts), loops 3 (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":"testing/sqltest/src/main.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0dc3126c452f66f45ebe8be15ef41af272b3620fc3d9830b8e9e3bdacf64ee1"}},{"ruleId":"D2","level":"warning","message":{"text":"ImportFile::import_csv (cognitive 49): ImportFile::import_csv has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 9 (23 pts), if/else 11 (22 pts), loops 3 (4 pts) (nesting depth added 26). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"cli/commands/import.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc174522356c91e400b4eddfedbec0c56b1b741c78132605297db8ac6dcc447"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::do_open_async_internal (cognitive 49): Database::do_open_async_internal has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (38 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 2 (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":"core/database.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"366e2a54ee66227ad5b11e9b0927737d69c37abcad5067b8e5c9431b88027d37"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::validate_planned_node (cognitive 49): turso_core::incremental::vdbe_maintenance::plan::validate_planned_node has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 6 (13 pts), boolean chains 7, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88ee1232dff62d35a6747ca63741d16209077ff97f5c5b4da4e608495c3e34d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::parse_join (cognitive 49): turso_core::translate::planner::parse_join has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 6 (19 pts), boolean chains 2, match/switch 1 (2 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":"core/translate/planner.rs"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4d31ba445b71a0cdd9f7bf4bbebba704b728939b50af56110ce3b6554beb1c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::result_row::emit_columns_to_destination (cognitive 49): turso_core::translate::result_row::emit_columns_to_destination has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 2 (7 pts), match/switch 2 (3 pts), boolean chains 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":"core/translate/result_row.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e26b871f6ec82de7f8b49dad981571adcf07efdb7967b41b68f9071f684f966"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::trigger_exec::rewrite_trigger_expr_single_for_when_clause (cognitive 49): turso_core::translate::trigger_exec::rewrite_trigger_expr_single_for_when_clause has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (47 pts), boolean chains 1, match/switch 1 (nesting depth added 32). 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":"core/translate/trigger_exec.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed0317901f19a1eb572d8e92b078b348586bab2d94d09c2ea5e6174322c59f0a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::apply_affinity_char_slow (cognitive 49): turso_core::vdbe::execute::apply_affinity_char_slow has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 7 (23 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":18315}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba08973102343436e26c3beabea1ec587670be02b8f4216e07a199412523d30"}},{"ruleId":"D2","level":"warning","message":{"text":"SortedChunk::next (cognitive 48): SortedChunk::next has cognitive complexity 48 (threshold 15). Drivers by points: if/else 9 (34 pts), match/switch 2 (7 pts), loops 2 (5 pts), boolean chains 2 (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":"core/vdbe/sorter.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3ecec7ec1dc663ca45d863346b533d8ebbc88aea56f53ed3b2b5da553d3d40"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::btree::free_cell_range (cognitive 48): turso_core::storage::btree::free_cell_range has cognitive complexity 48 (threshold 15). Drivers by points: if/else 26 (42 pts), match/switch 3 (5 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":"core/storage/btree.rs"},"region":{"startLine":9797}}}],"partialFingerprints":{"codehealthFindingId/v1":"2182454441c628b360caadd6d351ee75f71b94f15145502d61b85e79ac7f2ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::aggregation::translate_aggregation_step (cognitive 48): turso_core::translate::aggregation::translate_aggregation_step has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (43 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/aggregation.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"0007fc5e3017f7963a625072d574b4399befd772f16e2d71e061ed70b72b5791"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::group_by::group_by_process_single_group (cognitive 48): turso_core::translate::group_by::group_by_process_single_group has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 7 (14 pts), match/switch 3 (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":"core/translate/group_by.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ab40b424fb2023948596fdbee77de908560bd865219fa526c8ec49461fc78d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_window_value (cognitive 48): turso_core::vdbe::execute::op_window_value has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (42 pts), match/switch 4 (6 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8621}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5ec05cf8bd74b8ba06cb2691179b0446f1ab028ace2f6142448966bf0a89a8"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::catalog::pg_get_constraintdef (cognitive 48): turso_pg::catalog::pg_get_constraintdef has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 4 (7 pts), boolean chains 2, match/switch 1 (2 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":"postgres/frontend/catalog.rs"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"0854f8718a69739ca049be67967081621ba23e56f5bdeeafc7239d73771c6015"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectStmt::unordered_limit_reason (cognitive 48): SelectStmt::unordered_limit_reason has cognitive complexity 48 (threshold 15). Drivers by points: if/else 19 (38 pts), loops 7 (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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"512cd75ebfafba4d77c5c2d329210cdfb7a20a4c698c1a0c7f8e19fafc4deb4c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::printf::fp_decode (cognitive 47): turso_core::functions::printf::fp_decode has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 9 (17 pts), boolean chains 5 (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":"core/functions/printf.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"03093da836ac4bdc91c73e3bba959fbe96ef316c6bdc5283b737932ad3cb7464"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::apply_trigger_cmd_for_column_rename (cognitive 47): turso_core::translate::alter::apply_trigger_cmd_for_column_rename has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (34 pts), loops 4 (12 pts), match/switch 1 (nesting depth added 30). 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":"core/translate/alter.rs"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f847d50351ee92aedd57de62bfd37a498e9e097f54d72a68c0e92f45628f74"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::validate_trigger_columns_after_drop (cognitive 47): turso_core::translate::alter::validate_trigger_columns_after_drop has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 2 (4 pts), boolean chains 2, match/switch 1 (2 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":"core/translate/alter.rs"},"region":{"startLine":4869}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3c659e239e65cac1bb9d89bbba13a686062982f14deb38cb43ad9b61b65272"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::rename_column_view::rewrite_expr_column_ref_view (cognitive 47): turso_core::util::rename_column_view::rewrite_expr_column_ref_view has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (40 pts), loops 3 (6 pts), match/switch 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":"core/util.rs"},"region":{"startLine":3743}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3844399352d1ca4a1a93dfdcef7b48ccf6f19a9ddc0ab1be585313a84014d2"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::meta_command (cognitive 47): Session::meta_command has cognitive complexity 47 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 7 (15 pts), loops 4 (12 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":"postgres/regress/main.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fd15d25226693abe3ec336c870d8f5e3cbf0240b87be01171e74eb0871a451"}},{"ruleId":"D2","level":"warning","message":{"text":"Update::shadow (cognitive 47): Update::shadow has cognitive complexity 47 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 7 (12 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":"testing/simulator/model/mod.rs"},"region":{"startLine":1296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7eb314db660512a0f06c886f73eeb4d119ccbc796b9ea3061ee38afb770edcb"}},{"ruleId":"D2","level":"warning","message":{"text":"track_rowid.main (cognitive 47): track_rowid.main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), ternaries 5 (12 pts), loops 5 (7 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":"scripts/corruption-debug-tools/track_rowid.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d41a4a0f908bf440baac23f80e6ae20df7bf6fd491d36b56316eddfa4b1af3e0"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStateMachine::collect_table_row_versions (cognitive 46): CheckpointStateMachine::collect_table_row_versions has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 2 (6 pts), boolean chains 3, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a051c2ebdf0b596e6abc4754ce884d945995a73491c71e9dbd9bda37eb4b72"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::index::translate_create_index (cognitive 46): turso_core::translate::index::translate_create_index has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (38 pts), boolean chains 6, loops 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":"core/translate/index.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b83152a6c536222f07cd0611bc824ed1c3abdf439c014ce3699b068045f8293"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::order::index_columns_order_consumed (cognitive 46): turso_core::translate::optimizer::order::index_columns_order_consumed has cognitive complexity 46 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/order.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d0d834cc729b8e704d8ace4240fb0936596dc9feaba18185b3d9559eaffdd3"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::window::emit_window_op (cognitive 46): turso_core::translate::window::emit_window_op has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (34 pts), match/switch 4 (7 pts), boolean chains 3, loops 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":"core/translate/window.rs"},"region":{"startLine":2859}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c5f2d378dd71011d704a7abd3d7cc4893d9ba4095846fe6eb4edf14ecdf982"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_create_table_args (cognitive 46): Parser::parse_create_table_args has cognitive complexity 46 (threshold 15). Drivers by points: loops 5 (17 pts), if/else 5 (16 pts), match/switch 5 (12 pts), boolean chains 1 (nesting depth added 30). 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":3672}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a78390c7bb9b9eb4c4f0c9361ec1a4a750d4cc58935accab94a114187cf75e"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiprocessWhopper::perform_work (cognitive 46): MultiprocessWhopper::perform_work has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 5, loops 3 (5 pts), match/switch 3 (4 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":"testing/concurrent-simulator/multiprocess.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd788e3b089fec454360f596c39aff82db6a47654578dd4115cfd69a978f39d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_whopper::worker::execute_sql_inner (cognitive 46): turso_whopper::worker::execute_sql_inner has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (36 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 26). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5732b370d4de9cd4d5d3503cd34108bb1dbb76133fc3f9d619784afa302fbe11"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorSparseInvertedIndexMethodCursor::insert (cognitive 45): VectorSparseInvertedIndexMethodCursor::insert has cognitive complexity 45 (threshold 15). Drivers by points: if/else 14 (39 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"712847c43ab8ad0601c296ecbed05ec7245eae84beda8a7e2f03bf9fd3e16d88"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::populate_indices (cognitive 45): Schema::populate_indices has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 4 (8 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":3651}}}],"partialFingerprints":{"codehealthFindingId/v1":"efbff8dcfe380436ecf89b9d25c27c77a056c35a4a0546d11c9a5497702fb888"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::plan::expand_star (cognitive 45): turso_core::translate::plan::expand_star has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 5 (9 pts), boolean chains 2 (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":"core/translate/plan.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"878d4be4212b2f0c0d0fce832dea624cc31b3ef33b265a4170172700d718532f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::translate_drop_table (cognitive 45): turso_core::translate::schema::translate_drop_table has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (32 pts), boolean chains 5, loops 2 (5 pts), match/switch 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":"core/translate/schema.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9b20babcb831e6dcad77e9d7e2ece61e1ef16354ee62e8f9ff8e0a8e34d66a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::affinity::try_for_float (cognitive 45): turso_core::vdbe::affinity::try_for_float has cognitive complexity 45 (threshold 15). Drivers by points: if/else 20 (28 pts), boolean chains 10, loops 5 (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":"core/vdbe/affinity.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78de03ec434e077bb84f2cbf2ead7fd89e5dd61b1a277e083f761068ec3346a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::error::parse_error_sqlstate (cognitive 45): turso_pg::error::parse_error_sqlstate has cognitive complexity 45 (threshold 15). Drivers by points: if/else 25, boolean chains 20. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/error.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf5b84f782001ddb862889dbdd4a59e4af51e4fd488e0b54d89cc9fb4c28930"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::wal_pull_to_file_legacy (cognitive 45): turso_sync_engine::database_sync_operations::wal_pull_to_file_legacy has cognitive complexity 45 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 6 (16 pts), match/switch 1 (2 pts), boolean chains 1 (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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"e836c1388c7ba1c4e2d5e7ec9e53dd9a92e2b3b18ba396ab3080aa0844f59db8"}},{"ruleId":"D2","level":"warning","message":{"text":"VectorSparseInvertedIndexMethodCursor::delete (cognitive 44): VectorSparseInvertedIndexMethodCursor::delete has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (35 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"51575282b9e9ecf88f95a678d333db58a56ccc85a88f9e659b8a64be6c42f968"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingLogicalLogReader::parse_next_portable_changes_frame (cognitive 44): StreamingLogicalLogReader::parse_next_portable_changes_frame has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (27 pts), match/switch 8 (14 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e74dceeb7ffcbe5a5cf35d3c05298271629cfe11b2fdd3f98afddbc73a88303"}},{"ruleId":"D2","level":"warning","message":{"text":"turso-sql-split.nextToken (cognitive 44): turso-sql-split.nextToken has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (13 pts), boolean chains 8, ternaries 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/turso-sql-split.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa33efb54c86bd146e12897b9fa475e5a9688918f1de8d1b92b30b58ce21d3ec"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::rollback_savepoint_changes (cognitive 43): MvStore::rollback_savepoint_changes has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 6 (11 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":"core/mvcc/database/mod.rs"},"region":{"startLine":7508}}}],"partialFingerprints":{"codehealthFindingId/v1":"04aa1fada7061e860c0f4c71dfd71d50da3337754b6451252cc01874d07ffc0e"}},{"ruleId":"D2","level":"warning","message":{"text":"Pager::allocate_page (cognitive 43): Pager::allocate_page has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (38 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":5836}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe95929fe0dc3f04c218c350883bcbc4d363518e67a9e76cd788a4d23a076ec"}},{"ruleId":"D2","level":"warning","message":{"text":"MappedSharedWalCoordination::register_reader (cognitive 43): MappedSharedWalCoordination::register_reader has cognitive complexity 43 (threshold 15). Drivers by points: if/else 7 (26 pts), match/switch 2 (10 pts), loops 3 (6 pts), boolean chains 1 (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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcd6a646ec0f3bd2a51393c214a0aff84ad8bb6d277120677096d06f1f19ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_fuzzy::phonetic::phonetic_hash (cognitive 43): limbo_fuzzy::phonetic::phonetic_hash has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (31 pts), boolean chains 9, match/switch 1 (2 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/fuzzy/src/phonetic.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7013104e16868226d6c329bd57f8d59222aba991a6681706d8e649aed5964197"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_lazy_storage::read_page (cognitive 43): turso_sync_engine::database_sync_lazy_storage::read_page has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 4 (14 pts), loops 4 (10 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":"sync/engine/src/database_sync_lazy_storage.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e65adaadea19474eadba516313fd173b6c28aef02c48203a78b4146b3efd66"}},{"ruleId":"D2","level":"warning","message":{"text":"page_history.main (cognitive 43): page_history.main has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (29 pts), ternaries 6 (9 pts), boolean chains 4, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/page_history.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"224e0de68e9e91cca5d4bfa0b628dcbdae13898abf726f3839c265a3b57004ae"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::get_next_record (cognitive 42): BTreeCursor::get_next_record has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (29 pts), match/switch 3 (9 pts), boolean chains 3, 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":"core/storage/btree.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca67af5dd6f4b2ac5783683eda5ca5f3cc7e4d8dd7a9a41858a962800a8791e0"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::load_spilled_partition (cognitive 42): HashTable::load_spilled_partition has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 6 (15 pts), boolean chains 1, 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":"core/vdbe/hash_table.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d79d0b25bc3091d1c852425ef7cb9828705eb77bc1979fa357df6af22068a65"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::select::validate_expr_correct_column_counts (cognitive 42): turso_core::translate::select::validate_expr_correct_column_counts has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 9 (14 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":"core/translate/select.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae1353bf8194c97ac6a2f5d9cc4cecf9c9bc18928c53a0d4907b2636d0630f6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_column_range_fetch_other (cognitive 42): turso_core::vdbe::execute::op_column_range_fetch_other has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 6 (18 pts), match/switch 2 (3 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":"core/vdbe/execute.rs"},"region":{"startLine":2352}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b15739976146b9b72c65b1de98f8b1eb7780c680445491807a33ef42e39d46"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::finalize_agg_payload (cognitive 42): turso_core::vdbe::execute::finalize_agg_payload has cognitive complexity 42 (threshold 15). Drivers by points: if/else 20 (32 pts), match/switch 4 (7 pts), boolean chains 3 (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":"core/vdbe/execute.rs"},"region":{"startLine":8098}}}],"partialFingerprints":{"codehealthFindingId/v1":"505b191f4284394ed9c98af49894592b5c226a52172cd0e44a2eca8b81377097"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::functions::pg_to_char_numeric (cognitive 42): turso_pg::functions::pg_to_char_numeric has cognitive complexity 42 (threshold 15). Drivers by points: if/else 28 (37 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/functions.rs"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cddc127d04e60be0c1703b014682733fdf7430728e4ddae551c7cce6dc7230"}},{"ruleId":"D2","level":"warning","message":{"text":"cursorDecoder.feed (cognitive 42): cursorDecoder.feed has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 8, loops 2 (5 pts), match/switch 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":"serverless/go/session.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cafcf54eb73bf0e4c1026982bbad7fc6442e195903f0f70e4dc7543a6db5670"}},{"ruleId":"D2","level":"warning","message":{"text":"run.process (cognitive 42): run.process has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 3 (7 pts), error handling 3 (6 pts), ternaries 1 (2 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":"bindings/javascript/sync/packages/common/run.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccf197ec46dab9d6e4458e47144beb26de1bda33d4ed67b0d6c35de147796c8"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::join::emit_join_phase (cognitive 41): turso_core::incremental::vdbe_maintenance::join::emit_join_phase has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 10 (13 pts), match/switch 5 (12 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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8b47c8c6c36158f532c672863cf1855ceb5d696df6d02c37a7c96d889190a3"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::jsonb::validate_float_payload (cognitive 41): turso_core::json::jsonb::validate_float_payload has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 5, 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":"core/json/jsonb.rs"},"region":{"startLine":4005}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdb0e1e4794adabc4b3e2a8a5754b8c6dabad1432a7deb71fec409d1462b2e2"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::find_table_access_plan (cognitive 41): turso_core::translate::optimizer::find_table_access_plan has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 4 (8 pts), boolean chains 4, 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9bf50d4d0427dbdc2e474eec6f2d65a6b0bd3dba43401e3b64d64de975b2e6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::join::compute_indexed_seek_benefits (cognitive 41): turso_core::translate::optimizer::join::compute_indexed_seek_benefits has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 5 (9 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/join.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba11b16b6f755b1a1858a8feae1a6df0383690bd7f5c31c5fce464ea0de90d6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_integrity_check (cognitive 41): turso_core::vdbe::execute::op_integrity_check has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 2 (5 pts), match/switch 3 (5 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":"core/vdbe/execute.rs"},"region":{"startLine":16192}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6515295c09283769909f0fca4f61946d1caba45ecd80aee45994bf1e989a7d"}},{"ruleId":"D2","level":"warning","message":{"text":"Insert::fmt (cognitive 41): Insert::fmt has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 6 (15 pts), 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":"sql_generation/model/query/insert.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f0fecf58873567e899ddf21bc6b1f0bcfdaa9f9fda19f7234d8e7dc9076ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::runner::run_single (cognitive 41): sqltest::runner::run_single has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 6 (11 pts), loops 3, 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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c837590d675a2837d35a4ff629e758a9ce7a1688e95533d3d1c841939c41da"}},{"ruleId":"D2","level":"warning","message":{"text":"lib_sync._process_http_item (cognitive 41): lib_sync._process_http_item has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 9 (16 pts), loops 3 (4 pts), boolean chains 2, ternaries 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":"bindings/python/turso/lib_sync.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"80274f01f082ea8db6af268806276c44101b16431278a0fffb7a473c86501de3"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoSession.BatchAsync (cognitive 40): TursoSession.BatchAsync has cognitive complexity 40 (threshold 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":"bindings/dotnet/src/Turso.Serverless.Client/TursoSession.cs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"044faef4c0ba74e24e8ca5a01a9c7cf900456b1b4c3023cabc83131145d486b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::attach_database_with_config (cognitive 40): Connection::attach_database_with_config has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 2 (6 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":"core/attach.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c33c6469ac38bfba531db5ec31d1f2a3431f63076d8fb7ce62e554def920a86"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::choose_best_btree_candidate (cognitive 40): turso_core::translate::optimizer::access_method::choose_best_btree_candidate has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 7, loops 3 (6 pts), match/switch 2 (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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0810ee07fbe64596d3c9a8878031975c5543d6714d7bf60cf6548eb506c192"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::find_best_index_for_constraint (cognitive 40): turso_core::translate::optimizer::constraints::find_best_index_for_constraint has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 6 (8 pts), boolean chains 3, loops 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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db90f9d340c4bfcb2ee16bef58c3cb8a5c5a21ed4f547b92cd2ab11ee748b19"}},{"ruleId":"D2","level":"warning","message":{"text":"CliDatabaseInstance::run_sql (cognitive 40): CliDatabaseInstance::run_sql has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c42c85e52bce52083544b13ff34ea98b65759a64c7426c99fc43a233ff6921"}},{"ruleId":"D2","level":"warning","message":{"text":"tursoDbRows.Next (cognitive 40): tursoDbRows.Next has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (29 pts), match/switch 2 (6 pts), loops 2 (4 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":"bindings/go/driver_db.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"74453cf3ac7188c31a9e5b4407da581d9060024e10e82008a52f0fb0324b62e6"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::balance (cognitive 39): BTreeCursor::balance has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"694c339cf1dfd9d0dd4bf8cc3eb9aa99dda49a3f41110d00800603215350d234"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_open_write (cognitive 39): turso_core::vdbe::execute::op_open_write has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (27 pts), match/switch 6 (11 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":"core/vdbe/execute.rs"},"region":{"startLine":13125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c481c021df8628faf7fea13c3b3b17744fd5fc5dc58ad41155607149b8ffa3dc"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_regress::split_meta_args (cognitive 39): turso_pg_regress::split_meta_args has cognitive complexity 39 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 4 (12 pts), match/switch 2 (9 pts), boolean chains 5 (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":"postgres/regress/main.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce23bd04dcb69aabc6f78179c5f2dcbe3182c4685a2bba8e1f4ba2e06d5e74e"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::run_simulator (cognitive 39): limbo_sim::run_simulator has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (32 pts), loops 1 (3 pts), match/switch 2 (3 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":"testing/simulator/main.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde8a3f35e2c37659851418059a8bd5dd40d531cdbe2b1284336fe03710194bc"}},{"ruleId":"D2","level":"warning","message":{"text":"page_info.main (cognitive 39): page_info.main has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (33 pts), loops 2 (4 pts), boolean chains 1, ternaries 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":"scripts/corruption-debug-tools/page_info.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a161936122bf47e9bdf290e45cb17bbeb18a39c69f050b85d0e3ac83caa22f"}},{"ruleId":"D2","level":"warning","message":{"text":"IoWorker::process_http (cognitive 38): IoWorker::process_http has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (27 pts), match/switch 5 (7 pts), loops 2 (3 pts), boolean chains 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":"bindings/rust/src/sync.rs"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee25a253779df59f1d186b1e53a169997e557c9ca95baa3d29705ab7e5c32d3"}},{"ruleId":"D2","level":"warning","message":{"text":"SeqCompactDriver::step (cognitive 38): SeqCompactDriver::step has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (25 pts), match/switch 5 (12 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a82fdcf4d63c344249756f6da24ceecd55618f2833a7d7128eb614e22926c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement::reset_internal (cognitive 38): Statement::reset_internal has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 1 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 19). Of this number, 37 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4a2d6dd9f732f8d7dac8b95528c7400843063def7cc55e01dccf00ce8bd5d6"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::normal_step::dispatch_loop (cognitive 38): Program::normal_step::dispatch_loop has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 4 (12 pts), loops 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":2635}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b313463e419cf785f0c1804ecc8715a8b91f16c7743107af336ff3b38be612"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::join::emit_inner_join (cognitive 38): turso_core::incremental::vdbe_maintenance::join::emit_inner_join has cognitive complexity 38 (threshold 15). Drivers by points: loops 7 (17 pts), match/switch 4 (11 pts), if/else 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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4870a9693e33952961cb7c87fdb904d4878b5d4aa71cc906e10f72558643b3ad"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::check_column_ref_valid (cognitive 38): turso_core::translate::alter::check_column_ref_valid has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (34 pts), boolean chains 3, match/switch 1 (nesting depth added 21). 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":"core/translate/alter.rs"},"region":{"startLine":5896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e15a32beda5d3eb99443dd9ab487d0b0ca5e7cb4dbd481361e57a10e1148a99"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::select::emit_query (cognitive 38): turso_core::translate::emitter::select::emit_query has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 6, loops 2 (3 pts) (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":"core/translate/emitter/select.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"46543665d9ef1947e865f2e1d9775943974901f191746293706992b7b61762b1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::pragma::emit_columns_for_table_info (cognitive 38): turso_core::translate::pragma::emit_columns_for_table_info has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 3 (8 pts), boolean chains 4, loops 2 (4 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":"core/translate/pragma.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0563deef734a54d284902fd2aca0b679677be93e092c00e3b62cc47d6a0c96f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::select::resolve_compound_order_by_expr (cognitive 38): turso_core::translate::select::resolve_compound_order_by_expr has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 3 (7 pts), boolean chains 1, match/switch 1 (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":"core/translate/select.rs"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8efbd2927aed4173275e63200bbcf3631e638addad28b0cd3cc413ca1d9b711"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_program (cognitive 38): turso_core::vdbe::execute::op_program has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (11 pts), loops 3 (7 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":"core/vdbe/execute.rs"},"region":{"startLine":5940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ccab3f69408292f00a92d44eca9ca7729509a91850b5d00f67d7cc7810ff02c"}},{"ruleId":"D2","level":"warning","message":{"text":"Generated::column (cognitive 38): Generated::column has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 4 (15 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":"postgres/dump-fuzzer/src/summary.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"592283c7521e9471986838010318122480967f5689ffc5c5e7399bfa61935605"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_parser::translator::try_extract_copy_from (cognitive 38): turso_pg_parser::translator::try_extract_copy_from has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 4 (12 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":8491}}}],"partialFingerprints":{"codehealthFindingId/v1":"54be5454dcde46251fc0fa533ef8bd0704afa4bea0f0de86fe74d9024f49d204"}},{"ruleId":"D2","level":"warning","message":{"text":"Session::execute_cursor_stmt (cognitive 38): Session::execute_cursor_stmt has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 4 (13 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/rust/session.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f976a29fe5b1ff4c94c6bc726ca3924c8e0bd6afa906b49442a7be38a39ad68"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractionPlan::remove_properties (cognitive 38): InteractionPlan::remove_properties has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (27 pts), boolean chains 5, loops 3 (4 pts), match/switch 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":"testing/simulator/shrink/plan.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac95fac4d3f0776929e5fcdda9bad8f98edc7847da455abec9b8e1a03178b23"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_test_or_snapshot (cognitive 38): Parser::parse_test_or_snapshot has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 2 (3 pts), match/switch 2 (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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"acba00299be05e7c7755eb05fb85f8e7ddef8391fff9404177c920a24206a952"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.batch (cognitive 38): Session.batch has cognitive complexity 38 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 8, ternaries 3 (5 pts), loops 2 (3 pts), error handling 2 (nesting depth added 6). Of this number, 31 points are the body\u0027s own statements and 7 belong to 5 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/javascript/src/session.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba85d3fcdfb0673188253d6f7f9089129e8b84e1e1cbadd0f152377d64a46c8e"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStateMachine::publish_checkpointed_schema_roots (cognitive 37): CheckpointStateMachine::publish_checkpointed_schema_roots has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (31 pts), loops 5, boolean chains 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7e4b1945ac972381d2da8b6b24206f65630cc3920b79d81964b165953d255b"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::indexbtree_seek_impl (cognitive 37): BTreeCursor::indexbtree_seek_impl has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (29 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 16). Of this number, 36 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc60a097f84e6afae54d2d2603f05e54eb8d349b8c78a44bcbbed54f1e16006"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::update::emit_program_for_update (cognitive 37): turso_core::translate::emitter::update::emit_program_for_update has cognitive complexity 37 (threshold 15). Drivers by points: if/else 24 (30 pts), loops 3 (4 pts), match/switch 2 (3 pts) (nesting depth added 8). 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":"core/translate/emitter/update.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"effa9ca06d44a8207410d5aaec7a6e33b00c11bdbafec07e14167c09bdaa3002"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::main_loop::close::emit_table_read_advance (cognitive 37): turso_core::translate::main_loop::close::emit_table_read_advance has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (31 pts), match/switch 3 (5 pts), boolean chains 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":"core/translate/main_loop/close.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b15bbb3f4924fdba724680b549506cd4bb2baa7af4c5c5deef394b938b7c79"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::array::exec_array_to_string (cognitive 37): turso_core::vdbe::array::exec_array_to_string has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 4 (8 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/array.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd018a488e39ff87ea0139237a0742c76081e843d241d93351afd910fbe115b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_dump_fuzzer::main (cognitive 37): turso_pg_dump_fuzzer::main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 6 (9 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":"postgres/dump-fuzzer/src/main.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d63e330ca19ee64a4d418fb2b8f56a68e393acca26fa2ab921a3cf50a095f13"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::to_tokens (cognitive 37): Expr::to_tokens has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (34 pts), loops 1 (2 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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a430688b5a82da6294f0181b9d9a7f6a4d80f1ab49a4be94c42305a4d6e8806"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_named_column_constraints (cognitive 37): Parser::parse_named_column_constraints has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (22 pts), match/switch 5 (13 pts), boolean chains 1, loops 1 (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":"sqlite/parser/src/parser.rs"},"region":{"startLine":4235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99f4e6c275aa12e432644cbc94b00524d14d535c6ad79e1b43b5789466c8e40"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectStmt::fmt (cognitive 37): SelectStmt::fmt has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (29 pts), 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a3e7b6b9a0f80fa90f64049144e18933c91c6c0586447df0c94d62a04bd506"}},{"ruleId":"D2","level":"warning","message":{"text":"diff_to_targeted_coverage.squash (cognitive 37): diff_to_targeted_coverage.squash has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (24 pts), ternaries 3 (10 pts), boolean chains 2, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/antithesis/diff_to_targeted_coverage.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"39472a64f0b8af9a79339007d1f73b9968ff053bd6f3e6a7b509e10f224a671a"}},{"ruleId":"D2","level":"warning","message":{"text":"Database.batch (cognitive 37): Database.batch has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (19 pts), ternaries 4 (9 pts), error handling 2 (4 pts), loops 2 (3 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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"950669d88bfce10de7e4a35009d1a756da58b479e5a6b1945b2695f9013a0ee0"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sqlite3::sqlite3_open_v2 (cognitive 36): turso_sqlite3::sqlite3_open_v2 has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 7 (12 pts), boolean chains 8 (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":"bindings/c/src/lib.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a38efb003b46dfddd61308453aa8efc204034dbe412cadb298ebf077f14915"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStateMachine::maybe_get_checkpointable_versions (cognitive 36): CheckpointStateMachine::maybe_get_checkpointable_versions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (29 pts), boolean chains 6, 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd9e0a77ddf269dfa17a588dbdb24cd96f3e062bea589349d121f963d18d780"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::make_from_btree_internal (cognitive 36): Schema::make_from_btree_internal has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (27 pts), match/switch 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":"core/schema.rs"},"region":{"startLine":3351}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce35925eb1ab5c77d2e06bad7d66ac39d22ca719de8ce9a35f2f7b7ca38d543"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::tablebtree_leaf_search::leaf_search (cognitive 36): BTreeCursor::tablebtree_leaf_search::leaf_search has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 3 (7 pts), boolean chains 4, 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":"core/storage/btree.rs"},"region":{"startLine":2691}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5428cb7423740c9b8e30662ae8441ae4e9900a774631e305480ff6abe3320b4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::set_op::emit_deduplicating_set_op (cognitive 36): turso_core::incremental::vdbe_maintenance::set_op::emit_deduplicating_set_op has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 8 (16 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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"b302aaa3e1cf0e8137ae0c2c13cbe7f403236fdd7e71bb9546476bb6ae563cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::translate_statement (cognitive 36): turso_core::translate::translate_statement has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (26 pts), boolean chains 7, match/switch 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ceaaad05e025d13b376b70421a5fc4eda411e564e7520c1cf58858d7fc7d3f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::trigger_exec::execute_trigger_commands (cognitive 36): turso_core::translate::trigger_exec::execute_trigger_commands has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 5 (7 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":"core/translate/trigger_exec.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"365746d9519687b86c83c5a1a2ccd2dada12efbf47ba10f85f43a6db60c12b9d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_delete (cognitive 36): turso_core::vdbe::execute::op_delete has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (33 pts), match/switch 1 (2 pts), 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":"core/vdbe/execute.rs"},"region":{"startLine":12153}}}],"partialFingerprints":{"codehealthFindingId/v1":"503cc9512f52106ec2ef20f76391d0893d118c729deb47190c0396eab5c14fa0"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_parser::translator::similar_to_regex (cognitive 36): turso_pg_parser::translator::similar_to_regex has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (23 pts), match/switch 4 (10 pts), boolean chains 2, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":8899}}}],"partialFingerprints":{"codehealthFindingId/v1":"a769a3705022a2ccbcd289e77fa7a011ffa9c5443e18698b9c2ab84232161a85"}},{"ruleId":"D2","level":"warning","message":{"text":"ElleHistoryRecorder::finish_op (cognitive 36): ElleHistoryRecorder::finish_op has cognitive complexity 36 (threshold 15). Drivers by points: if/else 17 (35 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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98f8f36f12e50b0a66daa5a3a3d1e41c70fcf81a34711b32f19e894020e5396"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectStmt::non_unique_order_by_reason (cognitive 36): SelectStmt::non_unique_order_by_reason has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 5 (7 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"965c32a1a54696900a96550f3a7666a47c9094bbeeb0ccf5a8e2f333743ca0d8"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::begin_exclusive_tx_with_checkpoint_read_guard (cognitive 35): MvStore::begin_exclusive_tx_with_checkpoint_read_guard has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 2, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":6453}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1584b4ffb0465276b4fbfabacfa0bbaabb74707ce41b73129ca0df4705f4d0c"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingLogicalLogReader::parse_next_transaction (cognitive 35): StreamingLogicalLogReader::parse_next_transaction has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 6 (17 pts), if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2686}}}],"partialFingerprints":{"codehealthFindingId/v1":"6183c8e2638f92e47555c3687036e4d13196419c0fc39dbeb5711f72f4e08505"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::exec_substring (cognitive 35): Value::exec_substring has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 3 (8 pts), match/switch 2, boolean chains 1 (nesting depth added 13). Most of this is not in the body itself: 13 of the 35 points are its own statements and the rest belongs to 2 function items inside it that branch (calculate_postions, ceil_char_boundary). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/value.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"186a963b9f231335f2ea03411d6d8d02f1fe58721de823012d3043d38cb45d17"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::keep_parenthesized_join_columns (cognitive 35): turso_core::translate::planner::keep_parenthesized_join_columns has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 6 (9 pts), match/switch 2 (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":"core/translate/planner.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"015c63da19744d2ab3b104b405ea49673353b0ba1bcb1e6f47401cf7e09d1d37"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::upsert::rewrite_expr_to_registers (cognitive 35): turso_core::translate::upsert::rewrite_expr_to_registers has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (33 pts), boolean chains 1, match/switch 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":"core/translate/upsert.rs"},"region":{"startLine":1924}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cba02879916f3db5d1d311e388aef6bbd05fb43033d4084ce3a153fac95068"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::rewrite_one_select_table_refs (cognitive 35): turso_core::util::rewrite_one_select_table_refs has cognitive complexity 35 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 5 (13 pts), match/switch 2 (4 pts) (nesting depth added 21). 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":"core/util.rs"},"region":{"startLine":4453}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f91647fb936861a8ea3c09602ba6990ee5eb922e767b776742c508aa21e1a2f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_idx_insert (cognitive 35): turso_core::vdbe::execute::op_idx_insert has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":12423}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60a11eda45a0a00bb8a5895b375561fb9bfd7d6c632b16a5834d43c49bfe10c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::vacuum::build_copy_sql (cognitive 35): turso_core::vdbe::vacuum::build_copy_sql has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 3 (5 pts), match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/vacuum.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de37b0f508d76594e3b2cb4ec18f5116350086fef393e8bd6d8258b8cecac75"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokenizer::next (cognitive 35): Tokenizer::next has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (8 pts), match/switch 2 (6 pts), boolean chains 5 (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":"postgres/cli/read_state_machine.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"306eb328dd577d2eccc3ba916fc6ad22f4b5a3d60b7d2378c210d88237ebd70a"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_create_table_column (cognitive 35): PostgreSQLTranslator::translate_create_table_column has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0bde4ae03cd854e9b4d3d695f4103a907342a651ce857209be13bcda9998fd"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseReplaySession::replay (cognitive 35): DatabaseReplaySession::replay has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 4 (11 pts), loops 1 (4 pts), boolean chains 1 (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":"sync/engine/src/database_tape.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c388d668958c540037e40d562f8f507ee4ae99f678fa4f8fc76d392f886d029"}},{"ruleId":"D2","level":"warning","message":{"text":"CoverageReport::fmt (cognitive 35): CoverageReport::fmt has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 5 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 13). Of this number, 28 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/trace.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ac1836a86fe0fa95e7a24ce0869ffeaae077f4ab92debd21b3031931e849b8"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::check_files (cognitive 35): sqltest::check_files has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (8 pts), match/switch 2 (8 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":"testing/sqltest/src/main.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"685d2bebe27986ec53439d6ec275edfafb7ea81505aced183224ca85a5edec38"}},{"ruleId":"D2","level":"warning","message":{"text":"FtsIndexAttachment::new (cognitive 34): FtsIndexAttachment::new has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 5, match/switch 4 (5 pts), loops 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/fts/mod.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b88b202c21d2b3545dd51555f50933bfbafb250adb44da558ee845d5c908fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::user_relations (cognitive 34): Schema::user_relations has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 6 (12 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":"core/schema.rs"},"region":{"startLine":1714}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4af87866c71984526dae5b67656b86d11606d514c51a479d395aa3c68a5ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::btree::fill_cell_payload (cognitive 34): turso_core::storage::btree::fill_cell_payload has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (24 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":10609}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d00f91661a97f73263fa5182569bf05dabe9a5c25f4d29c8e49562c97bd6982"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::binding::resolve_qualified_name (cognitive 34): turso_core::translate::expr::binding::resolve_qualified_name has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 4, match/switch 2 (4 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":"core/translate/expr/binding.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d134ba1ed9dcd7d40164526d39d1f6a217519aff74cd738764ebe1f6fac5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::index::translate_optimize (cognitive 34): turso_core::translate::index::translate_optimize has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (12 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":"core/translate/index.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b239a4f36ae33bf13f7f36c39fa0aae8dfd9618de0050bebf03b65b713f3db"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::insert::init_source_emission (cognitive 34): turso_core::translate::insert::init_source_emission has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 3, match/switch 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c497dda584397c39b2b07845ceaa8df7a05d583d935dd02df4b5601e6b7745a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::estimate_selectivity (cognitive 34): turso_core::translate::optimizer::constraints::estimate_selectivity has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 4, 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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9701bfd97ede3d328ca3fcf515444d87f4191b39afea9a6250bac4bec3ec1d7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::view::translate_drop_view (cognitive 34): turso_core::translate::view::translate_drop_view has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/view.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e62fafec4633a04a5a1686515d2dd2373b2a5c54f116f49be5b6cc27aad38f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_dump_fuzzer::report::render (cognitive 34): turso_pg_dump_fuzzer::report::render has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/dump-fuzzer/src/report.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2e783126ee9bdbee4ff86cea95258791afd018f763737a8ce75b78c28d8e6d2"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_values (cognitive 34): PostgreSQLTranslator::translate_values has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (6 pts), match/switch 1 (2 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":2021}}}],"partialFingerprints":{"codehealthFindingId/v1":"6653da217966d060a87a2dac67dd20b8cf2c7ec89723d86d5a5f04a0c96f334e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_regress::describe::table_footers (cognitive 34): turso_pg_regress::describe::table_footers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (12 pts), match/switch 1 (4 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":"postgres/regress/describe.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"689b18420dde1f9922ddedb89f5fbd7f2909680433d197767aefb61a306eb104"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseReplayGenerator::replay_info (cognitive 34): DatabaseReplayGenerator::replay_info has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (9 pts), loops 1 (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":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db3ff3abc76161547232229c1879ae4c167e3d8f39871bcc8b5fc2eda3a3179"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::stmt::generate_create_table (cognitive 34): sql_gen::generate::stmt::generate_create_table has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 3 (4 pts), boolean chains 3, 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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33cc1b03a9b950b0af8b21a2d0a3192b9f362198b4e57230306b8cc5eb5f7fe"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::tcl_converter::parser::parse_tcl_file (cognitive 34): sqltest::tcl_converter::parser::parse_tcl_file has cognitive complexity 34 (threshold 15). Drivers by points: loops 5 (16 pts), match/switch 3 (11 pts), if/else 2 (6 pts), boolean chains 1 (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":"testing/sqltest/src/tcl_converter/parser.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"53312695c6623afb2ef2d75be61de129f74fd94b22954edda990b689b39686c0"}},{"ruleId":"D2","level":"warning","message":{"text":"DeletePlan::fmt (cognitive 33): DeletePlan::fmt has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 4 (12 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":"core/translate/display.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf815748321839a90d48f173b83da71fa4de2c1f63885358645abba56ba535d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::delete::emit_delete_row_common (cognitive 33): turso_core::translate::emitter::delete::emit_delete_row_common has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 3 (7 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":"core/translate/emitter/delete.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aca5085e0a6fe64a4b474aa34ff5a642305869065ca64cbb5c7d5fefbfd1544"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::walk_schema_expressions (cognitive 33): turso_core::util::walk_schema_expressions has cognitive complexity 33 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 4 (14 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":"core/util.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b3f33c2a3a7348b8fb1742d48e00484353d5fe9b44e6ae73ad1228bb528b1a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::step_view_delta_batch (cognitive 33): turso_core::vdbe::step_view_delta_batch has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"808ca4f9ce1ad585f778a259eb6a931b4d0e82c86f603f4275b4d9ff3fadcb86"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_range_function (cognitive 33): PostgreSQLTranslator::translate_range_function has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 6 (12 pts), boolean chains 4 (nesting depth added 10). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7e9a5de664899ce174f4ec08de78693836408b698ccdb248c4b871b37ecc0b"}},{"ruleId":"D2","level":"warning","message":{"text":"PrettyOutput::write_summary (cognitive 33): PrettyOutput::write_summary has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 4 (14 pts), match/switch 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/output/pretty.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"505e34cac7dd7929eb7fa10379265ab70339b9709e625cce58bee6e82089c82a"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::convert_single_file (cognitive 33): sqltest::convert_single_file has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 3 (5 pts), match/switch 2 (4 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/main.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"18af38d55f2ddc2c8d1d8af664a505160ccb17b2c1b81ed380a82d830e119187"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sqlite3::sqlite3_exec (cognitive 32): turso_sqlite3::sqlite3_exec has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (28 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/c/src/lib.rs"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91bea175f4dc635d42834b3cd16a1de51f991f87f3abf51c667e19accd9b988"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::drop (cognitive 32): Connection::drop has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 1 (2 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":"core/connection.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d100c2a4b9c66b245762c82b4ef801a82f8b50205223301d34551776acf060f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaCursor::load_next_batch (cognitive 32): DeltaCursor::load_next_batch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/delta_cursor.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a129ee0760692ed8436847375e3b0c4d860431a0aa32efc88f089f6e9755298d"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::populate_materialized_views (cognitive 32): Schema::populate_materialized_views has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":3892}}}],"partialFingerprints":{"codehealthFindingId/v1":"7330d25f58d76ffd2b298419bf9e1bf2bb8c85e02b26c7919dfa92ab554ec444"}},{"ruleId":"D2","level":"warning","message":{"text":"EmitOrderBy::sorter_insert (cognitive 32): EmitOrderBy::sorter_insert has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (25 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":"core/translate/order_by.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"5deebce95feb52e3eaf621f5993a17315c816d480bb75916e7e763a18b330b05"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::numeric::decompose_float (cognitive 32): turso_core::numeric::decompose_float has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 10 (15 pts), boolean chains 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":"core/numeric/mod.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0b5c2b266858a28308ec7b85f122f83c75606c4292751f5b5d5104eda05c45"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::insert::emit_notnulls (cognitive 32): turso_core::translate::insert::emit_notnulls has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 4, 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":"core/translate/insert.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"5754cdb3f2ab5d1bcd3bd380384ba6aac8c60e714286b38dc7ae6a330e902758"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::insert::build_insertion (cognitive 32): turso_core::translate::insert::build_insertion 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":"core/translate/insert.rs"},"region":{"startLine":2772}}}],"partialFingerprints":{"codehealthFindingId/v1":"7628e705cfcc4e21a1ae4b3924a250f0da33b52202535774edf51914bd224b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::main_loop::close::replace_subquery_output (cognitive 32): turso_core::translate::main_loop::close::replace_subquery_output has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 6 (12 pts), match/switch 3 (5 pts) (nesting depth added 15). Of this number, 16 points are the body\u0027s own statements and 16 belong to 3 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/close.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a10d593e150ae8337841baeeacd14e48f31a3f861b58d20709452d7984ce1e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::order::plan_satisfies_order_target (cognitive 32): turso_core::translate::optimizer::order::plan_satisfies_order_target has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 2, 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":"core/translate/optimizer/order.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"39743cc3d981b9b71ed4e77e89749e3f8d9b634c5eb59fc4984b584a19d583a1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::try_rewrite_single_value_aggregate (cognitive 32): turso_core::translate::optimizer::unnest::try_rewrite_single_value_aggregate has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (22 pts), loops 5, boolean chains 4, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/unnest.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e709c3ebf22430e1e3371ecd41ef1be3e33b3a7f93cca7cb4659baab10d614"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::rename_column_view::rewrite_one_select_for_column_rename (cognitive 32): turso_core::util::rename_column_view::rewrite_one_select_for_column_rename has cognitive complexity 32 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 6 (13 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":"core/util.rs"},"region":{"startLine":3322}}}],"partialFingerprints":{"codehealthFindingId/v1":"802710f198aec53e202089b5e2995d49e129ce3e6f6740e3fca7760689847241"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vector::operations::convert::vector_convert (cognitive 32): turso_core::vector::operations::convert::vector_convert has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (12 pts), match/switch 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":"core/vector/operations/convert.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bc1afcdc69ed2c45768023edd4f5874e8ddb77873cbb0a8cf81a9c6af3f77d"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_on_conflict (cognitive 32): PostgreSQLTranslator::translate_on_conflict has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 4 (8 pts), loops 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":"postgres/parser/translator.rs"},"region":{"startLine":5074}}}],"partialFingerprints":{"codehealthFindingId/v1":"805ebc62d75370a4effec56019c7366e523552354ff9a0ab0560256c2aed9691"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::send_push_batch (cognitive 32): turso_sync_engine::database_sync_operations::send_push_batch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b51469b33067babdb6b0ffa07ca9b7d6d39322de8bdc2bd10160d09c70d35c0"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractionType::execute_faulty_query (cognitive 32): InteractionType::execute_faulty_query has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (9 pts), match/switch 1 (3 pts), boolean chains 2 (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":"testing/simulator/model/interactions.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"05739fbe91dba6375a5345dc0d64c960679d58b47cd26d073b339289e98931c4"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::bootstrap_nonblock (cognitive 31): MvStore::bootstrap_nonblock has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (25 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":5128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade1435599c2f6288fb389a554b9e90f60a2b0bcf60f819c5fd0e25412e8d756"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement::finish_step (cognitive 31): Statement::finish_step has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (26 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c332db5ecd9809f86c23b9fa2af76d056424eed39b482f6f629dde37c4ecc5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement::get_column_name (cognitive 31): Statement::get_column_name has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 4 (8 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":"core/statement.rs"},"region":{"startLine":1091}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb2f9e39f7ea621544c022e40c2524d24bcda611f55e6d8bce6ad7f86445273"}},{"ruleId":"D2","level":"warning","message":{"text":"Pager::free_page (cognitive 31): Pager::free_page has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (24 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":5571}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e778c89f8b3c3eb64a0ed7d4e00af202e498f0a3994eddc5f94fc1c8e0a9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::mvcc::persistent_storage::logical_log::try_parse_one_op_from_buf (cognitive 31): turso_core::mvcc::persistent_storage::logical_log::try_parse_one_op_from_buf has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 3, 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"00605797e8b1668270a29bce652d0755009f4b3e52d9b79746e1986572c54287"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::schema::validate_generated_expr (cognitive 31): turso_core::schema::validate_generated_expr has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (8 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":"core/schema.rs"},"region":{"startLine":6986}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc645bb8bd08833a253db4def0c8130bdfb15ba187f117b68fc380ae093a351"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::rewrite_trigger_sql_for_column_rename (cognitive 31): turso_core::translate::alter::rewrite_trigger_sql_for_column_rename has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (22 pts), loops 2 (4 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":"core/translate/alter.rs"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"9138d76f0f8e819e7678b198c04101e8e4ace1d08beb35d645f4babfa3baf0ec"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::try_hash_join_access_method (cognitive 31): turso_core::translate::optimizer::access_method::try_hash_join_access_method has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 3, loops 1, 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5e795cc4e6834713036ffe45eb143a431805835801751f040065e4ceeafa73"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::rewrite_as_semi_or_anti_join (cognitive 31): turso_core::translate::optimizer::unnest::rewrite_as_semi_or_anti_join has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 7 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/unnest.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"d145d29687a4c21721c3d656a4d30c83433d4e00a062b42fb57162f7dcd4eb31"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::validate_check_expr (cognitive 31): turso_core::translate::schema::validate_check_expr has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 2, 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":"core/translate/schema.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b64401e08eef6c1e718de8e19077c94bf7202699189742da95d4d1cee92f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_hash_probe (cognitive 31): turso_core::vdbe::execute::op_hash_probe has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 5 (14 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":"core/vdbe/execute.rs"},"region":{"startLine":17752}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fa1d4d286bee610bdcfe12248a4030b35285f0c0ee0c4d15e7e5eb3b3d79cb"}},{"ruleId":"D2","level":"warning","message":{"text":"DeferredExecution::cleanup_nonblock (cognitive 31): DeferredExecution::cleanup_nonblock has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 2 (5 pts), boolean chains 3, 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":"postgres/frontend/session.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"601287e2c72e280222d4b3256236cd8cd30171373a07ad4c530c7c5b7ecd1f1d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::functions::like_matches (cognitive 31): turso_pg::functions::like_matches has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (20 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/functions.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a16375c5b644da1077cbb93f542d3f539f80810ba7df884c0bf0c88ea46f31"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_parser::translator::validate_generation_expression (cognitive 31): turso_pg_parser::translator::validate_generation_expression has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 2 (5 pts), boolean chains 3, 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":"postgres/parser/translator.rs"},"region":{"startLine":7143}}}],"partialFingerprints":{"codehealthFindingId/v1":"65689a8111d5da39bce9d1f301dd3765bb57d886a12c0cb56a5d47fdcf5176da"}},{"ruleId":"D2","level":"warning","message":{"text":"ColumnConstraint::to_tokens (cognitive 31): ColumnConstraint::to_tokens has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 4 (8 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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"278771c0056ac985e93db6ab7c9a094e9aee8df341e3a59d321d57e431340dff"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::select::generate_aggregate_call (cognitive 31): sql_gen::generate::select::generate_aggregate_call has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (22 pts), loops 2 (5 pts), boolean chains 4 (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":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"0179efdcf164ab71de0d4905ebc42e1e2804d1814cc5875af8d365356d3468a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Property::get_extensional_query_gen_function (cognitive 31): Property::get_extensional_query_gen_function has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 6 (11 pts), boolean chains 4 (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":"testing/simulator/generation/property.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"02375bd653a6dc31433fe16b76e2ab5c9c67b52596da5fc4c0655c35df2ea46f"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol.executeCursor (cognitive 31): protocol.executeCursor has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), error handling 4 (6 pts), loops 4 (5 pts) (nesting depth added 12). Of this number, 17 points are the body\u0027s own statements and 14 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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4215be2472eabeb5edd9f6a3075fa908006def91358cef0baa9c9ccc293ebe36"}},{"ruleId":"D2","level":"warning","message":{"text":"SeekEmitter::emit_start_bound (cognitive 30): SeekEmitter::emit_start_bound has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 4 (7 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":"core/translate/main_loop/seek.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e72922615bcda370f089f43802a771e41e41ad38c27991524e0d54561c31df"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgramBuilder::epilogue (cognitive 30): ProgramBuilder::epilogue has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (6 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/builder.rs"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dde45a280e29074a52bf6b8a5db6983cb6464d19b2b945d9a71bbbe2b1758f7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::compound_select::emit_compound_select (cognitive 30): turso_core::translate::compound_select::emit_compound_select has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 5 (10 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":"core/translate/compound_select.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d47e92aa4cad529fc5a85988435b4e5217073baa94c1da7ef9312a2c522608"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::condition::translate_leaf_condition_expr (cognitive 30): turso_core::translate::expr::condition::translate_leaf_condition_expr has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 2 (3 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":"core/translate/expr/condition.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b29ddc00dcc6351da87c5b45a5594791e2e82c92aa44f062c476460864bf025"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::collect_subquery_table_refs_in_one_select (cognitive 30): turso_core::translate::planner::collect_subquery_table_refs_in_one_select has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (13 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":"core/translate/planner.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"500fa8e4f96350e2eeba113d0392c289b481c3f565cb9031d210d3e106752520"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::decode_serial_type_into_register (cognitive 30): turso_core::vdbe::decode_serial_type_into_register has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":4389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90cfc503a4c2a5874bb5464521bc48fdc8b56db8cc4d2c0ea44b52ebb52e7df"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_macros::derive_description_from_doc (cognitive 30): turso_macros::derive_description_from_doc has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (20 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macros/src/lib.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"8358c12c133880ad319f6de02f4be195edf94de2bc0b3f06223e37e5a9c3a4b7"}},{"ruleId":"D2","level":"warning","message":{"text":"ClassCatalog::apply (cognitive 30): ClassCatalog::apply has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 1 (3 pts), match/switch 1 (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":"postgres/frontend/classes.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c5df47fdc79cea696a491059a9487bca5f1f53a032c0cedfaac1d90992a214"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::open::open_database_async (cognitive 30): turso_pg::open::open_database_async has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 4 (13 pts), loops 1 (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"postgres/frontend/open.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd766d51d92f44aa3d29a44c7e3ac330782762202e24afca198c29e8e0c61579"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_create_sequence (cognitive 30): PostgreSQLTranslator::translate_create_sequence has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 3 (9 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":5388}}}],"partialFingerprints":{"codehealthFindingId/v1":"0318234762289dd4356bc8705fe1151ef0b5443a18f08e1950d7740833d963b5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_parser::translator::validate_generated_columns (cognitive 30): turso_pg_parser::translator::validate_generated_columns has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":7019}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02a3acd6d9d94f4b59fba91b25c1534d5bbd45e227b43fb3d737047335fd54b"}},{"ruleId":"D2","level":"warning","message":{"text":"session.executeStmt (cognitive 30): session.executeStmt has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (27 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":"serverless/go/session.go"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598aa0b791870a7e9f9317419e1af1d63a861a177579c525e43d7a450552a7e"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDataReader.GetSchemaTable (cognitive 29): SqliteDataReader.GetSchemaTable has cognitive complexity 29 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"372ce5db7212ef1ea6f94948537f713753efce0f18237b7024fe22ce56ac12b0"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::indexbtree_move_to_inner (cognitive 29): BTreeCursor::indexbtree_move_to_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2364}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91d486c04e85561fc19faac49977bf9b6ed019acc9fe080cf6e91e0af75ae64"}},{"ruleId":"D2","level":"warning","message":{"text":"PreparedHashBuild::emit (cognitive 29): PreparedHashBuild::emit has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 4 (7 pts), match/switch 2 (5 pts) (nesting depth added 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":"core/translate/main_loop/hash.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"689cb9ff93ba1226e86ec806372e071ad551b59dd2adf1b92672a031fba96713"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::spill_multiple_partitions (cognitive 29): HashTable::spill_multiple_partitions has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 7 (11 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"652746de284a3dad00d0eaf2184e0d99bfe14c501ca761e7061bd97d497a0a70"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::printf::printf_c_arg_plan (cognitive 29): turso_core::functions::printf::printf_c_arg_plan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 2 (3 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":"core/functions/printf.rs"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7809ec448a29f98ae84b62aa7fa1015ccc2993e66d410825ce58ffa0b1638d2e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::rewrite_correlated_subqueries (cognitive 29): turso_core::translate::optimizer::unnest::rewrite_correlated_subqueries has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 2, 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":"core/translate/optimizer/unnest.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99f404f0f5ee694e2421cd300bd3b237d33482a00b81de71ae0b07fd391432b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::subquery::assign_select_subquery_eval_phases (cognitive 29): turso_core::translate::subquery::assign_select_subquery_eval_phases has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 5, loops 4 (5 pts), match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/subquery.rs"},"region":{"startLine":2444}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c5f9f183a35074b0839af06fe5ee9031b04ef4dabdca4905ab1906007d0336"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_macros::ext::match_ignore_ascii_case::match_ignore_ascci_case (cognitive 29): turso_macros::ext::match_ignore_ascii_case::match_ignore_ascci_case has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 4 (10 pts), loops 5 (8 pts) (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 11 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":"macros/src/ext/match_ignore_ascii_case.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"3113f8acf142aae14d74a39acc7e3751f75a46513ad944f1a7434fb3ef3f358a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_postfix_expression (cognitive 29): Parser::parse_postfix_expression has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2205819544b7c08b4256b5b9533256962c15593f5ec539e4191451cd8e7cd8"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoDatabase::open (cognitive 29): TursoDatabase::open has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk-kit/src/rsapi.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd7a9972910a594feb915f86d3e3a8dce27445de0a2ae2ad5d50d83355020a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_name_or_function_call_expr (cognitive 29): Parser::parse_name_or_function_call_expr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 18 (26 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":2013}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c40d42cafdc6f64fef616176e4083e697200a71134b358b5ee500bd023b8b22"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseReplayGenerator::execute_ddl_idempotent (cognitive 29): DatabaseReplayGenerator::execute_ddl_idempotent has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 2 (6 pts), match/switch 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":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e41e2772921dacbe34614ce61cc065f7b970449d3eb4b736c6f6ebfc36ea0d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::logical_op_to_tape_operations (cognitive 29): turso_sync_engine::database_sync_operations::logical_op_to_tape_operations has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"de63340145b3ca6427ed85b21be88f86bf70cdc67d1871bd73b53bdc484a98a1"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::stmt::generate_update_sets (cognitive 29): sql_gen::generate::stmt::generate_update_sets has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"08196e91926422093b2db57e009154dd3161cb192b1d92af7e6fd4ff0e1702d5"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::tcl_converter::write_test (cognitive 29): sqltest::tcl_converter::write_test has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (8 pts), match/switch 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":"testing/sqltest/src/tcl_converter/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ef4ec3f14837250eced0582f50c4fe2f4712e0b6b6c9f69a88a1d984d3743c"}},{"ruleId":"D2","level":"warning","message":{"text":"wal_commits.main (cognitive 29): wal_commits.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3 (6 pts), ternaries 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":"scripts/corruption-debug-tools/wal_commits.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3a7080d8d0d244fe7de67a2d6b1a967872e2460b560e0ca35a7753b3081dea"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::init_pager (cognitive 28): Database::init_pager has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19 (27 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":"core/database.rs"},"region":{"startLine":3347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9918601669c951f63f90b75d3887094f01073c63e2f537be264fd758cc103d06"}},{"ruleId":"D2","level":"warning","message":{"text":"MvccLazyCursor::next (cognitive 28): MvccLazyCursor::next has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 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. This shape REPEATS in the file: one other method here (MvccLazyCursor::prev) 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":"core/mvcc/cursor.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd31dcdc961589629aeff32be6e10a17ed0173e30937678e47f6c98316fed725"}},{"ruleId":"D2","level":"warning","message":{"text":"MvccLazyCursor::prev (cognitive 28): MvccLazyCursor::prev has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 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. This shape REPEATS in the file: one other method here (MvccLazyCursor::next) 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":"core/mvcc/cursor.rs"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"7577be7e9e51491a51b6b5f839e779b18042c680d7c3540c1e9f770148732b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalLog::frame_and_pwrite_tx (cognitive 28): LogicalLog::frame_and_pwrite_tx has cognitive complexity 28 (threshold 15). Drivers by points: if/else 22 (26 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"0798a8adc572239bd6b65402b3d510b7f128037acdbe2f2f47ec1b92e384594e"}},{"ruleId":"D2","level":"warning","message":{"text":"EqpDetail::fmt (cognitive 28): EqpDetail::fmt has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), match/switch 4 (7 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":"core/translate/eqp.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"912e5b586972cd1330cda1eb42447d0e18a2046d573afe4dd76ea3ceaf179f19"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::probe (cognitive 28): HashTable::probe has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (4 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":"core/vdbe/hash_table.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5211bab97ec970a45c952b23ada1c1207686d401adf592a3bd1e63e5228130"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::commit_txn_mvcc (cognitive 28): Program::commit_txn_mvcc has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 6 (11 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":"core/vdbe/mod.rs"},"region":{"startLine":3257}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c19707e78fa483c34023339c88c8cf5cf8a46d45c8d67e7c797e83a2253b05"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::jsonb::skip_whitespace_and_comments (cognitive 28): turso_core::json::jsonb::skip_whitespace_and_comments has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (9 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":4263}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73beddbe92222b7e58373e2fcbc44791e338f53358c13ac163e98aca7c9b3ca"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::translator::translate_subquery_result_expr (cognitive 28): turso_core::translate::expr::translator::translate_subquery_result_expr has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (6 pts), match/switch 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":"core/translate/expr/translator.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d21a4e6f5d0af35a5582e7e270498dc4ffec55507dbcc415ae34dbeb56fc86b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::usable_constraints_for_lhs_mask (cognitive 28): turso_core::translate::optimizer::constraints::usable_constraints_for_lhs_mask has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":1546}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df57625d013912cfa051c8c5018498fb3e77e7f68cb3fd9881d49f90943a648"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::window::emit_function_step (cognitive 28): turso_core::translate::window::emit_function_step has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e574675f0fbb83603fdb9b10390eaa9eb910cd5a91d8fcd8819901f91d23aa9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::scan_dollar (cognitive 28): Lexer::scan_dollar has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (6 pts), boolean chains 4 (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":"postgres/parser/lexer.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"a470a242e5feb9f1ce7f11fad44acedefd482978df9d5cc74147c6ce279090f1"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_func_call (cognitive 28): PostgreSQLTranslator::translate_func_call has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (22 pts), match/switch 3 (4 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":"postgres/parser/translator.rs"},"region":{"startLine":4297}}}],"partialFingerprints":{"codehealthFindingId/v1":"957178ab01b6798310675a623cf2ae59b7d40e1fe3315188d1efdc45fa5bc039"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_serverless::batch::decode_batch_result (cognitive 28): turso_serverless::batch::decode_batch_result has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 2 (3 pts), match/switch 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":"serverless/rust/batch.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fcf3e5ae6d4fc9ab79f46e7983705d59435b10ce3d310c88dbf15775332c63"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_generation::generation::generated_expr::generate_expr_inner (cognitive 28): sql_generation::generation::generated_expr::generate_expr_inner has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 4, 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":"sql_generation/generation/generated_expr.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fd35ecda8e2e77d62510ff1aa7fce2d4a23e9515e33939abf5c7d493136d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::snapshot::find_all_pending_snapshots::scan_dir (cognitive 28): sqltest::snapshot::find_all_pending_snapshots::scan_dir has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (5 pts), boolean chains 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":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"815fb8208043d78c4188d5437a449a26208fd5ab9f105eed956911dea8fc9579"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sqlite3::parse_uri_filename (cognitive 27): turso_sqlite3::parse_uri_filename has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (14 pts), if/else 5 (10 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/c/src/lib.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"3598905ca49509449de47d45abe35e8c55dd970d072a350c7f2ddb0ab8cf3a9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Limbo::print_list_mode (cognitive 27): Limbo::print_list_mode has cognitive complexity 27 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (8 pts), match/switch 2 (6 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":"cli/app.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e7fef22f86442695f321da6741dfa886e2073754527a50c155c010270293b1"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::move_to_rightmost (cognitive 27): BTreeCursor::move_to_rightmost has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 2 (5 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":"core/storage/btree.rs"},"region":{"startLine":1991}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e839bc01d5c7cdd06c2667dfa7afc7b15199ea920376bc0bfeee445b75e8f60"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::clear_overflow_pages (cognitive 27): BTreeCursor::clear_overflow_pages has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":5499}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c2316b65a7a7eea46c56acfe97c82aea8346437256ea80919856a00e564cec"}},{"ruleId":"D2","level":"warning","message":{"text":"SeekEmitter::emit_termination (cognitive 27): SeekEmitter::emit_termination has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/seek.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"933228b662e52bae9256320417c510bedfbfb818ae0dc846332cea9a36a44e50"}},{"ruleId":"D2","level":"warning","message":{"text":"RecursiveRefCounter::count_one_select (cognitive 27): RecursiveRefCounter::count_one_select has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 4 (10 pts), match/switch 1 (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":"core/translate/planner.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bde1824981252c43cf510f7834ce845ae858b3ca78a1c8106e6a272a41829ce"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::build_seek_def (cognitive 27): turso_core::translate::optimizer::build_seek_def has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 14 (23 pts), if/else 4 (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":"core/translate/optimizer/mod.rs"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"9241fe72172fc0566c4ae1155761f09357b4f50887ed854b45e9f4a222f991e6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::find_best_access_method_for_btree (cognitive 27): turso_core::translate::optimizer::access_method::find_best_access_method_for_btree has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/access_method.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec84d954858c5d67deeb891800023838a072bf6c920f451ea0ed7977997184d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::try_capture_parameters_column_agnostic (cognitive 27): turso_core::util::try_capture_parameters_column_agnostic has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, 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":"core/util.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95fec6aa9503e9363b8c2c32d760df8eb11bd0dee4160dc1d7656523cbfb580"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::visit_one_select (cognitive 27): turso_core::util::visit_one_select has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (10 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":"core/util.rs"},"region":{"startLine":2015}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e2aa202df1f6472f58cde9da91e7d4eadc9e9c5d9c773d5d90498cca27fde8"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::handle_text_sum (cognitive 27): turso_core::vdbe::execute::handle_text_sum has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 4 (11 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":17329}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0990e246b99dcd3db6aa7ea7bf2e47be582a246b979ae7fda3ff89f9dc97a3"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_regress::run_transcript (cognitive 27): turso_pg_regress::run_transcript has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/regress/main.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3158af310918c7a488063a1423a975993b00813835193ed14942c7c303d1df"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_regress::split_copy_spec (cognitive 27): turso_pg_regress::split_copy_spec has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (9 pts), loops 2 (5 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":"postgres/regress/main.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df18e9daf035d595b6ccfbb6e742fc92a93a40e8407df153628551067311b4d"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSyncEngine::apply_logical_mvcc_changes_internal (cognitive 27): DatabaseSyncEngine::apply_logical_mvcc_changes_internal has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 3 (8 pts), loops 2 (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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"404ae3a275d28fde259c13b62de546a88b32b1f4e69aab1b5a1720ce872b24ae"}},{"ruleId":"D2","level":"warning","message":{"text":"verify_stale.main (cognitive 27): verify_stale.main has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), ternaries 2 (5 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":"scripts/corruption-debug-tools/verify_stale.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77ea5a8bcf7001165dc274aa1af2b048b409bff73719b464f1c232dd60174e3"}},{"ruleId":"D2","level":"warning","message":{"text":"update-version.update_package_json (cognitive 27): update-version.update_package_json has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (4 pts), error handling 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/update-version.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b2ac8c635a36253b368983fa373b6fc34f88c09f1113172a4834a3988a1ad7"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::sync_autoincrement_backing_tables_from_sqlite_sequence_nonblock (cognitive 26): Connection::sync_autoincrement_backing_tables_from_sqlite_sequence_nonblock has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c9a9a6ed4034fbaaacf1fa1d612a25cbc3eec3798fc35ab558436a8f568c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"CommitStateMachine::release_group_claim (cognitive 26): CommitStateMachine::release_group_claim has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 2 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":1792}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e1da32bded00146dcb2fcd31b994c509972f5da2a0fbab0d66c51da9e0c449"}},{"ruleId":"D2","level":"warning","message":{"text":"GeneratedColGraph::build (cognitive 26): GeneratedColGraph::build has cognitive complexity 26 (threshold 15). Drivers by points: loops 9 (15 pts), if/else 5 (10 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":"core/schema.rs"},"region":{"startLine":5562}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c993f770e9e4d174dd4eb7aa627f6595a3b0baf55edf7944b131cc8769f5ad"}},{"ruleId":"D2","level":"warning","message":{"text":"GraceHashLoop::emit (cognitive 26): GraceHashLoop::emit has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (26 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":"core/translate/main_loop/hash.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9842896d781a66be651a27ece73effc790b6c30cd14d2c3497a4f130a71d9c"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::finalize_build (cognitive 26): HashTable::finalize_build has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 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":"core/vdbe/hash_table.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"524eafc8587e172621647f53e9699248ca9f68b6e099b4b7875d39eba09e786f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::compound_select::emit_program_for_compound_select (cognitive 26): turso_core::translate::compound_select::emit_program_for_compound_select has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (20 pts), match/switch 3 (5 pts), loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/compound_select.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bfbed352a4d9cf04cecfe72d944a9181404a54a86e5da19e91efd2791d9859"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::eqp::seek_constraint_parts (cognitive 26): turso_core::translate::eqp::seek_constraint_parts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (5 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":"core/translate/eqp.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5f31a120db44d54edf8e9bfd4487896cdf0e8f8f2d59ed03c9654ae7c9e3f6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::main_loop::body::emit_unmatched_row_conditions_and_loop (cognitive 26): turso_core::translate::main_loop::body::emit_unmatched_row_conditions_and_loop has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 5 (7 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":"core/translate/main_loop/body.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"717d66d27335173f4001db750210494811ef861a76f6f5e6b658ca8f734a3b56"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::plan::expand_table_star (cognitive 26): turso_core::translate::plan::expand_table_star has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 4, 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":"core/translate/plan.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce19c98dfcdc99e32921da80ccfc15275ac1f2944fc9c217024f2e76e8a1f46"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::update::collect_indexes_to_update (cognitive 26): turso_core::translate::update::collect_indexes_to_update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/update.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5d9591d6c25062d0685fd43467fb3dd507a27a50b4cb49bb5d337b26edc3dc"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::update::check_update_from_column_ambiguity (cognitive 26): turso_core::translate::update::check_update_from_column_ambiguity has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 4 (7 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/update.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"61fe8e4d3c677e130ef378ec301435215cab8e526c8e48dcea2a1b4be468b456"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::advance_unmatched_scan (cognitive 26): turso_core::vdbe::execute::advance_unmatched_scan has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (7 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":18085}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee69e348d89477a508f632d76a3ced3d634ca7f09a1340993b29267f7b77bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_fuzzy::soundex::soundex (cognitive 26): limbo_fuzzy::soundex::soundex has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 pts), boolean chains 4 (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":"extensions/fuzzy/src/soundex.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"898430da9217299015951cfcd2467e6292b2d6270b34ddff26c53fba1e64138d"}},{"ruleId":"D2","level":"warning","message":{"text":"PgDependTable::load_rows (cognitive 26): PgDependTable::load_rows has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 7 (12 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":"postgres/frontend/catalog.rs"},"region":{"startLine":3064}}}],"partialFingerprints":{"codehealthFindingId/v1":"5264c668eeb4eecf4cffb82f392cf2bbcf107249d8fbb9b93b1993e159ae51fe"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseReplayGenerator::replay_values (cognitive 26): DatabaseReplayGenerator::replay_values has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (5 pts), match/switch 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":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a7317e64134e00b88239305d6864309d1d55e15dba63f3568c2dfa1c603aac"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseSyncEngine::bootstrap_db (cognitive 26): DatabaseSyncEngine::bootstrap_db has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a42a4e444eb188d9398416397ae9648d1aaa07842ae47d5cd0e657ae002557"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::decode_recovery_ops_to_logical_txn (cognitive 26): turso_sync_engine::database_sync_operations::decode_recovery_ops_to_logical_txn has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (23 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfa28b88b007494a4ec8f7fddc29697b2e4d4d0940a1857336d2b584a2aa0c1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::sql_execute_http (cognitive 26): turso_sync_engine::database_sync_operations::sql_execute_http has cognitive complexity 26 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 3 (9 pts), match/switch 2 (5 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":3706}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65abe247fb02e06c42d2314707aad01155ada813ac2ec3905e983d5d2356970"}},{"ruleId":"D2","level":"warning","message":{"text":"UpdateStmt::fmt (cognitive 26): UpdateStmt::fmt has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (21 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1054}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3b471d5089cd6fc02f1909a89d2b6cef7cd74445a807a96bfead880bbf7a2c"}},{"ruleId":"D2","level":"warning","message":{"text":"FtsCursor::stage_statement_commit (cognitive 25): FtsCursor::stage_statement_commit has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, 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":"core/index_method/fts/mod.rs"},"region":{"startLine":3583}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f096ff07a4c6274df12e8cda329f11d1d682fd38b8ffab3f9e294b6c8902d01"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentClaimer::step (cognitive 25): SegmentClaimer::step has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 4 (11 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/fts/rows.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"105d64063ed32fbc491d5546899ccb453ce5b50b1934e748b80664a5178a3525"}},{"ruleId":"D2","level":"warning","message":{"text":"MvccLazyCursor::_advance_btree_forward (cognitive 25): MvccLazyCursor::_advance_btree_forward has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 2 (5 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":"core/mvcc/cursor.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"00677a2e20ab2f3f1c829d1b19862ee7cae1d385f06d43399cb0f169a03a1fa9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::ext::vtab_xconnect::execute (cognitive 25): turso_core::ext::vtab_xconnect::execute has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (10 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":"core/ext/vtab_xconnect.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecdedafdcb944210b1cf270267b380331d96064ac3183e9b68cbd46be5dbc2f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::plan_node_output (cognitive 25): turso_core::incremental::vdbe_maintenance::plan::plan_node_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (9 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca798a0865053345b4764e8f6afd11bd1311921a9068495e22bd09da2555c1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::btree::page_free_array (cognitive 25): turso_core::storage::btree::page_free_array has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (10 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":"core/storage/btree.rs"},"region":{"startLine":9552}}}],"partialFingerprints":{"codehealthFindingId/v1":"05424609ff6a9dd36110d54094026b8b8cf74913e00cb0c02cb11149565270ae"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::btree::defragment_page_fast (cognitive 25): turso_core::storage::btree::defragment_page_fast has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (22 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":"core/storage/btree.rs"},"region":{"startLine":9976}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4b7911e7ac04f6219d7fd59f8d694c0182e22baf8c2ed703317f50ef566d89"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::apply_one_select_for_column_rename (cognitive 25): turso_core::translate::alter::apply_one_select_for_column_rename has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (12 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":"core/translate/alter.rs"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d73dd2705858a98e145900499f379fca2f007ad6e975e7011d1cbeefd0d81b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::multi_index::consider_multi_index_union (cognitive 25): turso_core::translate::optimizer::multi_index::consider_multi_index_union has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b0af7cf95d76734e33f5faba35b5e3ec3550d074218ab50ca0bbf7aad1db80"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::link_with_window (cognitive 25): turso_core::translate::planner::link_with_window has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 5 (13 pts), if/else 8 (10 pts), boolean chains 2 (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":"core/translate/planner.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9290a6f96285c5a85c7be05090c433240aec9f1551111a60f90bd666de61b13"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::validate_check_types_in_expr (cognitive 25): turso_core::translate::schema::validate_check_types_in_expr has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), match/switch 2 (3 pts) (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":"core/translate/schema.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"f087146715b2d912148421148c2f4aeb5703650ceaf31bb057bb19cd36170e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::subquery::update_column_used_masks (cognitive 25): turso_core::translate::subquery::update_column_used_masks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (9 pts), match/switch 2 (nesting depth added 11). Most of this is not in the body itself: 7 of the 25 points are its own statements and the rest belongs to 2 function items inside it that branch (propagate_outer_refs_from_select_plan, propagate_outer_refs_from_plan). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/subquery.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c967e5b62d2ea5d98e7044b270aa7c9ef0edf77a49401ac262a54d2a72adc73"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::trigger_exec::rewrite_one_select_expressions (cognitive 25): turso_core::translate::trigger_exec::rewrite_one_select_expressions has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (12 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":"core/translate/trigger_exec.rs"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"8780ea851f1ad4ea5900aad0ecdc6ab84a7f1e5a0e70891f6b60178d0cfce060"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::window::emit_lag_lead_lookup (cognitive 25): turso_core::translate::window::emit_lag_lead_lookup has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (9 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":3577}}}],"partialFingerprints":{"codehealthFindingId/v1":"a981f0e14df10f684f4e9f13f18b5bdbe5fc629a4db175bdefc27675482dac3b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::rename_column_view::rewrite_select_table_for_column_rename (cognitive 25): turso_core::util::rename_column_view::rewrite_select_table_for_column_rename has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 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":"core/util.rs"},"region":{"startLine":3504}}}],"partialFingerprints":{"codehealthFindingId/v1":"05332a223cfe20932ab285125dab243ce872d75511e15e46d8bc8d4ec53d65a1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_agg_final (cognitive 25): turso_core::vdbe::execute::op_agg_final has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 5 (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":"core/vdbe/execute.rs"},"region":{"startLine":9489}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76f9606f936c7bf04878a3cbbea8d3ba8c6966e0bbec270099f070fee241620"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_drop_column (cognitive 25): turso_core::vdbe::execute::op_drop_column has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (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":"core/vdbe/execute.rs"},"region":{"startLine":16771}}}],"partialFingerprints":{"codehealthFindingId/v1":"b528789c6afd6e35f1fc5142cf2e23ee1e31a17b12d3b4b179b95b1167690efb"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_dump_fuzzer::decode_field (cognitive 25): turso_pg_dump_fuzzer::decode_field has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (7 pts), match/switch 2 (6 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":"postgres/dump-fuzzer/src/lib.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b9b0446753bf4413289c1165c69206222abd2c1028b6352cce92671630b674"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_whopper::create_initial_indexes (cognitive 25): turso_whopper::create_initial_indexes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (7 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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"536c813fd03bef75e74958969d13e95b2a20659edc1d6f34b6fa2190a3f90d56"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::select::generate_join_clauses (cognitive 25): sql_gen::generate::select::generate_join_clauses has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 4, match/switch 2 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"9266eda58871f8b4e8d247c4dc353fc1d142afb1e36cf63abb4f06761e9ef213"}},{"ruleId":"D2","level":"warning","message":{"text":"TestRunner::spawn_snapshot_tests (cognitive 25): TestRunner::spawn_snapshot_tests has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc319121bbefecd1b8fa970aa7f303fb0d24a7e62539d8eaa9fc85520321eea"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::snapshot::format_explain_output (cognitive 25): sqltest::snapshot::format_explain_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (21 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":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"5117ea6bb1f8f44c00e12d109f6f265a6effa9957fd3a76d568a9987adc95c63"}},{"ruleId":"D2","level":"warning","message":{"text":"promise.executeBatch (cognitive 25): promise.executeBatch has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (26 pts), ternaries 7 (10 pts), error handling 5 (8 pts), loops 4 (5 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. This shape REPEATS in the file: one other method here (promise.executeBatch::executeStatement) 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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bd194e62068cd9e4145fe3ef6a8e4168dc82754c45dd234b0239b4bea814f1"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteCommand.SplitStatements (cognitive 24): SqliteCommand.SplitStatements has cognitive complexity 24 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5798f82951b429d316377a57b1f35730eedc15013d77356c50486c1157b7650"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_cli::config::terminal::read_windows_console_response (cognitive 24): turso_cli::config::terminal::read_windows_console_response has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/config/terminal.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a054e0e36bed4d4823e0c07d8383ba782197818fcca488ea9dfa978f1b1a3e47"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStateMachine::gc_checkpointed_table_versions (cognitive 24): CheckpointStateMachine::gc_checkpointed_table_versions has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 1 (3 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"35888d5c192bb70d944c91ae8bbd3d3b78183115127ac1a7dc4ce1c80b3aa301"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildLocalSchemaViewStateMachine::step (cognitive 24): BuildLocalSchemaViewStateMachine::step has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 5 (9 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":3806}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ac8876602a34e29742f5caf73e1d7f285720d687f0d51bdbdcf584203eb19e"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::tablebtree_move_inner (cognitive 24): BTreeCursor::tablebtree_move_inner has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (8 pts), loops 1 (nesting depth added 10). Of this number, 14 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68d3881c19d5a787cd46f53d9e91904b010abe4edfe58c5d375cbc42712ab95"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::btree::compute_free_space (cognitive 24): turso_core::storage::btree::compute_free_space has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (22 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":"core/storage/btree.rs"},"region":{"startLine":10433}}}],"partialFingerprints":{"codehealthFindingId/v1":"3676b6d22062da1b8b1ff15ac6cfbd2cc31a6cecad58e6a003da38e212555a7f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::select::prune_join_order_for_materialized_inputs (cognitive 24): turso_core::translate::emitter::select::prune_join_order_for_materialized_inputs has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4, 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":"core/translate/emitter/select.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c2e00ada19a723c5f48f541db80ffef2b0231cb9153102442140c8f1616d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::enforce_indexed_by_hints (cognitive 24): turso_core::translate::optimizer::enforce_indexed_by_hints has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":2375}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad886e343e65d1942572bd1a3a5b3ead0125e94c5d1b8ca98349f090094ae59"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::lift_common_subexpressions::rewrite_or_terms (cognitive 24): turso_core::translate::optimizer::lift_common_subexpressions::rewrite_or_terms has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (11 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":"core/translate/optimizer/lift_common_subexpressions.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"df3af2a8384457b8aadd17369f39f1e6cf87e06f33401f54a605f9f7fca08aa4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::result_row::emit_select_result (cognitive 24): turso_core::translate::result_row::emit_select_result has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 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":"core/translate/result_row.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a864379ae80d0152c409a1aae13aa0b50e6b2cc94b79b8d32f37b9fa915e1c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::trigger::translate_create_trigger (cognitive 24): turso_core::translate::trigger::translate_create_trigger has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/trigger.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3ecf65fa9ad9ddc978bfe1eccdd2976054c14e602fb5ebde1e26adc71e26af"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::values::emit_values_to_index (cognitive 24): turso_core::translate::values::emit_values_to_index has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (8 pts), boolean chains 2, 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":"core/translate/values.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ace513d7118ef3ca41a1c635cd6e8a7c7781926776a27051dbeaa5e5d1b8def"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_sequence_compute_next (cognitive 24): turso_core::vdbe::execute::op_sequence_compute_next has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (21 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":"core/vdbe/execute.rs"},"region":{"startLine":14009}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8062f65b57523e89eaa802b7d05dff93c39acd7ce026b71ad186cf0e3a2f2f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_parse_schema_step (cognitive 24): turso_core::vdbe::execute::op_parse_schema_step has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":14794}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f812ba53473698bfa2d0f6ef6ef5c56693df9a2d3168a0a26a3eab5d5a5c54"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::functions::copy_without_null_fields (cognitive 24): turso_pg::functions::copy_without_null_fields has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 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":"postgres/frontend/functions.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"998ecca327e3c5123aa8682c86f6255fb21b4ca01f785de84bdc89ead74aeb89"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_parser::translator::try_extract_grant (cognitive 24): turso_pg_parser::translator::try_extract_grant has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 4 (6 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":"postgres/parser/translator.rs"},"region":{"startLine":8250}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a1448b3208fd16045c0a26b80b8d43f0dd22fb18dccfab5eeb9bcc4d943735"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::pull_updates_v1 (cognitive 24): turso_sync_engine::database_sync_operations::pull_updates_v1 has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (5 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2673175202ac98078383f4f299f1c240234c276deb1bb070ec004d4daf0914"}},{"ruleId":"D2","level":"warning","message":{"text":"FtsWorkloadProfile::generate (cognitive 24): FtsWorkloadProfile::generate has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (18 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":"testing/concurrent-simulator/fts.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f75e08f9bcd713da9d95af434e2cc66c1de9205c9f0c5913bd0e14c173493dd"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_whopper::run_inprocess (cognitive 24): turso_whopper::run_inprocess has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (19 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":"testing/concurrent-simulator/main.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"287f37511cad36c12b22537cb7e199e6672c803c269d39a29ef51ba3e1ceeec6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_whopper::worker::run_worker (cognitive 24): turso_whopper::worker::run_worker has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 5 (8 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e50af41bb97df4d9ac34ee01bb47105da30cfd0621cf3e54baeea7c1a69e60f"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::tcl_converter::parser::extract_tests_from_block (cognitive 24): sqltest::tcl_converter::parser::extract_tests_from_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (15 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":"testing/sqltest/src/tcl_converter/parser.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03d76c7cb83962041b6c2f76ec3760c883ff4a2cb4ea4855dec1dd90ea33efa"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoMcpServer::open_database (cognitive 23): TursoMcpServer::open_database has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (10 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/mcp_server.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c92270c2c9c89a973e66736190802043b6d7c26ad9622a4023e5e6cb4f46ff0"}},{"ruleId":"D2","level":"warning","message":{"text":"Database::open_async (cognitive 23): Database::open_async has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e6d71c82da0349326a54fa62d670b0259cd9d788a634d3a1ad198f78100f7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::serialize_int5 (cognitive 23): Jsonb::serialize_int5 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc8d9648d83d1836461ea43c986aa7a566e630371fe0105a38c7b6b21c52e75"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::deserialize_obj (cognitive 23): Jsonb::deserialize_obj has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":1651}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb9038f68f29851e7b8de45457a58cb6811f812f78a37510a5b4b6ca0e37861"}},{"ruleId":"D2","level":"warning","message":{"text":"MvccLazyCursor::current_row (cognitive 23): MvccLazyCursor::current_row has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edbd4b97e7ea5351b4befb826dec273f5ea78651a30d10f9f34b8f5434ee163"}},{"ruleId":"D2","level":"warning","message":{"text":"MvccLazyCursor::exists (cognitive 23): MvccLazyCursor::exists has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 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":"core/mvcc/cursor.rs"},"region":{"startLine":2069}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f12cb072c1d2ad95fa5475ead2d61eb2f2ebee46de8a24d3b374f59eb8547e"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteRowStateMachine::step (cognitive 23): WriteRowStateMachine::step has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (11 pts), if/else 5 (9 pts), boolean chains 3 (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":"core/mvcc/database/mod.rs"},"region":{"startLine":3783}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbad36b86b707f09a7751c1c8d6fc646a3300adea8ef26a793bd36781c384d3"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingLogicalLogReader::read_more_data (cognitive 23): StreamingLogicalLogReader::read_more_data has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3618}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa78bd9389eca9045eaedb20692079ee1d647ee09d9274c166fb5cfd4bb95ad"}},{"ruleId":"D2","level":"warning","message":{"text":"MappedSharedWalCoordination::release_owned_locks_on_drop (cognitive 23): MappedSharedWalCoordination::release_owned_locks_on_drop has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (22 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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d36a0aa56a7a6eed6982838562c5fa5e59c93cf55290eff35dcb135b8b4595"}},{"ruleId":"D2","level":"warning","message":{"text":"ShmWalCoordination::try_begin_read_tx (cognitive 23): ShmWalCoordination::try_begin_read_tx has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, 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":"core/storage/wal.rs"},"region":{"startLine":2109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a012a7624e5ecba9462e1000cfcba018bef0fc986fe3d849cd3bab4e6b559b"}},{"ruleId":"D2","level":"warning","message":{"text":"EmitOrderBy::init (cognitive 23): EmitOrderBy::init 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":"core/translate/order_by.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7d6acfefe048df6028b032f820b943d5dd85ed0a524aae72e7cd4129b4ed8c"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::insert_distinct (cognitive 23): HashTable::insert_distinct has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 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":"core/vdbe/hash_table.rs"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f018a2d034f1148e42f33489ee2e67c15b73fc5d45fbb99273053d1e8afc46"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::explain_step (cognitive 23): Program::explain_step has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (22 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":"core/vdbe/mod.rs"},"region":{"startLine":2357}}}],"partialFingerprints":{"codehealthFindingId/v1":"587cc5309afe874bcb7641cdf45068c281e907530ec34ac3c04221daf51e6204"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::printf::format_float_decimal (cognitive 23): turso_core::functions::printf::format_float_decimal has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/printf.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a22fee5c5e220c67278eb38b693b380fcd25fb190006644c942b7341b1477b6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::jsonb::validate_text_payload (cognitive 23): turso_core::json::jsonb::validate_text_payload has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, 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":"core/json/jsonb.rs"},"region":{"startLine":3819}}}],"partialFingerprints":{"codehealthFindingId/v1":"157606715225783ade80c8a8e02eae8a82bc8945fff7d5f02eba774875d2b885"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::sqlite3_ondisk::read_value_serial_type (cognitive 23): turso_core::storage::sqlite3_ondisk::read_value_serial_type has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 2 (3 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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2985a893c5ee2214e8866d3f3ce8beee57f27ad92f283644c181082ebeb674"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::plan_unmatched_right_rows (cognitive 23): turso_core::translate::optimizer::plan_unmatched_right_rows has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"245c0bcfdf90a1aef45437c8301b2ecef22782d024bb08333d858632faa88fb7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::multi_index::partition_residual_multi_or_exprs (cognitive 23): turso_core::translate::optimizer::multi_index::partition_residual_multi_or_exprs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (9 pts), match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f92a5e7c764259def96bef78973a50c0f2ceb549468ee2e1a8a4d9ff8b8f2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::multi_index::evaluate_multi_index_branches (cognitive 23): turso_core::translate::optimizer::multi_index::evaluate_multi_index_branches has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (10 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91a20554bfe340a96ab7c1a37864354fedd4a62e1374f1453982f7b914f88f0"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::roles::check_statement_privileges (cognitive 23): turso_core::translate::roles::check_statement_privileges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (3 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":"core/translate/roles.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbabf3b023f3cbf0637bba31a13feae80c64a5d61a5a7eb64e8a0355e1b86dd"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::trigger::check_one_select_refs (cognitive 23): turso_core::translate::trigger::check_one_select_refs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (10 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":"core/translate/trigger.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f81c853d56b68f3ed16b362d7cfef8d64e71daaa2aebc213680f6eda317f48"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::exprs_are_equivalent (cognitive 23): turso_core::util::exprs_are_equivalent has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 18, match/switch 3 (5 pts) (nesting depth added 2). 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":"core/util.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5127fc3018cc4713ac0caab2cfbfafd41bc3b824834728a247ecbc117245d75"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::visit_trigger_cmd (cognitive 23): turso_core::util::visit_trigger_cmd has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 1 (2 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":"core/util.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5cb77dbb8d8ea9efa01b8b040f5afbe364a8114b3559df3e04f3f71265b01f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::view_sources_from_clause (cognitive 23): turso_core::util::view_sources_from_clause has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde10a3eefe0f5b50e048a68ae66b797bcceb1e324defba7819532479decd69a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_yield (cognitive 23): turso_core::vdbe::execute::op_yield has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (4 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":11416}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b0858de846a17fec8d600e71d1dc648fefbea4bd8325655e6e95bbd4be4ecb"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::select::generate_select_columns (cognitive 23): sql_gen::generate::select::generate_select_columns has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, loops 1 (2 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":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54ec6079ba532293da7d833ee0ae2d9b4cd63dfaf3171f6f791275074facaed"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractionPlan::generate_next_interaction (cognitive 23): InteractionPlan::generate_next_interaction has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 5 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/plan.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"78053d4679136ef4253f9bbb6b2961f5c2e5fdbbcd2dfd24eb60f26d20524c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"JsDatabaseInstance::run_sql (cognitive 23): JsDatabaseInstance::run_sql has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6 (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":"testing/sqltest/src/backends/js.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3722bed4c7fc4747c57b6e9dd8c71538149a662a2f5161b0086e314364f99f47"}},{"ruleId":"D2","level":"warning","message":{"text":"TestRunner::run_loaded_tests (cognitive 23): TestRunner::run_loaded_tests has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (15 pts), boolean chains 3, if/else 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7431bac6cd0896428788eb190b80b9c67ac33f7b99da68e5ebeee1b3ae4c0664"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::parser::lexer::extract_block_content (cognitive 23): sqltest::parser::lexer::extract_block_content has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/parser/lexer.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b82ff8683c6f62f91e4977bd1caf4fb298e6918963789e44cbc1007032d2144"}},{"ruleId":"D2","level":"warning","message":{"text":"Limbo::print_schema_entry (cognitive 22): Limbo::print_schema_entry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (22 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":"cli/app.rs"},"region":{"startLine":1447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8f2acf37e1d302d8bdb183b8929ceb82b1d06b0549d59884d38563b7e854e9"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoSyncServer::handle_connection (cognitive 22): TursoSyncServer::handle_connection has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 4 (5 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":"cli/sync_server.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"280dec97a9cfcfcff3e188ee4c5a33acb4f2ad98587e52a88e14ae54db5c2a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoSyncServer::handle_page_pull_updates (cognitive 22): TursoSyncServer::handle_page_pull_updates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 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":"cli/sync_server.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"c034abbcc6df6ffc3478b7719f4933a75f079d75735805bab395bf4c84d79f43"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::load_sequence_descriptors_via_sql_nonblock (cognitive 22): Connection::load_sequence_descriptors_via_sql_nonblock has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (16 pts), loops 2 (4 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":"core/connection.rs"},"region":{"startLine":4116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a372fea3115c6d2cae5d565bb2632cf43f21c35f56d7f0e04223ee1534223f"}},{"ruleId":"D2","level":"warning","message":{"text":"RowDeleter::step (cognitive 22): RowDeleter::step has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/fts/rows.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"a175e163129c837c9afb7d3d23b091062bd0685ad97bdf664b73d504091051ce"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::json_string_to_db_type (cognitive 22): turso_core::json::json_string_to_db_type has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 3 (6 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":"core/json/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"422e17b85b336cf16263d6fadca2b16c265bf9bd817ff5990d296b5d76e8fb37"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::btree::find_free_slot (cognitive 22): turso_core::storage::btree::find_free_slot has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":9288}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7886398601104e6a26cadb3ee218160087e079e1a13c5ea7ac4ab8b4ee61d30"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::sqlite3_ondisk::write_pages_vectored (cognitive 22): turso_core::storage::sqlite3_ondisk::write_pages_vectored has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b292d0ead7b504d327b47a92b633391f5c77444b65d1e0f01cdee5908f8456"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::wal::classify_authority_snapshot_against_wal (cognitive 22): turso_core::storage::wal::classify_authority_snapshot_against_wal has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 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":"core/storage/wal.rs"},"region":{"startLine":5747}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e594dbbb53c865e8c29544b335c4ecc206f46b0414e45e3901bd1d1900d1fa"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::emit_column_constraints_validation (cognitive 22): turso_core::translate::alter::emit_column_constraints_validation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"core/translate/alter.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"9958068f108da1fb641e9b015f5a624287621f88c6ca39ad48b8de02cc1d5bda"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::alter::validate_select_column_refs_after_drop (cognitive 22): turso_core::translate::alter::validate_select_column_refs_after_drop has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 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":"core/translate/alter.rs"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"3009d3f38881426bbd3363bae1f8e124824e7dddb6e8a3a6098c160edf23def4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::main_loop::seek::encode_seek_keys_for_custom_types (cognitive 22): turso_core::translate::main_loop::seek::encode_seek_keys_for_custom_types has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/seek.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f52afe44851638f330eb0b1b497a57aec5fd040fa4b7ffff3c38162d74eebc"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::plan_index_method_predicate (cognitive 22): turso_core::translate::optimizer::plan_index_method_predicate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1111d4ebf90bd3412a782162d0a1bf832ca2efd4cbd6e6512c54277c30582ced"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::access_method::find_best_access_method_for_subquery (cognitive 22): turso_core::translate::optimizer::access_method::find_best_access_method_for_subquery has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 5, 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbbbce654f84bf776130e78a22a794f370613b8daeb215854aa77e6f5c5b6046"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::replace_subquery_value (cognitive 22): turso_core::translate::optimizer::unnest::replace_subquery_value has cognitive complexity 22 (threshold 15). Drivers by points: loops 9 (14 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":"core/translate/optimizer/unnest.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f64de3033840acd1f5e1428048afa8d52387f9470e968f67cbd15b9619a6173d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::table_mask_from_expr (cognitive 22): turso_core::translate::planner::table_mask_from_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (6 pts), match/switch 2 (3 pts) (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":"core/translate/planner.rs"},"region":{"startLine":2884}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafa82d87c875068f42d5b99f49b369a2419ec8b1bc1c88dfafe3e3246e6330d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::upsert::collect_set_clauses_for_upsert (cognitive 22): turso_core::translate::upsert::collect_set_clauses_for_upsert has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (9 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":"core/translate/upsert.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc45c6cef80da84804d1f028ce5e250a642c26376261e21b2e5b39cb3397357"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::try_capture_parameters (cognitive 22): turso_core::util::try_capture_parameters has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"3806b1dbf2f9e9ccf4b8a95a966b24f3ff785eeb481dc6f41d2a54e3df391eaa"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::affinity::create_result_from_significand (cognitive 22): turso_core::vdbe::affinity::create_result_from_significand has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 6, match/switch 2 (3 pts), 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":"core/vdbe/affinity.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"14e59954b678606b16948a3755be0a24066015a05d9b5dd8e285ecf4745d2adc"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_open_read (cognitive 22): turso_core::vdbe::execute::op_open_read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 4 (6 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":"core/vdbe/execute.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8c099cc036c66a70ea7e24bead6e67b07f0d8d29f87dc2082d7827c8863e57"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_idx_delete (cognitive 22): turso_core::vdbe::execute::op_idx_delete has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (5 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":"core/vdbe/execute.rs"},"region":{"startLine":12300}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cae028b1b5add5f503ac7ebbb49ddd39d03a2884ae271c769bb4d97483f3cf6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::drive_init_cdc_version (cognitive 22): turso_core::vdbe::execute::drive_init_cdc_version has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 3 (9 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":15055}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc5edb052a41804eb86bea402d222f8a299b31595d1c1f70e10f402a8e711fb"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::sorter::normalized_first_key (cognitive 22): turso_core::vdbe::sorter::normalized_first_key has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 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":"core/vdbe/sorter.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb6b401cf75afb6b1aabfa8ca21b4b909286af42670f3e9fecf836ad0e0b4fc"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_fuzzy::jaro (cognitive 22): limbo_fuzzy::jaro has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 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":"extensions/fuzzy/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"343b2ef4878f7b16a97dbad3e48163777ed55dd39111c2cf8801747318a2c338"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::skip_whitespace_and_comments (cognitive 22): Lexer::skip_whitespace_and_comments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts), boolean chains 4, 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":"postgres/parser/lexer.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c985048ee9feafc28df6a0379b9f53217005d93bdf6257058440ffef81f96e"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_select_statement (cognitive 22): Parser::parse_select_statement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21 (22 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f929625890c90647bec913ac6a4bb14b850b02d729107c2877366a187294bbcf"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::has_distinct_output_names (cognitive 22): PostgreSQLTranslator::has_distinct_output_names has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 1 (3 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":"postgres/parser/translator.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1402adb56790843ba14f3220aa9eaaf12809b6ec243c00596937ffe2f4f07171"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_parser::translator::deparse_default_expr (cognitive 22): turso_pg_parser::translator::deparse_default_expr has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 5 (9 pts) (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":"postgres/parser/translator.rs"},"region":{"startLine":8711}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7c80580ac82239751ffdc0f3093edd7f2e68c6b25817fac795016190127edf"}},{"ruleId":"D2","level":"warning","message":{"text":"Table::arbitrary_with_columns (cognitive 22): Table::arbitrary_with_columns has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 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":"sql_generation/generation/table.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6a7518ce0dd9d355ad1d24a5dfaf2bc5198f32b56cdf06d682dcc2bf1433a9"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_generation::generation::query::gen_insert_upsert_values (cognitive 22): sql_generation::generation::query::gen_insert_upsert_values has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 8, 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":"sql_generation/generation/query.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"699d989e0e37db6ee4d0e77ea4104f9b6ccc520c948b2baedb4995f7f69a4c4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_joined_tables (cognitive 22): Parser::parse_joined_tables has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 7 (21 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"1431f604d79d3dc3e0549bc823bfefa8e06cf3b60e1d58a3b473be5a7bd3d8f1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sync_engine::database_sync_operations::replay_logical_transactions_from_file (cognitive 22): turso_sync_engine::database_sync_operations::replay_logical_transactions_from_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (12 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c25959693fb16bccbc490f72f49bc92d96beed2efdce16513713cfd1afff94b"}},{"ruleId":"D2","level":"warning","message":{"text":"Whopper::maybe_probe_checkpoint_on_suspended_statement (cognitive 22): Whopper::maybe_probe_checkpoint_on_suspended_statement has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c5e00d9c37e7b419cbd21e7de8cf1e734d6f742f6bd3ecf9192c7957618e5f"}},{"ruleId":"D2","level":"warning","message":{"text":"SequenceCorrectnessProperty::on_restart (cognitive 22): SequenceCorrectnessProperty::on_restart has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, 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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"766b58a5ae29376186518149be58bfb74ed9121912faf1473ea6ecb950e38e71"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::stmt::collect_capability_allowed_stmts (cognitive 22): sql_gen::generate::stmt::collect_capability_allowed_stmts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22. 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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b5a172c3b2d8ba8242ea0b95c6f6aacd02f230107c4db5ced39b1ad65f6c43"}},{"ruleId":"D2","level":"warning","message":{"text":"JDBC4DatabaseMetaData.getTables (cognitive 22): JDBC4DatabaseMetaData.getTables has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 4, 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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4DatabaseMetaData.java"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"4466188d831dda2d169986d60e795889575058e61c88853c6f7b4556a1ca5ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"lib._first_keyword (cognitive 22): lib._first_keyword has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, loops 4 (8 pts), if/else 3 (6 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":"bindings/python/turso/lib.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e92bfbbe5f329f316304da13d19a8f788626cae4ca10c5573c36d5fbe6d844e5"}},{"ruleId":"D2","level":"warning","message":{"text":"release-status.main (cognitive 22): release-status.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12, loops 2 (4 pts), ternaries 4, boolean chains 2 (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":"scripts/release-status.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"09418ec8db81fee7e14c045c824b086c561a9cc852619f0180c0201cbecfe96e"}},{"ruleId":"D2","level":"warning","message":{"text":"dbapi._first_keyword (cognitive 22): dbapi._first_keyword has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 8, loops 4 (8 pts), if/else 3 (6 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":"serverless/python/turso_serverless/dbapi.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09c5db9e4498d0e37a9bcf9500e6aaa631c1f9fa2dbca86394d8bf6af1ab87a"}},{"ruleId":"D2","level":"warning","message":{"text":"ioProcessor.processHttpRequest (cognitive 22): ioProcessor.processHttpRequest has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 8 (9 pts), boolean chains 2, error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/internal/ioProcessor.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbe115b9282ba7006ef2c9132c18bbce9a484169c608eb82d1a520cc9828fd4"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteBatch.BuildBatch (cognitive 21): SqliteBatch.BuildBatch has cognitive complexity 21 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2f0f24af933ed83964f5f1ee45562feb4b80db52744dfed1eb950411a669ec"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteCommand.AddManagedParameters (cognitive 21): SqliteCommand.AddManagedParameters has cognitive complexity 21 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22b711cdea0d966262964cf7d70629848983ea51b6494d6d2d201d05c0bbf2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteConnection.TryReadIdentifier (cognitive 21): SqliteConnection.TryReadIdentifier has cognitive complexity 21 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"362a4fcd2ab607380029cd9876ca3113518daf6c08034ca2e9b66fde17a2a661"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoCommand.PrepareCore (cognitive 21): TursoCommand.PrepareCore has cognitive complexity 21 (threshold 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":"bindings/dotnet/src/Turso.Data/TursoCommand.cs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c53af328b4c61586b8ace36c1062837b8ae88ecaa1272815f441a4bfeb8bba"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::rollback_tx_inner (cognitive 21): MvStore::rollback_tx_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4, 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":"core/mvcc/database/mod.rs"},"region":{"startLine":7144}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bc1a98f751374ada860025dfa9b9dee5ba564c88f4f3d2877df238ce066c84"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::gc_incremental (cognitive 21): MvStore::gc_incremental has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":8203}}}],"partialFingerprints":{"codehealthFindingId/v1":"548dfdf5d4fe525551c45e2eac79b7f963cad4058218e6b3c96f18349a384160"}},{"ruleId":"D2","level":"warning","message":{"text":"Pager::commit_tx (cognitive 21): Pager::commit_tx has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":3411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9701c87a0bdcebd53371a14f439dd0021c8a20943843dcf640f77017ec2d8477"}},{"ruleId":"D2","level":"warning","message":{"text":"EmitOrderBy::emit (cognitive 21): EmitOrderBy::emit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 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":"core/translate/order_by.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"d806d2dc9fb46d82bd690a655ffeeb1440518527f2501396369834c4700d0fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"ResultSetColumn::name (cognitive 21): ResultSetColumn::name has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/plan.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a9efb921353ae6eb33f089ebfdce7a387992737548504fff5a0054ffd237e7"}},{"ruleId":"D2","level":"warning","message":{"text":"JoinedTable::apply_expression_index_coverage (cognitive 21): JoinedTable::apply_expression_index_coverage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/plan.rs"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"771a9b9d69b86b67f4be417e2217447befb5383e1ebf8a3310c05ec5b33f1985"}},{"ruleId":"D2","level":"warning","message":{"text":"EmitWindow::init (cognitive 21): EmitWindow::init has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 3, loops 2, match/switch 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":"core/translate/window.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5335d88238a3a03514c2b92644035dde5f803bf109517f56d894eca61f090f28"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgramBuilder::emit_constant_insns (cognitive 21): ProgramBuilder::emit_constant_insns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5 (7 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":"core/vdbe/builder.rs"},"region":{"startLine":1694}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b70d784b79922a580f28d90e57d91244a01e7bedef1c930c6db5a22d0410ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"Vector::from_data_with_dims (cognitive 21): Vector::from_data_with_dims has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 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":"core/vector/vector_types.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bbf86e66b5680f080f8f2efdef09d10e0d3b5639ad4199689d29d1e20dbda8"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::datetime::parse_yyyy_mm_dd (cognitive 21): turso_core::functions::datetime::parse_yyyy_mm_dd has cognitive complexity 21 (threshold 15). Drivers by points: if/else 18 (19 pts), boolean chains 1, 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":"core/functions/datetime.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"154e61a4fdb02976b6ec0a8b92a8a9300889a42a39a597c89c9d0b66a1795d7e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::datetime::parse_hh_mm_ss (cognitive 21): turso_core::functions::datetime::parse_hh_mm_ss has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a35c50171c29c49df53ef2a36c3bf8300a6d9c0fee95ce89c7de30948912c52"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::printf::exec_printf_values (cognitive 21): turso_core::functions::printf::exec_printf_values has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 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":"core/functions/printf.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7149636777b31f9f173b7254a7ee3295e32d59f5a8ed3f467c73f4d6962209"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::validate_stream_expr (cognitive 21): turso_core::incremental::vdbe_maintenance::plan::validate_stream_expr has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde9ecc9328d266a26a37ca1ae6b5f499e13d195c3745b2c1f0f3c6730bec6cf"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::binary::emit_binary_condition_insn (cognitive 21): turso_core::translate::expr::binary::emit_binary_condition_insn has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binary.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e87e939275a5bb2783ee6fc8cfd9e81a85846c63cca40332dbd2429b980d80"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::main_loop::multi_index::emit_multi_index_scan_loop (cognitive 21): turso_core::translate::main_loop::multi_index::emit_multi_index_scan_loop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"core/translate/main_loop/multi_index.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5e7794765b73cfbab261260f4c8f85466463fb3a72ceca3fcce3baf70603a5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::join::count_subquery_calls_for_plan (cognitive 21): turso_core::translate::optimizer::join::count_subquery_calls_for_plan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (14 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":"core/translate/optimizer/join.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6388c9a640effe38beaac1745071f1ee400f555c6a9de1d8a824a238ed628c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::find_direct_aggregate_comparison (cognitive 21): turso_core::translate::optimizer::unnest::find_direct_aggregate_comparison has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, 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":"core/translate/optimizer/unnest.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9284a4eb1cc23aafb61287dbd3b57e8a027a6cafddcdce100220e53df5dab54"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::window::emit_window_full_scan (cognitive 21): turso_core::translate::window::emit_window_full_scan has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (5 pts), boolean chains 2, 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":"core/translate/window.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5799215622b3425a5715e2314ed4c7037970b62556e8db3bc0d93af82f7e6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::window::emit_window_range_test (cognitive 21): turso_core::translate::window::emit_window_range_test has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3, match/switch 2 (3 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":"core/translate/window.rs"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e731f8b0d9f06d9b906399403d658525e04c34efdbaef1773dd8ad94aa9db3"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_no_conflict (cognitive 21): turso_core::vdbe::execute::op_no_conflict has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":12962}}}],"partialFingerprints":{"codehealthFindingId/v1":"359dfb8c4f2cb358a087c91050df723e69decb69e1d36666f5fc7d7b594ac35a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_clear_btree_inner (cognitive 21): turso_core::vdbe::execute::op_clear_btree_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (5 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":"core/vdbe/execute.rs"},"region":{"startLine":13632}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cef5e984147e43eab3db424f73fed1612b910b12c07c4b4c33037de3b72f575"}},{"ruleId":"D2","level":"warning","message":{"text":"PgConstraintTable::load_rows (cognitive 21): PgConstraintTable::load_rows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/catalog.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f124a4eb5b665ec3ef0d58653a0047fe880b8f12e87e3f287aba1a5c736dfa3"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::copy::unescape_copy_field (cognitive 21): turso_pg::copy::unescape_copy_field has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (12 pts), loops 3 (7 pts), if/else 1 (2 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":"postgres/frontend/copy.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"0445d9c5391d8f0a68e9ee793627c78bb2b9872d65e5b4840c4c57365872c286"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_insert (cognitive 21): PostgreSQLTranslator::translate_insert has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da419d3bb3566f54fe89f6bbed188ef12440116dbb7ab70661fc6c42428af8d"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_frame_options (cognitive 21): PostgreSQLTranslator::translate_frame_options has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20 (21 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":4536}}}],"partialFingerprints":{"codehealthFindingId/v1":"175bbcb0cbaf0749eddb894f02501930c534a9c97cf4413e727b6a94569180b4"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_order_by (cognitive 21): PostgreSQLTranslator::translate_order_by has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 5 (16 pts), if/else 2 (4 pts), loops 1 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":5246}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc33ec17085d50e4c61d1d508712ec1e62767e96849e67992ec2633f3447f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_create_domain (cognitive 21): PostgreSQLTranslator::translate_create_domain has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 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":"postgres/parser/translator.rs"},"region":{"startLine":5524}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b38fa8b4604d54432279ec896817d13ed63136914972bf6ed3526b9eb61be86"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_parser::copy::try_extract_copy_to_stdout (cognitive 21): turso_pg_parser::copy::try_extract_copy_to_stdout has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), 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":"postgres/parser/copy.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bea21c5c966c59b947ba6441d97c9189a5f56be1f5b76ad88dc4f556fa92a0c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_server::scalar_pg_type_to_array_type (cognitive 21): turso_pg_server::scalar_pg_type_to_array_type has cognitive complexity 21 (threshold 15). Drivers by points: if/else 20, 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":"postgres/server/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"60333133a384f09b8e645bcadbb75099871dc0be5a2888d78f17d7933f4aac1b"}},{"ruleId":"D2","level":"warning","message":{"text":"GTValue::arbitrary_from (cognitive 21): GTValue::arbitrary_from has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/generation/value/cmp.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fa5752a03ad7483df40166ddb1028b489ba174a4cb098553787ec3eb37b6e4"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_generation::generation::value::cmp::mutate_string (cognitive 21): sql_generation::generation::value::cmp::mutate_string has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2, loops 2, 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":"sql_generation/generation/value/cmp.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfdf1336f1ed30265e64f8ab109e2aa0216bc90e2492dbe525abf30fcb3fb477"}},{"ruleId":"D2","level":"warning","message":{"text":"TriggerCmd::to_tokens (cognitive 21): TriggerCmd::to_tokens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (20 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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"038aed740197e6500385d47b4e8fac540912744e7fa06723c122ceae75ae47e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_expr_inner (cognitive 21): Parser::parse_expr_inner has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (4 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":2194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1465598ae8303b543cb0987e03ed1ea2ac407be6690c38c3011bec644ce3059"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::runner::differential::execute_interactions (cognitive 21): limbo_sim::runner::differential::execute_interactions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 pts), match/switch 2 (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":"testing/simulator/runner/differential.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"677e4d9339f790e9aee8d32e4133a2f296025e3467ccf9d25147498c231c07c7"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::runner::doublecheck::execute_plans (cognitive 21): limbo_sim::runner::doublecheck::execute_plans has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 pts), match/switch 2 (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":"testing/simulator/runner/doublecheck.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3fa405eb46ca9983ed67b3e3174d75fd3c6d46e843badfde5531805d3aecec5"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::snapshot::format_explain_query_plan_output (cognitive 21): sqltest::snapshot::format_explain_query_plan_output has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (4 pts) (nesting depth added 7). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to one function item inside it that branches (format_node). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":960}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe51a2d4b0c5335bc6842bd62a5aec92242c8eef0989231e90cd399f93e5d6d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sqlite3::sqlite3_get_table (cognitive 20): turso_sqlite3::sqlite3_get_table has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1, 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":"bindings/c/src/lib.rs"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9c5fea4049c4b494678874972f828c9b1469d2efb3f3b08b7bd88c832e8323"}},{"ruleId":"D2","level":"warning","message":{"text":"Limbo::run_query (cognitive 20): Limbo::run_query has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/app.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff65adae36a165955d692f4e2cc58edf4570023cc69f170f0e7054c45f50e18"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::merge_patch_at (cognitive 20): Jsonb::merge_patch_at has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":3235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3928b4e39873c849353d79965110ae2ca437465c1caa98ce2f6728e1cd89ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::container_property_iterator (cognitive 20): Jsonb::container_property_iterator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (5 pts), boolean chains 3 (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":"core/json/jsonb.rs"},"region":{"startLine":3441}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a683f838c8e88c33e31f01950f69064a1ca0ca8c461678578297afa69fc86"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonEachCursor::advance (cognitive 20): JsonEachCursor::advance has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/vtab.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4cb8a18973575d7aeab3b128fabeb95cd55350e0356842d59dee233581b999"}},{"ruleId":"D2","level":"warning","message":{"text":"MvccLazyCursor::_advance_btree_backward (cognitive 20): MvccLazyCursor::_advance_btree_backward has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"291e934e24e7732046bb9703ef69fbc70d6b482c579332af58e83d321c2ec462"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingLogicalLogReader::parse_frame_header (cognitive 20): StreamingLogicalLogReader::parse_frame_header has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a030dae00cfc224f511e11796365d9a069edb020d517b550ac141b009bf8f51"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::update_value_types (cognitive 20): Schema::update_value_types has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":2474}}}],"partialFingerprints":{"codehealthFindingId/v1":"41698a5d5e3b2e515505f7c8179d55a4345fe08dd2bb5e6f3144b48117fd567a"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::materialized_view_maintenance_order (cognitive 20): Schema::materialized_view_maintenance_order has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 5 (7 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":"core/schema.rs"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38febadc6ddcee4b90710a3466ad37d0481aeb0aeae2d3e8109512eb72a5d3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::resolve_fk (cognitive 20): Schema::resolve_fk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, loops 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":4679}}}],"partialFingerprints":{"codehealthFindingId/v1":"1160cb8d913ae233b13e727bff3af70a6c671027d3f113d472650a1a32d06bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"Index::validate_where_expr (cognitive 20): Index::validate_where_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 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":"core/schema.rs"},"region":{"startLine":8993}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3351664e1d4cc9571770bc40085b9bee7b8f39f710e531994cabb3adc5beff"}},{"ruleId":"D2","level":"warning","message":{"text":"Pager::ptrmap_get (cognitive 20): Pager::ptrmap_get has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (5 pts), boolean chains 2, 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":"core/storage/pager.rs"},"region":{"startLine":2733}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca010c8d32f0e9a94340f1e98abfc1d8743d5b8ca99e2ab781843b9d4a93bcb"}},{"ruleId":"D2","level":"warning","message":{"text":"InProcessWalCoordination::try_begin_read_tx (cognitive 20): InProcessWalCoordination::try_begin_read_tx has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, 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":"core/storage/wal.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe61725aa4ba892b3b957d1f952da197d4265d9041b1319a89a9c2410d3c8f9"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::next_match (cognitive 20): HashTable::next_match has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 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":"core/vdbe/hash_table.rs"},"region":{"startLine":2129}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e70ca2d1bcf39629847d7f77b94edd137558985efb1376ac94093f0ed7b4d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::commit_txn (cognitive 20): Program::commit_txn has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb572aab853e448b8d6a4103c99fc88c9a3834aca7228b644b6daf6468c1580a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::arrangement::emit_output_arrangement (cognitive 20): turso_core::incremental::vdbe_maintenance::arrangement::emit_output_arrangement has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 4, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a89b0ce6d4525da1e47d023f7b4a932748357a87d70a679fb41f54b7073c81a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::stats::refresh_analyze_stats_nonblock (cognitive 20): turso_core::stats::refresh_analyze_stats_nonblock has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/stats.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6b69b4598152bde39b227f2ff95e1ef9dd3f87ea6744b94a3bb414769aa820"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::compound_select::emit_compound_order_by (cognitive 20): turso_core::translate::compound_select::emit_compound_order_by has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 4, match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/compound_select.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4ed6426b6ed057eb87cc37bb95908bfc96d29e89364be9914723a6ca1889a9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::init_limit (cognitive 20): turso_core::translate::emitter::init_limit has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 6 (8 pts), boolean chains 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":1897}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37211c6161b4f9f8d1e98367281231bfade1f6b2047347e6e954244a2c4b4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::delete::emit_delete_insns_when_triggers_present (cognitive 20): turso_core::translate::emitter::delete::emit_delete_insns_when_triggers_present has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 3 (8 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":"core/translate/emitter/delete.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76ce0263c483f882b609b8b3c5889eff7e674dde0f469e604458ca53a91ccc9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::index::translate_drop_index (cognitive 20): turso_core::translate::index::translate_drop_index has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/index.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ec3c6ae43e881b132c3c7f2f247acb2e245038cfd0935395779e3c89a18713"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::order::finalized_scan_subquery_order_consumed (cognitive 20): turso_core::translate::optimizer::order::finalized_scan_subquery_order_consumed has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3, 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":"core/translate/optimizer/order.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2586c69efc68328b5ec2aa5a9c28b41b9cffebd0ea8900fc9b18ef90c861039b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::recursive_cte::emit_recursive_cte (cognitive 20): turso_core::translate::recursive_cte::emit_recursive_cte has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (6 pts), match/switch 2 (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":"core/translate/recursive_cte.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f62765a8fe212034b6faed13e9a9d593041abbbd7d9321e698435ee3a7baa9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::simple_bind_expr (cognitive 20): turso_core::util::simple_bind_expr has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (2 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":"core/util.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc9f2d0df52af889bfad023ec7ed73bad4822e23d847b5b9e800580d4968304"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::decode_percent (cognitive 20): turso_core::util::decode_percent has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 2 (3 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":"core/util.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"04956a0616a1b1394d53a05e54faa0c50e02774a661af65b264adec6a0c6ea98"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::parse_numeric_str (cognitive 20): turso_core::util::parse_numeric_str has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":1347}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1d99e3aa5c7eca674449e04bc277388ff641acb1da7731345a19d8009b71c8"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::affinity::apply_numeric_affinity (cognitive 20): turso_core::vdbe::affinity::apply_numeric_affinity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 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":"core/vdbe/affinity.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"2129be2a7192404235c55131f36959128b5100ce6ffc42c579f46c2724711ee9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_checkpoint (cognitive 20): turso_core::vdbe::execute::op_checkpoint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"abdc8f944bd8f234bba0e5123d4c86f95944f58e627339f8f78f9065d1a418b7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_agg_step_slow (cognitive 20): turso_core::vdbe::execute::op_agg_step_slow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 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":"core/vdbe/execute.rs"},"region":{"startLine":9372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3af865985bfe18551046b646827c018768261c69c0e5396a5b38594edc4ac97"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_dump_fuzzer::generation::access_control::access_control (cognitive 20): turso_pg_dump_fuzzer::generation::access_control::access_control has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6 (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":"postgres/dump-fuzzer/src/generation/access_control.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f8ce17dfb6d553606224d3f5704857ddf696ad5d245ed3a8f84a3d29471df4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::session::grant_commands (cognitive 20): turso_pg::session::grant_commands has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 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":"postgres/frontend/session.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f65b7f4e00cdc5bd9d77c5dd89df04c33f3c11ef5260d79c4b1f783bff1015"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_order_by_list (cognitive 20): Parser::parse_order_by_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 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":"postgres/parser/parser.rs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cea0de9cb8140e37dfcd9e54e699fa7e502f790243e7cf00d5d699504ba4ebe"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_alter_table (cognitive 20): PostgreSQLTranslator::translate_alter_table has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 7 (8 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9d2a0317d483780290c573efafe35b6fa5499190c7d61e788268970d8646af"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_select (cognitive 20): PostgreSQLTranslator::translate_select has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":2209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18a793b678d19707309ec70de58ca9a11015f5a5e5a9525d5d12f690e3fccdd"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoPgServer::serve (cognitive 20): TursoPgServer::serve has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (9 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":"postgres/server/lib.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d421d57e229b9aab8fe288c105d839a7c7ee802554db2d32ea1c5a6919adc6be"}},{"ruleId":"D2","level":"warning","message":{"text":"SimValue::apply_affinity (cognitive 20): SimValue::apply_affinity has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/model/table.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d892dd5d0061e9f2c36f1e6f65d1327af7b0abf228b40aeb2f7da8301847e750"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_type (cognitive 20): Parser::parse_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), match/switch 3 (6 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e1de645e9068213416791077a8f1c318068ad4acd6a0fcb50a0444fde56058"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_eid_list (cognitive 20): Parser::parse_eid_list has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":2644}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5aa0b49eef84521e108ce9e281496f4e13aff34200279477c4a5ececd4db33"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_create_domain (cognitive 20): Parser::parse_create_domain has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 4 (7 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":5165}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f48632b4dead01e1ffb85d3855c1b777656d0adb27c75dd7cb4c33229c68648"}},{"ruleId":"D2","level":"warning","message":{"text":"SimpleKeysDoNotDisappear::finish_op (cognitive 20): SimpleKeysDoNotDisappear::finish_op has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f4b296d121a1e1bf2694edc49559a5782ec3fe361ea25833960db4db520692"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowFunctionExpr::fmt (cognitive 20): WindowFunctionExpr::fmt has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4b4b42d8a75248656a3a84f8dfceee74bea66408223aafeeec1ba862afb862"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::stmt::generate_update (cognitive 20): sql_gen::generate::stmt::generate_update has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"f919a5431094afcbc45da1d5bbbb46d4ce01487c882c0bf95e8d1c171949a6ba"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::generation::property::run_integrity_check (cognitive 20): limbo_sim::generation::property::run_integrity_check has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (7 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":"testing/simulator/generation/property.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"caabf39dae36ef856605cc44c92902f86da0e2ea689955744dfc879f981dd8b2"}},{"ruleId":"D2","level":"warning","message":{"text":"turso.bindArgs (cognitive 20): turso.bindArgs has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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":"bindings/go/driver_db.go"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4b5e6c2c626582eaf36fbb69d425ce215590266fbd785d58fcfe12f2757cba"}},{"ruleId":"D2","level":"warning","message":{"text":"protocol.encodeValue (cognitive 20): protocol.encodeValue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, ternaries 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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"c909437014a94c36b56e3b73d25d1ee6d3e9792651b0d722dccbc6590b6d2c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoSqliteRelationalConnection.InitializeTursoConnection (cognitive 19): TursoSqliteRelationalConnection.InitializeTursoConnection has cognitive complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 122, 132, 142, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteRelationalConnection.cs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a2a9e062482d52a252f8725adce4cb58e576a7416b553f2ce1e9d4b762a3d7"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::serialize_object (cognitive 19): Jsonb::serialize_object has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (6 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":"core/json/jsonb.rs"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5d4c419f7ab0caaa266c9626d35cf005099d4e938f9a21b6aed0fbe70df97f"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonVirtualTable::best_index (cognitive 19): JsonVirtualTable::best_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts), boolean chains 2, 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":"core/json/vtab.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f6845e8fe4e3c45f5fcf86b8d03763f255f0393b918911c2f6a0021572c090"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::gc_index_incremental (cognitive 19): MvStore::gc_index_incremental has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), match/switch 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":"core/mvcc/database/mod.rs"},"region":{"startLine":8348}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cda5c6b3003fcb0c6dab9d0b6b82e4ab8f52543ea5108276db7a667a984a02e"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema::order_persisted_materialized_views (cognitive 19): Schema::order_persisted_materialized_views has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 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":"core/schema.rs"},"region":{"startLine":3804}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca81be06d7e3dfa0633617d1078f93b118d2ec66374000677c391a72b3f65d81"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement::prepare_step (cognitive 19): Statement::prepare_step has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"1406b47af88c2df261db579e59e18cf0d5cf2356c533010dd057bd9c88f544f0"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::next (cognitive 19): BTreeCursor::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":6757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d244e0cf1c979adc3e1b6eee44e004134c56e7817654ce9745869f76df1b96ff"}},{"ruleId":"D2","level":"warning","message":{"text":"PageCache::_insert (cognitive 19): PageCache::_insert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 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":"core/storage/page_cache.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e83cb89d923374a392ba77a0da3fea6143c63cd2c2b2ad6d786c0a516c96a2"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildSharedWal::poll (cognitive 19): BuildSharedWal::poll 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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"4abec227e621542a51743071baf2182229b1f30938977c68879cb22613bd056d"}},{"ruleId":"D2","level":"warning","message":{"text":"Time::time_date (cognitive 19): Time::time_date has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 14 (19 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":"core/time/internal.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"26618326a58e2c612c7660c7762a88411497895381e6200698d4e67760582411"}},{"ruleId":"D2","level":"warning","message":{"text":"Sorter::insert (cognitive 19): Sorter::insert has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (16 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":"core/vdbe/sorter.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb99bffeb9c38e3d2fcf803d670970496cc3235d69e52df0c765fd2f2ef0207"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::printf::parse_format_spec (cognitive 19): turso_core::functions::printf::parse_format_spec 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":"core/functions/printf.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e312b810c1d5341e32784396b884d2b16c39ed68caee71ee7f07f0af9cf5465"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::printf::format_fixed_from_digits (cognitive 19): turso_core::functions::printf::format_fixed_from_digits has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/printf.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bb304dfcb5e86e995f69ce42b28b5468cffc3565430c3f566bde8f0efe8bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::join::emit_semi_or_anti_join (cognitive 19): turso_core::incremental::vdbe_maintenance::join::emit_semi_or_anti_join has cognitive complexity 19 (threshold 15). Drivers by points: loops 7, if/else 5 (6 pts), match/switch 4 (5 pts), boolean chains 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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"407141b1b38a0dacef0c1478413866d78a1f0ab258462d8c8e27823e071029d3"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::jsonb_extract_internal (cognitive 19): turso_core::json::jsonb_extract_internal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/mod.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e519c9dd1a9bfd4221b53468ee327828754cb73c5914a52b2068a346244a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::sqlite3_ondisk::read_integer (cognitive 19): turso_core::storage::sqlite3_ondisk::read_integer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (18 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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f95c4e3371f2564a401094c6a3b5bcc73544ec3a4239781ad3a6e12213382a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::delete::translate_delete (cognitive 19): turso_core::translate::delete::translate_delete has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (19 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":"core/translate/delete.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4659edf2a223862920a1388d44cbdffd280c2b979b037c67ac6e7db639b2d164"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::emit_columns_and_dependencies (cognitive 19): turso_core::translate::emitter::emit_columns_and_dependencies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 3, 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":"core/translate/emitter/mod.rs"},"region":{"startLine":2024}}}],"partialFingerprints":{"codehealthFindingId/v1":"977cd415ecdd382eff03d464de8aad6b26fd9856592de5e0ceddef4791469154"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::select::emit_materialized_build_inputs (cognitive 19): turso_core::translate::emitter::select::emit_materialized_build_inputs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4, 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":"core/translate/emitter/select.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"d363a2c418709823e745b2424c0cf1f9fcb59b5bce539fb4ab2029a28488ebad"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::index::emit_refill_index (cognitive 19): turso_core::translate::index::emit_refill_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 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":"core/translate/index.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf4b29621b56c7fb6dfe56ec118b6bb0c7ea0111be1ae8b2c7ae394e6a38c8d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::index::validate_index_expression (cognitive 19): turso_core::translate::index::validate_index_expression has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/index.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"abaefb0e41d5b0b4303ab65f758bbd80ee9557dea70537d0e9b0b76df2333da9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::collect_index_method_candidates (cognitive 19): turso_core::translate::optimizer::collect_index_method_candidates 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef36e7eb7a26d3c568ec14efc3e410ab8ac54a18d2fcf16ccd05f5f4f991cdd"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::autoindex_prefilter (cognitive 19): turso_core::translate::optimizer::autoindex_prefilter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":4411}}}],"partialFingerprints":{"codehealthFindingId/v1":"949db7489c6ae7af3b20f832798598c63ae7314ddb49ce60688a42163fe6fb34"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::prepare_recursive_cte_plan (cognitive 19): turso_core::translate::planner::prepare_recursive_cte_plan has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf5f3bb9221488f9b59111941ce9eb29c017413e7b1a44bdb2824975800fbb9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::parse_from_clause_table (cognitive 19): turso_core::translate::planner::parse_from_clause_table has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 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":"core/translate/planner.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd2cfcdcb1da54d4e1803b4ed4bd3c4b1ded51253b488a42683e278d1aaa439"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::row_security::filter_rows (cognitive 19): turso_core::translate::row_security::filter_rows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 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":"core/translate/row_security.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a442cee4fb375f3195aec40a2a399a4dda05481f639d359062961433de002466"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_seek_rowid (cognitive 19): turso_core::vdbe::execute::op_seek_rowid has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 4 (9 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":"core/vdbe/execute.rs"},"region":{"startLine":6347}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32bb5badd731bf31282a60a9f747b0a2b75e9b38571833e7ca5c035fa60d790"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_dump_fuzzer::dump_ast (cognitive 19): turso_pg_dump_fuzzer::dump_ast 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":"postgres/dump-fuzzer/src/lib.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d7329ce9b4602cf9bcc4fa196e55ba47763a1e6377d5e4ddf8b9adaac35207"}},{"ruleId":"D2","level":"warning","message":{"text":"Lexer::scan_number (cognitive 19): Lexer::scan_number has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/lexer.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ceeb551330e78963956f562e662932a6845a8e243ee714b40febb1976963073"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_single_select_query (cognitive 19): Parser::parse_single_select_query has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18 (19 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc45a5c1482c86775f928777a334df27636e7d66cdb6c5d6b9d3ef2c48c64110"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_parser::translator::pg_check_constraint_name (cognitive 19): turso_pg_parser::translator::pg_check_constraint_name 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, 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":"postgres/parser/translator.rs"},"region":{"startLine":5833}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dff7cd2d0051f552b709273032a63f63002f3cf6363f5535089941739c97b82"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_in_expr (cognitive 19): Parser::parse_in_expr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":2429}}}],"partialFingerprints":{"codehealthFindingId/v1":"2852d686753f677e48eea09a7d47b8054cde186adf80b89dd36e01ed2d552a71"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_select_without_cte (cognitive 19): Parser::parse_select_without_cte has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (7 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":3448}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ec19a65144d418e54f57e865cd21c397ad490ff3110db3589217a405ae202b"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::select::generate_supported_correlation_predicate (cognitive 19): sql_gen::generate::select::generate_supported_correlation_predicate has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (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":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"43bdb628186695bd2e16d7025195846e1719a5b480d7ea37f93ac4bb31ed87c5"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::trace::build_coverage_tree (cognitive 19): sql_gen::trace::build_coverage_tree has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (12 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":"testing/differential-oracle/sql_gen/src/trace.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5b50139dbdfa32c64ac5d2d6d89c8f62aec45cc18ebd1521c4f40c3e232b51"}},{"ruleId":"D2","level":"warning","message":{"text":"SimulatorEnv::new (cognitive 19): SimulatorEnv::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/env.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"56297eebf13fe0ff9665ad434643c6fc91c5867973fdc6cf0f1fcde9badc50a5"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::runner::execution::execute_interactions (cognitive 19): limbo_sim::runner::execution::execute_interactions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (4 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":"testing/simulator/runner/execution.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fdf7540d778d5fbdfbaf0c9d62f3d3c53b1296e05a6e3a125f70a04097fdccc"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::runner::execution::execute_interaction_rusqlite (cognitive 19): limbo_sim::runner::execution::execute_interaction_rusqlite has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 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":"testing/simulator/runner/execution.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb7a6f2deac469c38223b05dca6e28a53a08729b80bba2d39fc515b1185dd84"}},{"ruleId":"D2","level":"warning","message":{"text":"RustDatabaseInstance::execute_query (cognitive 19): RustDatabaseInstance::execute_query has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 2 (7 pts), match/switch 1 (2 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":"testing/sqltest/src/backends/rust.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b21ed658b7cf97dad2f394d0b3c77eae3cf3a081abe77eee016c3287bc4169"}},{"ruleId":"D2","level":"warning","message":{"text":"SnapshotManager::compare (cognitive 19): SnapshotManager::compare has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 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":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"875d42428d6e02393fb9e4b0d8f7dca90c1f190dc7c852182b54c6643ef60d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso.parseDSN (cognitive 19): turso.parseDSN has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 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":"bindings/go/driver_db.go"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"12bde0759199695a03df61d59d7fda55e3b85e585d5eee06ab39968a4f697b13"}},{"ruleId":"D2","level":"warning","message":{"text":"session.executePipeline (cognitive 19): session.executePipeline has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/go/session.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4950621bf22d69d6abebf5d65e0100d0bf640d0ac2f4940f8a728c91712a8e44"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement.iterate (cognitive 19): Statement.iterate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/javascript/src/statement.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b9e30849f9e7ecb2e869c718685a87204a3cfff351618ff81d55f4d2c97e21"}},{"ruleId":"D2","level":"warning","message":{"text":"ManagedSqliteStatementParser.TryReadParameter (cognitive 18): ManagedSqliteStatementParser.TryReadParameter has cognitive complexity 18 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/ManagedSqliteStatement.cs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"893c2c1f0b3569e485a15ba7a101691ac5fe4c018a7be0f5bfcae4e0fd946486"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDataReader.NextResult (cognitive 18): SqliteDataReader.NextResult has cognitive complexity 18 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e626ddb7b619445948256dc5c8a64a72c3f145dbcc5b8977b08a4960f31429"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sqlite3::sqlite3_bind_text (cognitive 18): turso_sqlite3::sqlite3_bind_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (4 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":"bindings/c/src/lib.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4f3107e5d2e2bee72f2238077104322d9334373bc292b60b23d53b09568605"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_node::connect_sync (cognitive 18): turso_node::connect_sync has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 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":"bindings/javascript/src/lib.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"1773863d86286f82cd0798c8f55f92dc0e505f1675c1f03e6bced0f2b47d1f9a"}},{"ruleId":"D2","level":"warning","message":{"text":"Connection::run_batch (cognitive 18): Connection::run_batch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2, 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":"bindings/rust/src/connection.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"814e5bc98dce4ca57c8320ad8a2cd14eedc9c608d15d1208adfb4b08def924c1"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoMcpServer::describe_table (cognitive 18): TursoMcpServer::describe_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 4 (7 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/mcp_server.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca31a92982edf2fc1f88fc691586995376be311c4c59a3aae5876e844629b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_cli::mvcc_repl::run (cognitive 18): turso_cli::mvcc_repl::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (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":"cli/mvcc_repl.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c137041798cc4a603e7b060a391dc3c6ec492c4b99bb26ff23a258abd6cecc4c"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::gc_version_chain (cognitive 18): MvStore::gc_version_chain has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 8, 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":"core/mvcc/database/mod.rs"},"region":{"startLine":8581}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5a3cf801720e4d88fba3d1c5a6c88af13204629c8b7432879fba0eebcb6f50"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::process_overflow_read (cognitive 18): BTreeCursor::process_overflow_read has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f828c85eea9c331b8c664a99535b62a82f816a121fa624d3e1f67de10b83ba"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseFile::read_page (cognitive 18): DatabaseFile::read_page has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 5 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/database.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd55523b1a0347e2725b9aa435a393f16c87441104544d5915ca9c240b0a2223"}},{"ruleId":"D2","level":"warning","message":{"text":"PageInner::_cell_get_raw_region_faster (cognitive 18): PageInner::_cell_get_raw_region_faster has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 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":"core/storage/pager.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"e852c90cdfa77cacd55581c894634957873030e7d7d8be02288981fa2d80a77d"}},{"ruleId":"D2","level":"warning","message":{"text":"WalFile::read_frames_batch (cognitive 18): WalFile::read_frames_batch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 2 (5 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":"core/storage/wal.rs"},"region":{"startLine":3817}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ce8ea48b44580e6745d58d382c1238bccb732380bde5aeba734bcf9da6e8097"}},{"ruleId":"D2","level":"warning","message":{"text":"Value::exec_unistr_quote (cognitive 18): Value::exec_unistr_quote has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (10 pts), loops 3 (6 pts), if/else 1 (2 pts) (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":"core/vdbe/value.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b3f136b0fb9fd40f636bb0b822f50cfd14dbd4f0b89c5219ef2ce4302a2e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::insert_pending (cognitive 18): HashTable::insert_pending has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (17 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":"core/vdbe/hash_table.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d6d36815c60dcbf0c7fb7e361541c6f05bae86bdbd4518a385866716f54db9"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::grace_load_next_probe_chunk (cognitive 18): HashTable::grace_load_next_probe_chunk has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4024802ca1dc787d2dd93ed19c38cafe10a721b2473555c5c1ad78ec0b3f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::state_table_sql (cognitive 18): turso_core::incremental::vdbe_maintenance::plan::state_table_sql has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 2 (5 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b3a92623835fc5e34416bcbd074c9d61b707e21dac61466d407fcc830121815"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::io::windows_lock::shared_wal_probe_exclusive_byte (cognitive 18): turso_core::io::windows_lock::shared_wal_probe_exclusive_byte has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/windows_lock.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca18d3d9013a77bea19621032e824df5314cdb5357ca5a83ea4a09af3fd438b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::convert_ref_dbtype_to_jsonb (cognitive 18): turso_core::json::convert_ref_dbtype_to_jsonb has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (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":"core/json/mod.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d2c094c2d1876259814ece7127d5d56394253e988252b3a71543b6d51a13a1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::mvcc::database::portable_delete_op_extension_for_row_version (cognitive 18): turso_core::mvcc::database::portable_delete_op_extension_for_row_version has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"core/mvcc/database/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68813a70fb9d9361eaf5fcfab0ae7ebb888630f96b0d365c6cb15e617d49258"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::btree::defragment_page (cognitive 18): turso_core::storage::btree::defragment_page has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 3 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":"core/storage/btree.rs"},"region":{"startLine":10125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8b303c608ed1004d5c95c77b9904ce8c6591b10cbf93c054da48a59bd36e85"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::emitter::delete::emit_delete_insns (cognitive 18): turso_core::translate::emitter::delete::emit_delete_insns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10, loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e23adaaae03e237bc4ef6304565c011085bb480e4b6bbaf556cbefce750e193"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::functions::translate_like_base (cognitive 18): turso_core::translate::expr::functions::translate_like_base has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/functions.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a35583592caec07a063197aed5edc84597e962040e4ca23c0bfe5db155ef14"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::group_by::collect_result_columns (cognitive 18): turso_core::translate::group_by::collect_result_columns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/group_by.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2248f8c2286a9bcb5c3981c2f5bc218fcf0c7c2ad0c3ee64a5327407f404f92"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::main_loop::close::emit_unmatched_right_rows (cognitive 18): turso_core::translate::main_loop::close::emit_unmatched_right_rows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 6 (7 pts), 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":"core/translate/main_loop/close.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddcb7c5cfeea96d8b7aadd942fc5c09caae9178304ede3a3a1a51fb228b21bf"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::subquery_resources (cognitive 18): turso_core::translate::optimizer::subquery_resources has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), match/switch 2 (3 pts) (nesting depth added 8). None of this is in the body itself: all 18 points belong to 3 function items inside it that branch (add_subqueries, add_plan, add_select). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb695dea28b18e0484a61bcc27dee691d08b8970bcd40d1b7f46485f731be384"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::update_write_set_reason (cognitive 18): turso_core::translate::optimizer::update_write_set_reason has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f359d24f5d3c3074a0e8ab023c16879ea88a4727d9dd6d10891c03e8acf8d696"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::base_row_estimate (cognitive 18): turso_core::translate::optimizer::base_row_estimate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 3 (7 pts), loops 1 (3 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ae61e6668035b49d226e9bb1d7d5102fc3f6fdccb1543d578b2de16b13bd8b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::cost::estimate_index_cost (cognitive 18): turso_core::translate::optimizer::cost::estimate_index_cost has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (18 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/cost.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c251407a28feae8aabe97a061d7092aa195f1b5c55f6d3bb2e05e4c60aaa9d1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::cost::estimate_rows_per_seek (cognitive 18): turso_core::translate::optimizer::cost::estimate_rows_per_seek has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (18 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/cost.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec02a9151ce4ea6dd6ddfba1bc2c9442fe6604fd89086027070b4f9f62fd51f9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::join::compute_greedy_join_order (cognitive 18): turso_core::translate::optimizer::join::compute_greedy_join_order has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 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":"core/translate/optimizer/join.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b2aa8881352808b36169c6201c003b8ea5ef5b6e2c9c612de96e7a56a46037"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::parse_where (cognitive 18): turso_core::translate::planner::parse_where has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (12 pts), if/else 4 (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":"core/translate/planner.rs"},"region":{"startLine":2645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c62cef689e76dd4ac2af973794520cf1b3ab57dfc0cfa923dca17d95ab61d1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::collect_autoindexes (cognitive 18): turso_core::translate::schema::collect_autoindexes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f390e155f0ebe851a9efa3daea518b23f1b117fe24938a293fae079bed0336b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::subquery::emit_non_from_clause_subqueries_for_phase (cognitive 18): turso_core::translate::subquery::emit_non_from_clause_subqueries_for_phase has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 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":"core/translate/subquery.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80a59a4e3763ebc97beda4022e3ba83ed3c985d7fd0bdd6f1a5f36804d5868d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::rename_column_view::select_output_columns (cognitive 18): turso_core::util::rename_column_view::select_output_columns has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":3922}}}],"partialFingerprints":{"codehealthFindingId/v1":"8690ecdc2300151cca0250c033d1a04e4f2ef3fa5bdec89536974f84cd6c5232"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_sequence_commit_inner_tx (cognitive 18): turso_core::vdbe::execute::op_sequence_commit_inner_tx has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 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":"core/vdbe/execute.rs"},"region":{"startLine":14419}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7d162328670f0c125218dfe974af28439905674edd91aa82b28e3d37b9bc9d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_open_ephemeral (cognitive 18): turso_core::vdbe::execute::op_open_ephemeral has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (6 pts) (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":15687}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa45ee9efcda2013e91b9c2badd54b7c7c31c74bbf3c2fb581b08b47debd22a"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::op_hash_build (cognitive 18): turso_core::vdbe::execute::op_hash_build has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 6, loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":17512}}}],"partialFingerprints":{"codehealthFindingId/v1":"65bb0753f149d79be54eadd605b64853c17fdf3e27571886281154ba77eae9ec"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::catalog::catalog_indexes (cognitive 18): turso_pg::catalog::catalog_indexes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 3 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/catalog.rs"},"region":{"startLine":4152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0340b652958213e2b9fddb020f30d1a5b2eb9df516840235dd58372ba9d28aa"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_insert_statement (cognitive 18): Parser::parse_insert_statement has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00e3de52daca2967dcf63d0c7cf20ade0cae63bcd68f91b055692d9b551593d"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_data_type (cognitive 18): Parser::parse_data_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), 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":"postgres/parser/parser.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf03b79604aaff8d867ffda43345e1adb2ce48ef98e6422fb15c670a7801ce1"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_alter_table_action (cognitive 18): Parser::parse_alter_table_action has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":2016}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc9fafbcaa11b442981225cf16831fd28059f9f74e72d4302fc19d7eda70f56"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_copy_statement (cognitive 18): Parser::parse_copy_statement has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56cc3a2a6f4d80bf24ddfcccac98f6478862a48453a53ebc5d47189de958338"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_regress::collect_scripts (cognitive 18): turso_pg_regress::collect_scripts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (11 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":"postgres/regress/main.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d12cd0dc1c23598d6482dd702c89aa1727d81b34c9396c24b0cf6828498256"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg_regress::describe::describe_table (cognitive 18): turso_pg_regress::describe::describe_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, 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":"postgres/regress/describe.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"46efe9539d3726ad0a24b501927a2d421a46c358833505da7622a10fe61f5970"}},{"ruleId":"D2","level":"warning","message":{"text":"CompoundPredicate::from_table_binary (cognitive 18): CompoundPredicate::from_table_binary has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (18 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/generation/predicate/binary.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a55f67f224b927405e98616a6bbf87ac50ee61282b10160891a7ff9cbfe0631f"}},{"ruleId":"D2","level":"warning","message":{"text":"AlterTable::shadow (cognitive 18): AlterTable::shadow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 pts), match/switch 4 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/model/mod.rs"},"region":{"startLine":1431}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2f30eb1afb6d1004c3f305f90c0cd751ef212be5cf4f693a3543590baa1c98"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectInner::shadow (cognitive 18): SelectInner::shadow has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/model/mod.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d410116765a9163c9a89f22432ce5bd681ddf4ef98e7ed0fab3ac864b923a2"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_frame_opt (cognitive 18): Parser::parse_frame_opt has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 10 (16 pts), if/else 2 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eea7c0cbff58885591ae27fd1a164016dc7bb76567e78d79ddfc1bcd00ab9ed"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_create_sequence (cognitive 18): Parser::parse_create_sequence has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":5273}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fb79af70977f3628a2d4b3bfb428ae0bc4922afb7e7b2372f116f6f2a6f3ce"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoDatabaseSyncConfig::from_capi (cognitive 18): TursoDatabaseSyncConfig::from_capi has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/sdk-kit/src/rsapi.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185fde4e984c2679c6d81a29853d8d94505e11a0a33d656149996d31bf4f937"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_whopper::apply_swarm (cognitive 18): turso_whopper::apply_swarm has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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":"testing/concurrent-simulator/main.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"965a1c1f46a59fabe561fb191af5e194347ea201903d120e735e0a781ca67b55"}},{"ruleId":"D2","level":"warning","message":{"text":"InteractionType::execute_fsync_query (cognitive 18): InteractionType::execute_fsync_query has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (6 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":"testing/simulator/model/interactions.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"3843e535a3ea67d375655f2c646d9091d01836a025853de3c3905ee3c899fff6"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::generation::property::read_user_table_names (cognitive 18): limbo_sim::generation::property::read_user_table_names 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":"testing/simulator/generation/property.rs"},"region":{"startLine":1842}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9d7748b5831f1eb7b6e76b0f914a12b694bf02c16d3beb70521bedb4398dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"TestRunner::spawn_file_tests (cognitive 18): TestRunner::spawn_file_tests 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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"80422930818e42e237cd344dcef76ab32354fd8456ff592b31a2e8eda68214d5"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::convert_files (cognitive 18): sqltest::convert_files has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 2 (8 pts), if/else 4 (5 pts), loops 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":"testing/sqltest/src/main.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"c99fc135afb189aaa4a26267e24f3e4b7bf146dff5db8ea7782d0226732c5379"}},{"ruleId":"D2","level":"warning","message":{"text":"tursoDbConnection.ExecContext (cognitive 18): tursoDbConnection.ExecContext has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/go/driver_db.go"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d2f02a423e9cfd3ae931528fdafdca964d3f8908b9894442a4aca8c840d972"}},{"ruleId":"D2","level":"warning","message":{"text":"turso.decodeValue (cognitive 18): turso.decodeValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 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":"serverless/go/protocol.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6454144a120117657ea57eecf40aa43b61c306392a9dd8f44d9cb820b3b7c2"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.trackAutocommit (cognitive 18): Session.trackAutocommit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, 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":"serverless/javascript/src/session.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"495148fa9858ec46e1687b957e2db14f692e710f4e919734f42bae3152c51663"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.processCursorEntries (cognitive 18): Session.processCursorEntries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, match/switch 1 (2 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":"serverless/javascript/src/session.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"788e2e66c964ad65d04b65855a480d0c61b5e31123cb5221c76f7af7c71c981a"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteConnection.Dispose (cognitive 17): SqliteConnection.Dispose has cognitive complexity 17 (threshold 15). To reduce it, flatten the nesting: invert conditions into early returns or guard clauses so the happy path stays at one level, and lift the deepest nested block into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"e513cd3f7a5a0acfb0654341a80afad2112c0ad381fe5c317ac3e9559cabcc76"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteConnection.NormalizeUriDataSource (cognitive 17): SqliteConnection.NormalizeUriDataSource has cognitive complexity 17 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d204e481f46b0856bb9a4e31c8e9b5939371b472ff14b11ea678a2f870ec465"}},{"ruleId":"D2","level":"warning","message":{"text":"turso::batch::first_sql_keyword (cognitive 17): turso::batch::first_sql_keyword has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (6 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":"bindings/rust/src/batch.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc981574a14e71a736596c9c249493f5ab90eda7cb410cc7687137a5e83b98d"}},{"ruleId":"D2","level":"warning","message":{"text":"Limbo::display_tables (cognitive 17): Limbo::display_tables has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 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":"cli/app.rs"},"region":{"startLine":1681}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a255802f9201f807955005f5df51c10b3cf6609664a4b2594e54585fa9f9fd"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_cli::sync_server::read_mvcc_frame_boundary (cognitive 17): turso_cli::sync_server::read_mvcc_frame_boundary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/sync_server.rs"},"region":{"startLine":1143}}}],"partialFingerprints":{"codehealthFindingId/v1":"decfac00b94cc65dd0778b3bc4ab21af3a62f84702834ebfe99681450c0ac7b0"}},{"ruleId":"D2","level":"warning","message":{"text":"FtsCursor::optimize (cognitive 17): FtsCursor::optimize has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/fts/mod.rs"},"region":{"startLine":3718}}}],"partialFingerprints":{"codehealthFindingId/v1":"f135c6ef6548f955df68a07fef1abff234eb3584e33c748265f14a698c2565c0"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonbHeader::from_slice (cognitive 17): JsonbHeader::from_slice has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 1 (2 pts) (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":"core/json/jsonb.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"767400afa794961f52c6c63d1d4f8d6c23be1faa80b3fcea16ba122ead996380"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeTable::try_build_logical_to_physical_map (cognitive 17): BTreeTable::try_build_logical_to_physical_map 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":"core/schema.rs"},"region":{"startLine":6388}}}],"partialFingerprints":{"codehealthFindingId/v1":"999fd29a898bf4f2d8d2840554ee11e9b59775630f490128698c07886a3c5a9f"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::seek_end (cognitive 17): BTreeCursor::seek_end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":7877}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5b9abce1423d848b132a5ddccdae2bb97637e29facc225610328d241e66d48"}},{"ruleId":"D2","level":"warning","message":{"text":"HashProbeSetupEmitter::install_context (cognitive 17): HashProbeSetupEmitter::install_context has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/hash.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ea25028910770c9b4935b80b4c606ec9a987ac841065464486cbebfe8dcacf"}},{"ruleId":"D2","level":"warning","message":{"text":"HashTable::parse_partition_chunk (cognitive 17): HashTable::parse_partition_chunk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 1, 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":"core/vdbe/hash_table.rs"},"region":{"startLine":2594}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5541540212251b508bc784dc78981e0d70edb80c28115fe461d76edd5a6bab"}},{"ruleId":"D2","level":"warning","message":{"text":"ProgramState::reset (cognitive 17): ProgramState::reset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (4 pts), match/switch 2 (4 pts) (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":"core/vdbe/mod.rs"},"region":{"startLine":1405}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6aaa9162982e58ad2b8767a8ae5ce8d916dcc3dc9a3d2324f48bae25c9aa3e4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::dbpage::update_dbpage (cognitive 17): turso_core::dbpage::update_dbpage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 2, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/dbpage.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca3e172c1ab4fc640d9ebf4f56d0653e16c6df8d217d13be2c10926920a4e2d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::io::unix::unix_shared_wal_lock_byte (cognitive 17): turso_core::io::unix::unix_shared_wal_lock_byte has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 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":"core/io/unix.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e68d6e0cafed70e42dddecd08c4ba05b7b25321727702031c3aed4f76164fe"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::jsonb::unescape_one_char (cognitive 17): turso_core::json::jsonb::unescape_one_char has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), 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":"core/json/jsonb.rs"},"region":{"startLine":3949}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdad73a7436206742987703a69683b232aac35d6371a0a1cc92a46393bc8cfe"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::mvcc::database::checkpoint_state_machine::walk_table_keys (cognitive 17): turso_core::mvcc::database::checkpoint_state_machine::walk_table_keys has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef1b61373fda48ec7c7c27d08fa1da3717cf6b2d9d7a6f81fceace55e307859"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::integrity_check::resolved_root_pages (cognitive 17): turso_core::translate::integrity_check::resolved_root_pages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (5 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":"core/translate/integrity_check.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f8416e5962b4e453b773e74c2a8d34132dcc2369dba3a09f49e75ecf222b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::transform_match_to_fts_match (cognitive 17): turso_core::translate::optimizer::transform_match_to_fts_match has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 3 (6 pts), loops 1 (nesting depth added 7). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94ae5c71f9753634c53c6e34d4b9bd2147c584be1918bd3b38310a7757402e1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::build_update_write_set_plan (cognitive 17): turso_core::translate::optimizer::build_update_write_set_plan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ce92bcc6f5fc5910dfe9c6aff2f2bf53ba44c6e61641470d38f444e3557c81"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::maybe_remove_index_candidate (cognitive 17): turso_core::translate::optimizer::maybe_remove_index_candidate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":3937}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcadfa2867e44387d275a640c3c25a64375bf1840e6600f28e2c4e2495423eab"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::constraints::add_implied_column_equalities (cognitive 17): turso_core::translate::optimizer::constraints::add_implied_column_equalities has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e39c400bc917949d78fa077dfe2e163ffa192a523b0bfaa70e832cf9b157c9"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::lift_common_subexpressions::in_filters_implied_by_or_branches (cognitive 17): turso_core::translate::optimizer::lift_common_subexpressions::in_filters_implied_by_or_branches 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":"core/translate/optimizer/lift_common_subexpressions.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"01811836a3e135adfbcd0e031e62daed59cbde13fb6a999c02029aafe226cee6"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::unnest::find_exists_in_where (cognitive 17): turso_core::translate::optimizer::unnest::find_exists_in_where has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/unnest.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"edfe90f31f1bd272c5fe1860591b372c27493b1da3b5b2206c628e3358636c23"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::rewrite_between_exprs (cognitive 17): turso_core::translate::planner::rewrite_between_exprs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (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":"core/translate/planner.rs"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a7ab7df006693a5c4d978c340bb8615435f2eafe3afb4b3a9b63f221dfe9f7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::planner::determine_where_to_eval_term (cognitive 17): turso_core::translate::planner::determine_where_to_eval_term has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"154cb9cec468aad944e3cf440ac4bb303accbd589c0784f9898c616dd387dff5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::build_create_type_sql (cognitive 17): turso_core::translate::schema::build_create_type_sql has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), match/switch 3 (7 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":3279}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ffedd35f79a667a9362c6cba6e4340fda5fa773fd04caf97b3a372e05fe638"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::translate_create_domain (cognitive 17): turso_core::translate::schema::translate_create_domain has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 3, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":3378}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6d1e76c70bfa8d1cc0369573e39e9621a51c3b86edacd0e322b1dc6bf29b66"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::select::replace_column_number_with_copy_of_column_expr (cognitive 17): turso_core::translate::select::replace_column_number_with_copy_of_column_expr has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/select.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee77ab7fb6948ee3045d389873e31b2e083a7b5641f08327ee5a43984c4e8a4"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::update::collect_update_set_clauses (cognitive 17): turso_core::translate::update::collect_update_set_clauses has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 1 (4 pts), loops 2 (3 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":"core/translate/update.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43447e98640b104ddde69911f2e2fae3d7f5c3acdafaffe21f7acc75ad0ed05"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::visit_stmt (cognitive 17): turso_core::util::visit_stmt 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). 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":"core/util.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d64ed85607f038dabb509dc773c1f611fbe95a012ebdeaae111dbd3a956e3cc"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::visit_upsert (cognitive 17): turso_core::util::visit_upsert has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (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":"core/util.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef3a42b925c8cbb3aaf2de3aefd4fe5149582358accfdcc63e0b6988ce4a0b1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::extract_view_columns_inner (cognitive 17): turso_core::util::extract_view_columns_inner has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (7 pts), match/switch 1 (2 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":"core/util.rs"},"region":{"startLine":2706}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f53d4e923522fe5f26088f38cf34ab757852681cee835837de9fb95118d8f5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::rewrite_trigger_cmd_table_refs (cognitive 17): turso_core::util::rewrite_trigger_cmd_table_refs 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). 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":"core/util.rs"},"region":{"startLine":4164}}}],"partialFingerprints":{"codehealthFindingId/v1":"724fcb000c02afbc1f0c4d833756b861d09859d1e7a21f3d665c71f940dfe2f7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::index_method_stage_statement_all (cognitive 17): turso_core::vdbe::execute::index_method_stage_statement_all has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (5 pts), loops 2, boolean chains 1 (nesting depth added 8). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (stage_statement_all_cold). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":3936}}}],"partialFingerprints":{"codehealthFindingId/v1":"83866d7e87e6747e8f5f6f2a867ad4aea20f3dcfd739c57613098ecfdb1cd195"}},{"ruleId":"D2","level":"warning","message":{"text":"CompletionCursor::filter (cognitive 17): CompletionCursor::filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/completion/src/lib.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"67430b9d42e8a7bcef8579a60b5981c22d517e4ceac65bb8a8eeecc02c75b1dc"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_fuzzy::optimal_string_alignment (cognitive 17): limbo_fuzzy::optimal_string_alignment has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 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":"extensions/fuzzy/src/lib.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0906de3594b21108f7b2210ec97469cb74ff0ae81fbecc67e50ad74b9c86eaa4"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_fuzzy::translit::transliterate (cognitive 17): limbo_fuzzy::translit::transliterate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/fuzzy/src/translit.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b22100a32b747f7f54d8e6cefdf6c422ab2392718ae4345834d322ea008c2c"}},{"ruleId":"D2","level":"warning","message":{"text":"RegisterExtensionInput::parse (cognitive 17): RegisterExtensionInput::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 1 (4 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":"macros/src/ext/mod.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30c9ad63d72262d42c5409eb4445ba18f4291abe5a5c876e208e6a781e03c90"}},{"ruleId":"D2","level":"warning","message":{"text":"DeferredOperation::start (cognitive 17): DeferredOperation::start has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (3 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":"postgres/frontend/session.rs"},"region":{"startLine":1083}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa40cdecfbf513bad219cfe6d06f580f1f2eaf145d7761a5497857d31b84714e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::functions::exec_current_schemas (cognitive 17): turso_pg::functions::exec_current_schemas has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (3 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/functions.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5498d6c71bfd2150580da0142e6a2878c3533477c29580659a7f6ba7e1044075"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_explain_statement (cognitive 17): Parser::parse_explain_statement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":2247}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a0496db347267a431270b2c3b75342b69cc784204efc24721c6ca32ec529a1"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::flatten_join_tree (cognitive 17): PostgreSQLTranslator::flatten_join_tree has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 3 (5 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":"postgres/parser/translator.rs"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3233610c995501470ac4fba97b3f08def30dce666e70b767d41fb02d9870d534"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_generation::generation::query::get_column_diff (cognitive 17): sql_generation::generation::query::get_column_diff has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 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":"sql_generation/generation/query.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00af18a1ec1db605d0d87dfa3384cbfe74ab3316f4107afa638f1de42a5aee5"}},{"ruleId":"D2","level":"warning","message":{"text":"OneSelect::to_tokens (cognitive 17): OneSelect::to_tokens 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). 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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"936ad9a0acf90fb53f10b0a04bcb71888937f5cc79e498f89dc1c95da58aef36"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::next_cmd (cognitive 17): Parser::next_cmd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (5 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7228d6f265fbe5b345a492376f14fb98fd0ddcce59928f971881f266b7092c98"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::stmt::generate_insert_values (cognitive 17): sql_gen::generate::stmt::generate_insert_values 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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c627ad828222c9d3e9532767ab4db33fa016156c0e2b99dbd6afc8e1b4a0dc"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen_prop::cte::recursive_cte_definition (cognitive 17): sql_gen_prop::cte::recursive_cte_definition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (4 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":"testing/differential-oracle/sql_gen_prop/cte.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"a757f24bc4c8bd96da773efb10ae66e39d9e69190c8665d6e7ca13e327f91032"}},{"ruleId":"D2","level":"warning","message":{"text":"PlanGenerator::next (cognitive 17): PlanGenerator::next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"testing/simulator/generation/plan.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ce1411474d0266694f029d9ada949015a342cd00fbc40860ce40911f5e7351"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::generation::property::property_insert_values_select (cognitive 17): limbo_sim::generation::property::property_insert_values_select has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 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":"testing/simulator/generation/property.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee9bc224204672edf5185f6e6a1ec668c2790fc60dea093e54dd4c1300b08ce"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::runner::execution::execute_interaction_turso (cognitive 17): limbo_sim::runner::execution::execute_interaction_turso has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/execution.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3c681053499f5be474e5f6630a979992694a3650024b3ecc7b7e902c7d6ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"JDBC4PreparedStatement.setObject (cognitive 17): JDBC4PreparedStatement.setObject has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, 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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97bfc853c90274b19750fec9e5693d010b1de90a304c5689c7f5945f2782db7"}},{"ruleId":"D2","level":"warning","message":{"text":"TursoServer.create (cognitive 17): TursoServer.create has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 pts), error handling 1 (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":"bindings/javascript/sync/packages/native/turso-server.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f54b05f88671dd5bc509bbe45e7f7e54982d6d8d78b77ac2d8788e4e929e59b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso-sql-split.transition (cognitive 17): turso-sql-split.transition has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 9 (17 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/turso-sql-split.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3722f6efcc643c7228614432f268438751ec086af9b9797e9ffe1831ecfa90"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteCommand.Execute (cognitive 16): SqliteCommand.Execute has cognitive complexity 16 (threshold 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"560ef85ace811026c4545a0dee5ad6b8015688c7f82f6e9bed71114ee53ef89d"}},{"ruleId":"D2","level":"warning","message":{"text":"SqliteDataReader.GetFieldValue (cognitive 16): SqliteDataReader.GetFieldValue has cognitive complexity 16 (threshold 15). 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6b3301d7f91278f721b62df3a672501c72de83ec8ffd76e490cbf60820c436"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_sqlite3::sqlite3_prepare_v2 (cognitive 16): turso_sqlite3::sqlite3_prepare_v2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 3, loops 1 (2 pts), match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/c/src/lib.rs"},"region":{"startLine":1074}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c65e81e29a41d7b905b0343a29b4bf9e28672512a63a8574c4cc80b864b300b"}},{"ruleId":"D2","level":"warning","message":{"text":"IncrementalView::referenced_tables::collect_one (cognitive 16): IncrementalView::referenced_tables::collect_one has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (6 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/view.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de71bb0489640797676fb84e0619050b6b5b92e508337fd2dfdba55167c6a12"}},{"ruleId":"D2","level":"warning","message":{"text":"UnixFile::pwritev (cognitive 16): UnixFile::pwritev 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":"core/io/unix.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3a161adebe67f6fdb7fd0cbe0152446d66d14a574c9347a059b51b95a90705"}},{"ruleId":"D2","level":"warning","message":{"text":"Jsonb::navigate_path (cognitive 16): Jsonb::navigate_path has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (2 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":"core/json/jsonb.rs"},"region":{"startLine":2592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0210f24be75c7529b4bd841fb0a661789f97b520beca68b7624257aa30c08f33"}},{"ruleId":"D2","level":"warning","message":{"text":"MvccLazyCursor::seek_btree_and_set_peek (cognitive 16): MvccLazyCursor::seek_btree_and_set_peek has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), if/else 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9d012c21048ef7fb6322fcde146b8dc75cf9a898a0390f57ef0cb7aac89864"}},{"ruleId":"D2","level":"warning","message":{"text":"CheckpointStateMachine::gc_checkpointed_index_versions (cognitive 16): CheckpointStateMachine::gc_checkpointed_index_versions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce7bf992a158e1cf6b9bd03ed49069d72063a1b502a992ce8d41845d9ab0c1c"}},{"ruleId":"D2","level":"warning","message":{"text":"MvStore::acquire_exclusive_tx (cognitive 16): MvStore::acquire_exclusive_tx has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":7713}}}],"partialFingerprints":{"codehealthFindingId/v1":"da798e73ef49b45b06ac2a0d85901f4037615431214de11fa8b3a5e3e30cfcd5"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingLogicalLogReader::next_frame (cognitive 16): StreamingLogicalLogReader::next_frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94e0e9f9c3c01e0043ff54025ce0734079d8676e7769814d6180597acd183f2"}},{"ruleId":"D2","level":"warning","message":{"text":"StreamingLogicalLogReader::read_exact_at (cognitive 16): StreamingLogicalLogReader::read_exact_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (15 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3556}}}],"partialFingerprints":{"codehealthFindingId/v1":"8badb082d24feb0d401bf08bbdf30c1233b93cb4de4347ef1d0482fd3d79baf3"}},{"ruleId":"D2","level":"warning","message":{"text":"GenerateSeriesTable::best_index (cognitive 16): GenerateSeriesTable::best_index has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 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":"core/series.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"371f28b6211bd31640f0094b2f5d4b1f79497f0264b9552a63650ccd6cd3a782"}},{"ruleId":"D2","level":"warning","message":{"text":"BTreeCursor::try_save_position_for_external_balance (cognitive 16): BTreeCursor::try_save_position_for_external_balance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":7766}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf68dfce622781700ba68f3a45ef5d7abec84c5935f5fdea994cc8ddd5c4f4da"}},{"ruleId":"D2","level":"warning","message":{"text":"Pager::read_header_page (cognitive 16): Pager::read_header_page has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"33679ad67a0243a5025caa2f7e8d330539b1f6cd94391dd57be936f9761708cd"}},{"ruleId":"D2","level":"warning","message":{"text":"ShmWalCoordination::acquire_checkpoint_guard (cognitive 16): ShmWalCoordination::acquire_checkpoint_guard has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b03debde5add21e3ec6d25c62bc9de45879a3b187fc873abcda01c1cc68caca"}},{"ruleId":"D2","level":"warning","message":{"text":"WalFile::write_frame_raw (cognitive 16): WalFile::write_frame_raw 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":"core/storage/wal.rs"},"region":{"startLine":4050}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb6dafe0ec06c97aaa692395348558399d58c3ef658e540598d19c00eb5de91"}},{"ruleId":"D2","level":"warning","message":{"text":"WalFileShared::open_shared_from_authority_if_exists (cognitive 16): WalFileShared::open_shared_from_authority_if_exists has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, match/switch 2, 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":"core/storage/wal.rs"},"region":{"startLine":5841}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca79eea366d4877569172bbcfbc70db875db97ecf048e5840f25c406b599e11"}},{"ruleId":"D2","level":"warning","message":{"text":"Sorter::next (cognitive 16): Sorter::next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/sorter.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbd4629c17e0b1841c195419e46a0f3ca90d67bb30217372f701fb72048d36b"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::functions::datetime::parse_timezone (cognitive 16): turso_core::functions::datetime::parse_timezone has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 1, 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":"core/functions/datetime.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d89ab9b06b5c675fcfa38ce428be78ecdec71b93f0a852cce8de0da4cebdd28"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::incremental::vdbe_maintenance::plan::plan_operator_states (cognitive 16): turso_core::incremental::vdbe_maintenance::plan::plan_operator_states 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":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"babd74deec46c77ff3a1c04f9347bc46d714651965eb9f36b24d1dacf7087e9c"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::json::is_json_valid (cognitive 16): turso_core::json::is_json_valid has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/mod.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"6626fd236ed07e7dd464c6cbdb6509499559881b3330b28d27dd05077c4824d5"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::mvcc::database::table_name_for_rootpage_in_mvcc_schema (cognitive 16): turso_core::mvcc::database::table_name_for_rootpage_in_mvcc_schema has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d237ee1d46bf429531ef4528187a5c8c827665faab6b64da553f007db188ba1"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::storage::sqlite3_ondisk::begin_read_wal_frame (cognitive 16): turso_core::storage::sqlite3_ondisk::begin_read_wal_frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"d223397a569bf66987c0eca555dba5a47a44bc9f3e2437473f3a5f71d8632589"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::binary::emit_binary_expr_row_valued (cognitive 16): turso_core::translate::expr::binary::emit_binary_expr_row_valued has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), match/switch 2 (3 pts), loops 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":"core/translate/expr/binary.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30c6a7c6f9d1772e0985beb7d8960b918712daf909e967d8dea80835e45f357"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::expr::translator::copy_cached_expr_reg (cognitive 16): turso_core::translate::expr::translator::copy_cached_expr_reg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 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":"core/translate/expr/translator.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f62df2ce6e1e42430d41734f9b810b40a6c950f9ba4b3beb39791d9abc62273"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::group_by::collect_agg_leaf_columns (cognitive 16): turso_core::translate::group_by::collect_agg_leaf_columns has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/group_by.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"aced1bb56f61f14644d4d2f660900bd273a1dbf375fb7e9c78f52d5bfcc946ef"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::optimizer::optimize_subqueries (cognitive 16): turso_core::translate::optimizer::optimize_subqueries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":1783}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2bcc2d52cc278a106f5a2039c142b21f4cecfccc3c9b1ecbf214b703fcc662"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::plan::eval_at_for_select_plan (cognitive 16): turso_core::translate::plan::eval_at_for_select_plan has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (6 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":"core/translate/plan.rs"},"region":{"startLine":4705}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6843682e9ade34bf39202e4235444ba34c15526a6178e99e755ac4ee5c0a9e7"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::schema::check_column_type (cognitive 16): turso_core::translate::schema::check_column_type 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":"core/translate/schema.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac2f6544df953a34f917507581df3247df2f824144c4e4b4d9ca9fbf9a3ee33"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::select::select_plan_first_virtual_table_name (cognitive 16): turso_core::translate::select::select_plan_first_virtual_table_name has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/select.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"55eee5ba338dba19679962bf2ac946d93bc848d29538db83144e0f7da3aaad83"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::subquery::pre_materialize_multi_ref_ctes_in_tables (cognitive 16): turso_core::translate::subquery::pre_materialize_multi_ref_ctes_in_tables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (13 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":"core/translate/subquery.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"3757e23ba51f760743b2809a8f0442209d886d8dbbd3ee6df83c64748dc79e4d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::subquery::columns_read_by_group_subqueries (cognitive 16): turso_core::translate::subquery::columns_read_by_group_subqueries 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":"core/translate/subquery.rs"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dbdb5884e5ef1ae575941b08e1478add2a1968e65748c72181939ca17a273d"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::translate::trigger::validate_trigger_no_cross_db_refs (cognitive 16): turso_core::translate::trigger::validate_trigger_no_cross_db_refs 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":"core/translate/trigger.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"79829f9fe9919b7570f8b6a454f9018e89c8994780235d3acb8e24324a0ceb6e"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::util::view_source_from_select_table (cognitive 16): turso_core::util::view_source_from_select_table has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0042ce137ef51e79890c8b6d81bd0dfef37dcea170dd877e15757627f25361"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_core::vdbe::execute::mirror_named_savepoint_to_active_non_main_databases (cognitive 16): turso_core::vdbe::execute::mirror_named_savepoint_to_active_non_main_databases has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (7 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":4458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5691ab8f9f5a5d0130c63d8cb5d41d3c1ee44208fae06aa7b5819f65314a0f3c"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_fuzzy::damlev (cognitive 16): limbo_fuzzy::damlev has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extensions/fuzzy/src/lib.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1489cc65f66246265c03f2fba8e314a6ece98ef324aee40689e1ef770b5861"}},{"ruleId":"D2","level":"warning","message":{"text":"Repl::run_interactive (cognitive 16): Repl::run_interactive has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (3 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":"postgres/cli/main.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4c24bff0d194a18cb9d867c351d35e7d093a86e2823638271abe6c41e543af"}},{"ruleId":"D2","level":"warning","message":{"text":"turso_pg::functions::validate_json_braces (cognitive 16): turso_pg::functions::validate_json_braces has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/functions.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb6af81efd6829b6bc1688c1f8bfe27b36abfdf1bc60bb3591b0dae8ad45fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgreSQLTranslator::translate_set_operation (cognitive 16): PostgreSQLTranslator::translate_set_operation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 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":"postgres/parser/translator.rs"},"region":{"startLine":2326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2b376c20eee82e7fb0c8388600d4d089be1cd1d67829806fcdd5eca3a47c36"}},{"ruleId":"D2","level":"warning","message":{"text":"LineReader::next_line (cognitive 16): LineReader::next_line has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (2 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":"serverless/rust/session.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd9f649470c675fae95ede0ce51ade7ebf546bef960e88d1844a072826bce6f"}},{"ruleId":"D2","level":"warning","message":{"text":"FromClause::shadow (cognitive 16): FromClause::shadow has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 1 (5 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/model/mod.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"df138ed46784f24c0192daf2ea7fd6da8164a488c3b1e80926125f96b94b4368"}},{"ruleId":"D2","level":"warning","message":{"text":"Update::arbitrary (cognitive 16): Update::arbitrary has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, 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":"sql_generation/generation/query.rs"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe19f8764030560d67fe682cb44b3a59a3d2bd40cd78d9b6dbff1347fc3424b"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser::parse_fullname (cognitive 16): Parser::parse_fullname has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (16 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b2845e91aab558d5e513e7e71a71581e1fd52044efe6160835c81f501b097e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Whopper::new (cognitive 16): Whopper::new has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 5, match/switch 2 (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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"43afc9c9104c084a8abb4f88267bbc75d6a3cb9feefa24d3b61af105e06e03e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectStmt::order_by_includes_unique_column (cognitive 16): SelectStmt::order_by_includes_unique_column has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6 (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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5f212a6847c5a529cc8f7b5cb000986db56dc6aad2379565bbbd2c2e715b94"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertStmt::fmt (cognitive 16): InsertStmt::fmt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"b786fb7f09494c6043a6397adcc1c8e6b05f3aab5d78b05f1b88df2a88a8f7bd"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::select::generate_select_impl (cognitive 16): sql_gen::generate::select::generate_select_impl 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: 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":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e2b0845be6942521522d826608de94cd8d6d41e92327d6a691fcdf9b38602c"}},{"ruleId":"D2","level":"warning","message":{"text":"sql_gen::generate::select::generate_window_function (cognitive 16): sql_gen::generate::select::generate_window_function has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef5bc84d63b0257bf33542b3172fc9172de7ff5de923909928d3752666abdd5"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowTablesMut::nextval (cognitive 16): ShadowTablesMut::nextval has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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":"testing/simulator/runner/env.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddbd9dabdec33b58dffd33a5e0c7973aa8ffa9619320bcfd07a74b4c262bf66"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::runner::doublecheck::compare_results (cognitive 16): limbo_sim::runner::doublecheck::compare_results has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 3 (6 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":"testing/simulator/runner/doublecheck.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7adfb8c88e85d9eaafc5422e5cf22838a93e155ac2c565b00c2bc701d089c6"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::runner::execution::finish_turso_query (cognitive 16): limbo_sim::runner::execution::finish_turso_query has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/execution.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c4a558b5b336399f085999b0432ee2e56f0a0c4f7317eac259621c9d504f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"limbo_sim::runner::execution::execute_query_rusqlite (cognitive 16): limbo_sim::runner::execution::execute_query_rusqlite has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (11 pts), loops 3 (5 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":"testing/simulator/runner/execution.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90f8a6260de68f79c722f18868402a1db53fe75f13814f27219b3e681bbdd3a"}},{"ruleId":"D2","level":"warning","message":{"text":"TestRunner::spawn_matrix_tests (cognitive 16): TestRunner::spawn_matrix_tests has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c65935c6b3cb931b36c7545020226e3836d742f887a799dbcf1f7dc624163b3"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::snapshot::find_pending_snapshots (cognitive 16): sqltest::snapshot::find_pending_snapshots has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be6065e9eee65da051db80c1ed4c771ef99a9984970e3048fb8a9f121a4566b"}},{"ruleId":"D2","level":"warning","message":{"text":"sqltest::tcl_converter::parser::clean_expected (cognitive 16): sqltest::tcl_converter::parser::clean_expected has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/tcl_converter/parser.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8bb0a991aaf223e4bb17e3fc91659a0460e7a27afb6557871a7ac2ab59cd7e5"}},{"ruleId":"D2","level":"warning","message":{"text":"lib_sync._run_op (cognitive 16): lib_sync._run_op has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, error handling 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":"bindings/python/turso/lib_sync.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3566f93cb9816cd115cb4f64513169e48ed155c51b91207d84c13c5f2f4c48"}},{"ruleId":"D2","level":"warning","message":{"text":"compare-divan-std-turso.paired_rows (cognitive 16): compare-divan-std-turso.paired_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"scripts/compare-divan-std-turso.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ba820c40b9d15402a1609dfcebb99db22553509a9c069170c09456fce53d5f"}},{"ruleId":"D2","level":"warning","message":{"text":"record.parse_record (cognitive 16): record.parse_record has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 1 (3 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/lib/record.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"75aad679750bf15085b1f23a803910f8d510017602a24a589a90e2a8efcaa161"}},{"ruleId":"D2","level":"warning","message":{"text":"Session._post (cognitive 16): Session._post has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 4 (5 pts), loops 1 (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":"serverless/python/turso_serverless/session.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a497b0708e64e8be76bc514500abfd5cb8db958382d1b82aef9cabfab5fca4"}},{"ruleId":"D2","level":"warning","message":{"text":"promise.executeBatch::executeStatement (cognitive 16): promise.executeBatch::executeStatement has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 5 (6 pts), error handling 1, 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. This shape REPEATS in the file: one other method here (promise.executeBatch) 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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9767e70aea3f66ef75b429314ded488b96370e50e24d6330aae74317ab3287"}},{"ruleId":"D2","level":"warning","message":{"text":"args.encodeSqlArgs (cognitive 16): args.encodeSqlArgs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 2 (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":"serverless/javascript/src/args.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"790b78d1b8eb7c09364a8df3f1106fed3426e14682f436f3ab1c9a6a279763bb"}},{"ruleId":"D2","level":"warning","message":{"text":"docker-entrypoint.simulator.run (cognitive 16): docker-entrypoint.simulator.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 3, error handling 2 (3 pts), ternaries 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":"testing/simulator/simulator-docker-runner/docker-entrypoint.simulator.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b9242dd48c46ccf5c58ae26400df223eb17a0d59961a5077b8cfc968ceb6de"}},{"ruleId":"D2","level":"warning","message":{"text":"logParse.extractExceptionInfo (cognitive 16): logParse.extractExceptionInfo has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/logParse.ts"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1519307e41db585e5d046d3b96e0712992cd1b11884b84e44f374f6786f0bb"}},{"ruleId":"D2","level":"warning","message":{"text":"docker-entrypoint.sqlancer.applyPatches (cognitive 16): docker-entrypoint.sqlancer.applyPatches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (13 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.ts"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e244a236522ee5d7cada9e5884515d80f12ee20f8841b027dca0a471d03e4940"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/execute.rs: FileTooLong \u2014 13172 significant 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 335 free functions. The bar is 500 significant lines; this is 12672 over it, 26.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d8675f3777b2e04813bd1669cac0106d1a1a01d07dfea00b150b1e40a8bafc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::explain::insn_to_row: FunctionTooLong \u2014 turso_core::vdbe::explain::insn_to_row runs 2484 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2384 over it, 24.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":"core/vdbe/explain.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"43469bcd2096e10085363eb6d813ef456dac84842ae2fb44fcb5664755adae50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/mod.rs: FileTooLong \u2014 6705 significant 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 6205 over it, 13.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fde9ed9d2d93babbd18331db4b883e13bf3409d45588a6403e52bd039efb593"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/btree.rs: FileTooLong \u2014 6688 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: BTreeCursor (7 blocks, 873-8159), declaring 31 free functions. The bar is 500 significant lines; this is 6188 over it, 13.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":"core/storage/btree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef75359d394624b0bf01b8720eebc0fd4729b3053a6160b70bd285fee193bba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/translator.rs: FileTooLong \u2014 6274 significant 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: PostgreSQLTranslator (2 blocks, 62-5628), declaring 113 free functions. The bar is 500 significant lines; this is 5774 over it, 12.55\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":"postgres/parser/translator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a8a3eff0bba849a179b2de6ad4a43f7e509fd010f9b704de6119a2cea3bc12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/schema.rs: FileTooLong \u2014 5960 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 5460 over it, 11.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":"core/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"791b87014db29a803d14c9c9179a01442d058092eede2fc0807ecca504709bad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::translate_alter_table: FunctionTooLong \u2014 turso_core::translate::alter::translate_alter_table runs 1181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1081 over it, 11.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff55bb0bb3798f20a7d7ebdc083bf59088e2b65b089239d51c93c814157ea8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::update::emit_update_insns: FunctionTooLong \u2014 turso_core::translate::emitter::update::emit_update_insns runs 1166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1066 over it, 11.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1c09ce72b91f743e1b6643a49a067572b62100bbcbb93f2f145bc53b156689"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Connection: TooManyMethods \u2014 327 methods, declared across 6 files: core/connection.rs (309), core/attach.rs (12), ext/mod.rs (3), ext/dynamic.rs (1), \u002B2 more file(s). The bar is 30 methods; this is 297 over it, 10.90\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbf3fff50ec2a0f40f2b102c2f3c9f34a74e19c85ae2d5e05d2e5981e20413f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BTreeCursor: ClassTooLong \u2014 4328 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 94 methods, 7 blocks, lines 873-8159. The bar is 400 significant lines; this is 3928 over it, 10.82\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":"core/storage/btree.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"774a4363f085583e62723a410f64c798e94b3a7db056656f61550917be7a5c86"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::translator::translate_function_call_expr: FunctionTooLong \u2014 turso_core::translate::expr::translator::translate_function_call_expr runs 1041 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 941 over it, 10.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2441b17a02a96a9e61e2fab37bea0d5ff10bfc9377cbdbbc1236599f2834b20"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MvStore: ClassTooLong \u2014 3806 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 200 methods, 3 blocks, lines 4370-10749. The bar is 400 significant lines; this is 3406 over it, 9.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":"core/mvcc/database/mod.rs"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5878d88ecbf8f5032ec97f439e3c14df725983d10dd61b9032fdede75f23667"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PostgreSQLTranslator: ClassTooLong \u2014 3795 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 81 methods, 2 blocks, lines 62-5628. The bar is 400 significant lines; this is 3395 over it, 9.49\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca45e7aed12be2e4e8e0b91b4bb1fb7b61afbc4da13c28e870721207779d6088"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::upsert::emit_upsert: FunctionTooLong \u2014 turso_core::translate::upsert::emit_upsert runs 902 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 802 over it, 9.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":"core/translate/upsert.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"00848711b9ffff0a678c1de65189716c504394b67ba928c8f10ca3ae3d639373"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 3593 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 160 methods, 3 blocks, lines 183-5563. The bar is 400 significant lines; this is 3193 over it, 8.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":"sqlite/parser/src/parser.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98862037964d22f7ff5693ff823b3731467f1fc164ed6f4e80152fd90ca3532"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/alter.rs: FileTooLong \u2014 4450 significant 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 74 free functions. The bar is 500 significant lines; this is 3950 over it, 8.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee0289092fa2ac519bd76618ea8f855661b4ae8ee35f1fa26ae641bb41f37a47"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_function: FunctionTooLong \u2014 turso_core::vdbe::execute::op_function runs 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) in one body. The bar is 100 significant lines; this is 790 over it, 8.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":"core/vdbe/execute.rs"},"region":{"startLine":10010}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbb5e3595f8cd617fe13cda5386f4fce1b80064750491b86434dc2a4498e5c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Property.interactions: MethodTooLong \u2014 interactions runs 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) in one body. The bar is 100 significant lines; this is 790 over it, 8.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":"testing/simulator/generation/property.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2046410d5cc171d53705359534395281051a67e2dfa716f9fd2481ab33acfdb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BTreeCursor.balance_non_root: MethodTooLong \u2014 balance_non_root runs 816 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 716 over it, 8.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":3604}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5883bf494219c01749de3f8bfade559e20c8a70554954a457d847288bccfa6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/pager.rs: FileTooLong \u2014 4043 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: Pager (2 blocks, 1610-6320). The bar is 500 significant lines; this is 3543 over it, 8.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":"core/storage/pager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dd1654606873b9e15bf9c90d954318eba537b173b5ca1f44072c7621056c14"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::pragma::query_pragma: FunctionTooLong \u2014 turso_core::translate::pragma::query_pragma runs 793 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 693 over it, 7.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/pragma.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dd83d820a5edb8f805926887f4f0a3452fd0b1dc0cc4f0846c94dae9f91ba1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::aggregate::emit_group_aggregate_rows: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::aggregate::emit_group_aggregate_rows runs 765 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 665 over it, 7.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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"beac18851bf447fe07ac8be7ad885c9fb221b4678ffc1e5d40fe4c80a5deaaa3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 3708 significant 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: Parser (3 blocks, 183-5563). The bar is 500 significant lines; this is 3208 over it, 7.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7487995824612e8debc2bc49646ba48c179fd5ccea347c1570fc0fa5bff4c828"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Connection: ClassTooLong \u2014 2949 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 327 methods, 3 blocks, lines 469-5410. The bar is 400 significant lines; this is 2549 over it, 7.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b05097a776ae05b8e9bcc1ac08e6a555a110cdb96bebb0ec44c50e9997ec52"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/wal.rs: FileTooLong \u2014 3673 significant 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 3173 over it, 7.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":"core/storage/wal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f1b6a1fe732dfaf07a47e655b65304d4a53aae7168179345c2838a0be09219"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckpointStateMachine.step_inner: MethodTooLong \u2014 step_inner runs 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) in one body. The bar is 100 significant lines; this is 620 over it, 7.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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e080bbfa27c6a701e5b31bb4402a39b90a14d0529f17958e2023b22e92e6d1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JDBC4ResultSet: TooManyMethods \u2014 215 methods. The bar is 30 methods; this is 185 over it, 7.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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b5329e4af3f05c209b5ea4b921098dbf6ff7b77bcaf056c554a0ce844bc501"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::insert::translate_insert: FunctionTooLong \u2014 turso_core::translate::insert::translate_insert runs 705 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 605 over it, 7.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":"core/translate/insert.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"588dafed8cd12c31c7bfdd5fac69fd332065548256e3f729b2fbd03ac437ef6e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Pager: ClassTooLong \u2014 2794 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 149 methods, 2 blocks, lines 1610-6320. The bar is 400 significant lines; this is 2394 over it, 6.99\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadc0357cc25feb263ee4d54cfe5a8f1671d01b8ab779da20ec506e95d6c2475"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseSyncEngine.apply_changes_internal: MethodTooLong \u2014 apply_changes_internal runs 691 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 591 over it, 6.91\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f342324cd987f5ffbb1bf48629f8ede3e685192b42ed2efdacc6c6281048ee7c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MvStore: TooManyMethods \u2014 200 methods. The bar is 30 methods; this is 170 over it, 6.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"a35c2a2282694010a19674e7b18d0491cae6f91fd28aaceda433e7599aaea853"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/mod.rs: FileTooLong \u2014 3309 significant 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 57 free functions. The bar is 500 significant lines; this is 2809 over it, 6.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":"core/translate/optimizer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2a63ea451ed20c4c27b088310a0549722e01b27836bd6d6a4afb21efb7cdb2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/connection.rs: FileTooLong \u2014 3270 significant 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: Connection (3 blocks, 469-5410). The bar is 500 significant lines; this is 2770 over it, 6.54\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":"core/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72e8b037acc1105e3b5c4cc476d9373ccb46f30252cc0c5506b0eed692895c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frontend/catalog.rs: FileTooLong \u2014 3163 significant 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 2663 over it, 6.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":"postgres/frontend/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90eb9401ed33b1797cf67e89c664e4146f91435f11997449d115494fc03e2573"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::dialect::engine::call_builtin_scalar: FunctionTooLong \u2014 turso_core::dialect::engine::call_builtin_scalar runs 632 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 532 over it, 6.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":"core/dialect/engine.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cb9469768c08594055552e796e825815bae86fd769b631e356e1f2ccfee14a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/insert.rs: FileTooLong \u2014 3152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 2652 over it, 6.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82455665ebb81f6f2a4704bf6d8501643cd9e8fd13c91ec20ee316a95fa2db1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/util.rs: FileTooLong \u2014 3089 significant 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 99 free functions. The bar is 500 significant lines; this is 2589 over it, 6.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":"core/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7885eea22a053092eb5bd6883a65241bcc0b9ee6ad495d203df7a6e58ab7a34"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::set_op::emit_deduplicating_set_op: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::set_op::emit_deduplicating_set_op runs 617 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 517 over it, 6.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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c85bbf93cf02fa456077e4f0e882fc0470485a04b106531d316323b6d921c1c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JDBC4DatabaseMetaData: TooManyMethods \u2014 177 methods. The bar is 30 methods; this is 147 over it, 5.90\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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4DatabaseMetaData.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ebcd6015de4c8b03036b87e67fd7864c2eb5f6d55e93489ed980ed6d096199"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Schema: ClassTooLong \u2014 2272 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 154 methods, 5 blocks, lines 1269-5120. The bar is 400 significant lines; this is 1872 over it, 5.68\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b20f4c949de5b92e97dec05e84b8beb7f1136e8f52d03d93a565263b6f4ce82"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Stmt.to_tokens: MethodTooLong \u2014 to_tokens runs 568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 468 over it, 5.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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b0ec022f288183763ab12c4982909eade33865f53d7de8f9fddb71f01dc14f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/database_sync_operations.rs: FileTooLong \u2014 2812 significant 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 96 free functions. The bar is 500 significant lines; this is 2312 over it, 5.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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72721b57dab89f2d7fe151495f0d4be364fa9335c21c3a4231286cb2010d0f3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/jsonb.rs: FileTooLong \u2014 2726 significant 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: Jsonb (4 blocks, 189-3518). The bar is 500 significant lines; this is 2226 over it, 5.45\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e2d96ead0bb12fc32fd08d93664b872dbf8490d2550b9acad59ed519e4cfea"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/plan.rs: FileTooLong \u2014 2701 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 2201 over it, 5.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d951857159daf3912236d3a5889b911d5c3874fe34ee303fd24560f5cfde878d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/mod.rs: FileTooLong \u2014 2688 significant 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 2188 over it, 5.38\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3f67b423f36e4227e00a70a7f17a49e24a44ac22a7328eea7fdcb4b420d7b3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 160 methods. The bar is 30 methods; this is 130 over it, 5.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":"sqlite/parser/src/parser.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7ff5ef5c15a15413405a8864ba5e01538740b3d0f83d52b6bbfeec50e2bddc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/translator.rs: FileTooLong \u2014 2591 significant 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 2091 over it, 5.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":"core/translate/expr/translator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada86e3e2263abb0d50ad86d918dd83d1c6f6c4175c2d329e554aeed50f5f7b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/schema.rs: FileTooLong \u2014 2577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 2077 over it, 5.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":"core/translate/schema.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6884647d3f1529c4fa306a820891db317d8218c087fb0da66e09f25bb8fae58d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Schema: TooManyMethods \u2014 154 methods. The bar is 30 methods; this is 124 over it, 5.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":"core/schema.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b10cafb11ee0df93a440e7e133407d808b9efdceef14a40ba5eae8369f801b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/explain.rs: FileTooLong \u2014 2559 significant 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 2059 over it, 5.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":"core/vdbe/explain.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e720759bbfe4fd79b28db4c5b582c9c8f919503fe1066602244faf9c19b5a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/window.rs: FileTooLong \u2014 2541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 2041 over it, 5.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd3a71fa36c96dec8fd2b48323c6c9817f933c5c152da265858203aeeb7867f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Pager: TooManyMethods \u2014 149 methods. The bar is 30 methods; this is 119 over it, 4.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bb1827973772cc29f8e794f404c68b2898d4c5f9e6355e0da5d98eb8fdaa4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: database/checkpoint_state_machine.rs: FileTooLong \u2014 2480 significant 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: CheckpointStateMachine (4 blocks, 287-3683). The bar is 500 significant lines; this is 1980 over it, 4.96\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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45e45cde1c9521d2e7862277f85c5a3689e0cda8e93e15fe30484c5cb3f9be7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::schema::translate_drop_table: FunctionTooLong \u2014 turso_core::translate::schema::translate_drop_table runs 496 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 396 over it, 4.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":2199}}}],"partialFingerprints":{"codehealthFindingId/v1":"e494390458deb3921c8c2d85260720c2155c0c50a48ef1945e21435dd744d501"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Database: ClassTooLong \u2014 1983 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 81 methods, 4 blocks, lines 683-3687. The bar is 400 significant lines; this is 1583 over it, 4.96\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fdde64279d93e278d8cbe163effb4318d67c44c7ff0b6dde95edf538badd1fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2478 significant 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 184 free functions. The bar is 500 significant lines; this is 1978 over it, 4.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":"bindings/c/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8992478bc1492df0dacff6cb4c28262538f57b1e0b357037aa94f1bd873def2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/database.rs: FileTooLong \u2014 2403 significant 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: Database (4 blocks, 683-3687). The bar is 500 significant lines; this is 1903 over it, 4.81\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":"core/database.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f64fbb8354d4a7d018ccbdf751f1840fafd493f7e4e0784579e1b4092e7e34"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/types.rs: FileTooLong \u2014 2391 significant 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 1891 over it, 4.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":"core/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23126ae2718a6589e6268bb8def491dc96aa263815ca522ecad44dea890629e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/planner.rs: FileTooLong \u2014 2383 significant 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 48 free functions. The bar is 500 significant lines; this is 1883 over it, 4.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7593262bf7ce5760c3a909261b65f05a5cfe19ee161ad22fda00bfde9f63605"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CheckpointStateMachine: ClassTooLong \u2014 1881 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 50 methods, 4 blocks, lines 287-3683. The bar is 400 significant lines; this is 1481 over it, 4.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db85e92551f47c2156e34c37ee84b64ea00f883bba9b622ebc342928e64f187"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::constraints::constraints_from_where_clause: FunctionTooLong \u2014 turso_core::translate::optimizer::constraints::constraints_from_where_clause runs 462 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 362 over it, 4.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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7848dc091100a25cbccf5e948d95a568b1fcb370940bdf210247fdb9ac0050b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::select::prepare_one_select_plan: FunctionTooLong \u2014 turso_core::translate::select::prepare_one_select_plan runs 462 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 362 over it, 4.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":"core/translate/select.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ba4b08ce58ca1e901ed015ffc0a343c410a23816abe955073f849de623a78a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: persistent_storage/logical_log.rs: FileTooLong \u2014 2277 significant 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 1777 over it, 4.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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60738eedcf7f89b9a1d0132c73483f7df9abc85f427a5c4525da197927d47a07"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ast/fmt.rs: FileTooLong \u2014 2268 significant 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 1768 over it, 4.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efb37a0e25c28321bf535fda08d4a2d60afba80e36fe1df4783b2fe7ff72547"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 1810 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 81 methods, 2 blocks, lines 10-2759. The bar is 400 significant lines; this is 1410 over it, 4.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":"postgres/parser/parser.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dfb4514e5774d4a304bc7f0472329374abc3c266c2cc33c10309eeb664fd9cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::schema::create_table: FunctionTooLong \u2014 turso_core::schema::create_table runs 450 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 350 over it, 4.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":"core/schema.rs"},"region":{"startLine":7144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01fbe7f3476eedebde9630e4e8648c9c01e00440b1aaa1f0dab5f6ebc88f4b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqliteConnection: TooManyMethods \u2014 977 significant lines (blank, comment-only and punctuation-only lines excluded), 134 methods, declared across 4 files: Turso.Data.Sqlite/SqliteConnection.cs (90), Turso.Data.Sqlite/SqliteConnection.Functions.cs (26), Turso.Data.Sqlite/SqliteConnection.Aggregates.cs (14), Turso.Data.Sqlite/SqliteConnection.Collations.cs (4). The bar is 30 methods; this is 104 over it, 4.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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f7e43f850b0b6114230dce8cc1b00d67e00ec5a22c8a2411dbd33d02593fc81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/hash_table.rs: FileTooLong \u2014 2229 significant 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: HashTable (2 blocks, 946-3410). The bar is 500 significant lines; this is 1729 over it, 4.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"35172b044b32c53840360a33b66665006e75c68e09d9f8a9fec8debccf8ea69c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/database_sync_engine.rs: FileTooLong \u2014 2212 significant 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: DatabaseSyncEngine (2 blocks, 122-3223), declaring 35 free functions. The bar is 500 significant lines; this is 1712 over it, 4.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21073e7ad501e5de3141931fc82bb435f405bff7a80714541eeeee587ae9fac0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VectorSparseInvertedIndexMethodCursor.query_start: MethodTooLong \u2014 query_start runs 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 330 over it, 4.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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"547a8567679ea9a2b3d2e959bf2a9d25e176afa03432e80f1713b36cd41a0944"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Jsonb: ClassTooLong \u2014 1692 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 54 methods, 4 blocks, lines 189-3518. The bar is 400 significant lines; this is 1292 over it, 4.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":"core/json/jsonb.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64249e5814eaad7da0a1f3729f660f9afbdf91e811c532d5fa42f75038ae76a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::join::join_lhs_and_rhs: FunctionTooLong \u2014 turso_core::translate::optimizer::join::join_lhs_and_rhs runs 421 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 321 over it, 4.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":"core/translate/optimizer/join.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7b201a18dbfd6c207a0eaa5df96f9fe4218aac36330020822071a563d03eb2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatabaseSyncEngine: ClassTooLong \u2014 1634 significant 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 122-3223. The bar is 400 significant lines; this is 1234 over it, 4.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b45aa24b0090339632bc4203b14ba360e4c0d00be05af4e78c2b2cc4598489"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::join::emit_semi_or_anti_join: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::join::emit_semi_or_anti_join runs 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) in one body. The bar is 100 significant lines; this is 307 over it, 4.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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"676e59d30c738f9b6ef16fc227643f40f172e5aac3fb48909cbba7aa7f269e54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_transaction_inner: FunctionTooLong \u2014 turso_core::vdbe::execute::op_transaction_inner runs 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) in one body. The bar is 100 significant lines; this is 306 over it, 4.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":"core/vdbe/execute.rs"},"region":{"startLine":4529}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed731e098dc12ffe218b99ed2186262487e31e9ea48d58c99a2c21426e2695c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MvStore.recover_process_frame: MethodTooLong \u2014 recover_process_frame runs 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) in one body. The bar is 100 significant lines; this is 304 over it, 4.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":"core/mvcc/database/mod.rs"},"region":{"startLine":9881}}}],"partialFingerprints":{"codehealthFindingId/v1":"2415da95c269aef3e483f6014600a4b4c53e4cbf4d7e4d8299700546642ae1dd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: HashTable: ClassTooLong \u2014 1615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 58 methods, 2 blocks, lines 946-3410. The bar is 400 significant lines; this is 1215 over it, 4.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":"core/vdbe/hash_table.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aca97590030dff487557af75f028a75b8d5a2259f5ec3789b23c15a1b7e6695"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/fkeys.rs: FileTooLong \u2014 1999 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 1499 over it, 4.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":"core/translate/fkeys.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e235ead4d5a40f0142d8c5b4775bfeb910b41c0949a5504fab4bc1ef4bba9f14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generation/property.rs: FileTooLong \u2014 1993 significant 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 32 free functions. The bar is 500 significant lines; this is 1493 over it, 3.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":"testing/simulator/generation/property.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6641a53aad2d8d4b5e79396020155856620a2485df9a66522e7543a65c297b54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::pragma::update_pragma: FunctionTooLong \u2014 turso_core::translate::pragma::update_pragma runs 398 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 298 over it, 3.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/pragma.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfe54977957e91d6b64105278114138170cd6e8c62b869cd14bd229a72c58f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProgramBuilder: TooManyMethods \u2014 118 methods. The bar is 30 methods; this is 88 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":"core/vdbe/builder.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b50980633742550acfd478dab323a3217e0f6c241550bb23f6ef3bea6328db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emitter/update.rs: FileTooLong \u2014 1953 significant 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 1453 over it, 3.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":"core/translate/emitter/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4903452a0a1710179687b8ad58b58b2084e1c1190be41aba5c4c6d4905bb9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::apply_table_access_plan: FunctionTooLong \u2014 turso_core::translate::optimizer::apply_table_access_plan runs 386 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 286 over it, 3.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"789eb62b3bb00d63d3cc4a5615c72f9fcf4ad86d8898c4c635a225b3b82b2cb8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/shared_wal_coordination.rs: FileTooLong \u2014 1895 significant 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 1395 over it, 3.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f7340c7374d823a75bf0cfc8d7ec4967ad62e739a47d3fc7ac5376d995d12f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SequenceCorrectnessProperty.finish_op: MethodTooLong \u2014 finish_op runs 377 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67a98cad94faec45c000086aeb9996279362e0f1852f275e0dcf937d7800c5f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InitLoop.emit: MethodTooLong \u2014 emit runs 373 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 273 over it, 3.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/init.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b8b83cf0217b673792ef04773942e5e6e5593dcfd623aeb32510f687c62e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::storage::btree::integrity_check: FunctionTooLong \u2014 turso_core::storage::btree::integrity_check runs 363 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 263 over it, 3.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":8405}}}],"partialFingerprints":{"codehealthFindingId/v1":"44590aba6925f97d4defbd50e1dc89ee93fcd43e078dcf9ed5d709eb61ced4a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/parser.rs: FileTooLong \u2014 1814 significant 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 100% of them inside a single declaration: Parser (2 blocks, 10-2759). The bar is 500 significant lines; this is 1314 over it, 3.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":"postgres/parser/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75829a6cfe4df345160da5a2cf9408abad01d68b91fc4110dfeee4754e4649d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/subquery.rs: FileTooLong \u2014 1808 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 1308 over it, 3.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":"core/translate/subquery.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9f93aad1c5eb4ac20b2565c15121f583072dd962ba14794a03f2ef55579ff8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::translate_statement: FunctionTooLong \u2014 turso_core::translate::translate_statement runs 360 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 260 over it, 3.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":"core/translate/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a767bede537e2718f1ac43a7604f55b5715489c36314c22e9c2df48d66a8f790"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommitStateMachine.step: MethodTooLong \u2014 step runs 355 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 255 over it, 3.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"33509b5054da27b4d3493cceb2ae9abdcadc1a12b8c880336bf0f6aa08dba619"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::subquery::get_subquery_parser: FunctionTooLong \u2014 turso_core::translate::subquery::get_subquery_parser runs 354 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 254 over it, 3.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":"core/translate/subquery.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb5d0e32ef7ea2af4e97701d8a8c1d09b2699f03dcb28a5daa2747b39097e8d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Limbo: ClassTooLong \u2014 1366 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 67 methods, 3 blocks, lines 137-2364. The bar is 400 significant lines; this is 966 over it, 3.42\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":"cli/app.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9b61fe3142d9d7efffed513c63a1a0e2a95865f863c8143290ce93b37937b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::arrangement::emit_output_arrangement: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::arrangement::emit_output_arrangement runs 338 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 238 over it, 3.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc71790cef38f1fbbbfaf494c86c2c1ac19ad88c0e8079ce65972a927cca369"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frontend/session.rs: FileTooLong \u2014 1673 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 59 free functions. The bar is 500 significant lines; this is 1173 over it, 3.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":"postgres/frontend/session.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0fc170ee3a58fdae66b39edba3fee195de25bf9f59629c862953223e35d04c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emitter/mod.rs: FileTooLong \u2014 1670 significant 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 1170 over it, 3.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"316fc7ffbd3707368dc157ce0a396eb4c7a113dd6193ffb0473c437155a79352"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/join.rs: FileTooLong \u2014 1663 significant 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 1163 over it, 3.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":"core/translate/optimizer/join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fca47b0a528d21d819017a2cbc885e0a27e05b519598ad6682b883ae4ff8f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/constraints.rs: FileTooLong \u2014 1651 significant 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 1151 over it, 3.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de258b1851ca6aa7a5895e3f15113cacc9a16f5b63e3b4ccf825b6420274905a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::integrity_check::translate_integrity_check_for_schema: FunctionTooLong \u2014 turso_core::translate::integrity_check::translate_integrity_check_for_schema runs 330 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 230 over it, 3.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":"core/translate/integrity_check.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c37ae19708399c9fe0ccc94d21625ef365dd55416824a281b55ea800f5d7d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::schema::translate_create_table: FunctionTooLong \u2014 turso_core::translate::schema::translate_create_table runs 329 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 229 over it, 3.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":"core/translate/schema.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2559024406c17eface9b1a84011864aefb3f42284e7d9b3bf041a53af8f3a12d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/app.rs: FileTooLong \u2014 1631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: Limbo (3 blocks, 137-2364). The bar is 500 significant lines; this is 1131 over it, 3.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":"cli/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e7112567176bd7a7dac8e81c2902d9df80244f9be3f1787962f898460fc3f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/builder.rs: FileTooLong \u2014 1628 significant 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: ProgramBuilder (2 blocks, 282-2649). The bar is 500 significant lines; this is 1128 over it, 3.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":"core/vdbe/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"364635a2b51bba5a5251183e3023b572c003c2ecafc6ffe77892873cceac19cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/pragma.rs: FileTooLong \u2014 1621 significant 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 1121 over it, 3.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":"core/translate/pragma.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f879f71d62938498e5d9485b0aef107a294a404d99b3e1c55bf35ba595dee51f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StreamingLogicalLogReader: ClassTooLong \u2014 1286 significant 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. The bar is 400 significant lines; this is 886 over it, 3.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"c635bbc566892f1681661a9582f037bd7691921b4e07c8948c5f5a9fc5257e38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/function.rs: FileTooLong \u2014 1604 significant 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 1104 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":"core/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc4298d14204b0941695cbd41374a8a93c7d0508b4bbf7258b1d7dbcc88362e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::dialect::engine::resolve_builtin_function_name: FunctionTooLong \u2014 turso_core::dialect::engine::resolve_builtin_function_name runs 318 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 218 over it, 3.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/dialect/engine.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c3180174af1301fabca67322f5b2020bd02f13b3249ac921e654d810d98719"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmitWindow.emit_window_step: MethodTooLong \u2014 emit_window_step runs 316 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 216 over it, 3.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":"core/translate/window.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"befc15332e8b7a059b8ee5d0bf3c497cc11da7c480a77aff8907cb8c0f808edf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BTreeCursor: TooManyMethods \u2014 94 methods. The bar is 30 methods; this is 64 over it, 3.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":"core/storage/btree.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbea2b5a9a54db2c74dc4412ea7fb9f91122abdbe307db62634a33937940fce"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/access_method.rs: FileTooLong \u2014 1564 significant 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 1064 over it, 3.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/access_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e263bfa9ee2861c0c97fd18a83c3f93219bef49e0fb29548c842ebc81477ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_insert: FunctionTooLong \u2014 turso_core::vdbe::execute::op_insert runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 211 over it, 3.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":"core/vdbe/execute.rs"},"region":{"startLine":11687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46acca3c7bf4d0adcd39ff48508fdfa7fe9256e4737c81f2fe59ceabf05396c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_pg::catalog::register_catalog_modules: FunctionTooLong \u2014 turso_pg::catalog::register_catalog_modules runs 311 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 211 over it, 3.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":"postgres/frontend/catalog.rs"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbb714602f16b2f9a364618cdf179f49a4e3367d8d926ebccd3c4436aa8c750"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProgramBuilder: ClassTooLong \u2014 1241 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 118 methods, 2 blocks, lines 282-2649. The bar is 400 significant lines; this is 841 over it, 3.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":"core/vdbe/builder.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c19e00ccb8bce414d620ce231a26716f69028f64dce424b001593e5b8d5125b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MappedSharedWalCoordination: TooManyMethods \u2014 93 methods. The bar is 30 methods; this is 63 over it, 3.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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbabeaf4932eb36d980d71813d1913af82c0d888b2aa63495fbd1ad96817e8cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/sqlite3_ondisk.rs: FileTooLong \u2014 1550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 1050 over it, 3.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"018fb5f6e3998e324a8095921761781d1edde0edc628e62a664af1fc16a7e2d2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Jsonb.navigate_to_segment: MethodTooLong \u2014 navigate_to_segment runs 310 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 210 over it, 3.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebaa530fd9ba3e0e7a12d4a52489ff2c280750c18fcb7240a5d637616677b9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/vacuum.rs: FileTooLong \u2014 1510 significant 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 1010 over it, 3.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":"core/vdbe/vacuum.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9e5bf8d30deffc26991e09f9929e0619f47f29a5e0a356b03d136ce791baa03"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgreSQLTranslator.translate_expr: MethodTooLong \u2014 translate_expr runs 302 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7852dbae09326b7d5ce45a921983a12ef44959086ea57a0f38a4c99288af7b1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/insn.rs: FileTooLong \u2014 1509 significant 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: Insn (2 blocks, 573-2773). The bar is 500 significant lines; this is 1009 over it, 3.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":"core/vdbe/insn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2530ff6186916a56169eb0019c1c3737f3b4d46b6ce441165bc34129798b28e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CommitStateMachine: ClassTooLong \u2014 1202 significant 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, 6 blocks, lines 1618-3776. The bar is 400 significant lines; this is 802 over it, 3.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":"core/mvcc/database/mod.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd71bd7b2a187fc58ce71bf3b94a7a7808f65f2211edcddbfca1876e53036b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast.rs: FileTooLong \u2014 1497 significant 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 997 over it, 2.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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d49080845465bd32c5db90228dafd62f1b5c9c58a8c01ef666276905d3fc1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mvcc/cursor.rs: FileTooLong \u2014 1491 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: MvccLazyCursor (6 blocks, 156-2408). The bar is 500 significant lines; this is 991 over it, 2.98\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7677f5ea651ebe015e9ad0602a99e47e160774011246ddddb660685a13a252"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MvccLazyCursor: ClassTooLong \u2014 1182 significant 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, 6 blocks, lines 156-2408. The bar is 400 significant lines; this is 782 over it, 2.96\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e82d2cab8c1279eb33993fc17eb23abe0f401bacb29f5b177a1aa52a4d06381"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::planner::parse_table: FunctionTooLong \u2014 turso_core::translate::planner::parse_table runs 293 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76ab1da91cad5804ef50dc577a0b8ff7bb1876e5db6b0083c106387ea920513"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BTreeCursor.post_balance_non_root_validation: MethodTooLong \u2014 post_balance_non_root_validation runs 289 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 189 over it, 2.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":"core/storage/btree.rs"},"region":{"startLine":4991}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea0d5c2dcb934e1827ddc81dd85bcd2a24925c6e0e9b6f2773f1b697411f487"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqliteDataReader: TooManyMethods \u2014 993 significant lines (blank, comment-only and punctuation-only lines excluded), 86 methods. The bar is 30 methods; this is 56 over it, 2.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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"918e50dc868e74ebaf1d2f6e6897135df29b0dbf7d1d1747e4f3c801e19950be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrent-simulator/properties.rs: FileTooLong \u2014 1421 significant 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 921 over it, 2.84\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d026ecdc53d2c72627e51c5fb638e82c9fd4065dd1008d5277fd4bd6b87a694"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::update::emit_program_for_update: FunctionTooLong \u2014 turso_core::translate::emitter::update::emit_program_for_update runs 283 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 183 over it, 2.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":"core/translate/emitter/update.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"578b9ac2c2e339d8266a5c9e6411f2d3321107703720300a61ce3d8c843f8dc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::join::compute_best_join_order_with_context: FunctionTooLong \u2014 turso_core::translate::optimizer::join::compute_best_join_order_with_context runs 280 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 180 over it, 2.80\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/join.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3ab6684d3ee2d043ab069a4a2bff572b5d8c7f699c91b2d320f41731ab8a24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/upsert.rs: FileTooLong \u2014 1390 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 890 over it, 2.78\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/upsert.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb1e85e6e55a114cbfa0143259fb0128033abd91dd105f6b7368ba4e881bfc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Program: ClassTooLong \u2014 1109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 34 methods, 5 blocks, lines 1257-4119. The bar is 400 significant lines; this is 709 over it, 2.77\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":"core/vdbe/mod.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1446945be07b6d8b1ff7c410dabc15920dfce872d5ebd21007c0f2713d289772"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Connection: TooManyFields \u2014 83 stored fields beside 327 methods. The bar is 30 stored fields; this is 53 over it, 2.77\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":"core/connection.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c031429fa5d70bb4cd2ce76179a01958e2737bffcb0ee227e6bacf6d5d84381c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/select.rs: FileTooLong \u2014 1375 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 875 over it, 2.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11bc2da5c62956ecd132ab2b4e937cb916d859c4aec4d65a2ca4b2e0193bbcb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generate/select.rs: FileTooLong \u2014 1370 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 870 over it, 2.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":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76331b6f586b2fb4601ba0225bc954764e4e3eb03e4ed649f6c60815c4b56f17"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Database: TooManyMethods \u2014 81 methods, declared across 2 files: core/database.rs (79), ext/mod.rs (2). The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af001d5e86847d74f310aea06ba88c9ab4f5fdfd63f7b3c9427eaa797695a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Value: TooManyMethods \u2014 81 methods, declared across 2 files: vdbe/value.rs (59), core/types.rs (22). The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/types.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6f10dd9f014fca36405751e5dc505fa7b189dd84eb57f64daa44f03e3f2e04"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Parser: TooManyMethods \u2014 81 methods. The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1c6b29f281d2aa9d05ea3b4addf82d7302803f0bfa48692040f7f42ca6ab48"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PostgreSQLTranslator: TooManyMethods \u2014 81 methods. The bar is 30 methods; this is 51 over it, 2.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d52464893069ca72ab7b5de1b8b348b0dd83153ecf5148dce20b9cad90e3a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pager.checkpoint_inner: MethodTooLong \u2014 checkpoint_inner runs 269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 169 over it, 2.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":"core/storage/pager.rs"},"region":{"startLine":5066}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f0ed62fe407f968fdb0590dc7f7486aa6da69d79b197407c880527c98e73af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_pg::classes::translate_catalog_changes: FunctionTooLong \u2014 turso_pg::classes::translate_catalog_changes runs 265 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 165 over it, 2.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":"postgres/frontend/classes.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c1cb9bdb0e070093178b3ead442fcf2fd02049f8ef3adde16750d2edee06c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/policy.rs: FileTooLong \u2014 1319 significant 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 819 over it, 2.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/policy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93ac1667d79c33c9d092753d8bc71f610a08403a70721c4e60004f03954a0fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe_maintenance/plan.rs: FileTooLong \u2014 1304 significant 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 804 over it, 2.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00851ffc7ad4fab5a7ce05e9a006e1daf29b583d5549041deb6ea1d362a2496"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frontend/functions.rs: FileTooLong \u2014 1297 significant 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 53 free functions. The bar is 500 significant lines; this is 797 over it, 2.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/functions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78992b0a1c27081f1ab815d75b91102fc6615ec47f3765eab0fbc00c327f70da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frontend/classes.rs: FileTooLong \u2014 1283 significant 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 42 free functions. The bar is 500 significant lines; this is 783 over it, 2.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/classes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da8f24713e4fc10365a90433bef021a2ece1dcc3d493242ec0c7179e1e70a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::fkeys::emit_fk_child_update_counters: FunctionTooLong \u2014 turso_core::translate::fkeys::emit_fk_child_update_counters runs 256 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 156 over it, 2.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":"core/translate/fkeys.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0679a035227bb528f8635d95eb209afe850d5c92269014493af68d0b8e1f186"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::main_loop::open::emit_table_read_start: FunctionTooLong \u2014 turso_core::translate::main_loop::open::emit_table_read_start runs 255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 155 over it, 2.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":"core/translate/main_loop/open.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"8518b57e0e63493df931ef18f89cbc97ee0e7cc3f973bb1046fceb6b0a3131f8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Program.abort: MethodTooLong \u2014 abort runs 255 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 155 over it, 2.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":"core/vdbe/mod.rs"},"region":{"startLine":3546}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb77697fc0790c2252b557f6eb24027b7cf26e673c6d2a61a9c06996e1e20b4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ast.rs: FileTooLong \u2014 1263 significant 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 763 over it, 2.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d567074e2785faf6ed884fc9a758d1159f0a3a04effd34e088b01b5411c9f01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::aggregation::translate_aggregation_step: FunctionTooLong \u2014 turso_core::translate::aggregation::translate_aggregation_step runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/aggregation.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"150f59173098be331c77b7aa10a2327f13075476af1900f326eb7edec5fd2c72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generator/mod.rs: FileTooLong \u2014 1250 significant 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 38 free functions. The bar is 500 significant lines; this is 750 over it, 2.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":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"184c65c72c15cb07e99c8ba725162b365586b981255b93ce6cd4870f623eca81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.header_validation: MethodTooLong \u2014 header_validation runs 250 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 150 over it, 2.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":"core/database.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ea32c744420063cfdbacd0c9c65df0bfd0315911f4dd7357de36d7244ab762"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_stress::async_main: FunctionTooLong \u2014 turso_stress::async_main runs 249 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/stress/main.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedcc4aef6bc6071665cbf45d4c8424a6bff27df8087befcd62612d5508c456e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PgConstraintTable.load_rows: MethodTooLong \u2014 load_rows runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 148 over it, 2.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":"postgres/frontend/catalog.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eda843366cbd64213b14f907bf6bf91c627830fca55575a67308e17ebcfcb8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrent-simulator/lib.rs: FileTooLong \u2014 1239 significant 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 739 over it, 2.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4ec0c4b2da9f0b5d4c8e792edb9f069ab0ae8395c67a3b558be3ecf08fe6a1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::result_row::emit_columns_to_destination: FunctionTooLong \u2014 turso_core::translate::result_row::emit_columns_to_destination runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/result_row.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"526e2b539bce7eeb3b0b628b8efb38455e4f3239ff6a69c382b3446e809ec4ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_macros::ext::vtab_derive::derive_vtab_module: FunctionTooLong \u2014 turso_macros::ext::vtab_derive::derive_vtab_module runs 247 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 147 over it, 2.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macros/src/ext/vtab_derive.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b568eb1e3c8a2e2d894809da502ba13784535d85e7322ab300040a10482dc70"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: index_method/toy_vector_sparse_ivf.rs: FileTooLong \u2014 1228 significant 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: VectorSparseInvertedIndexMethodCursor (3 blocks, 301-1635). The bar is 500 significant lines; this is 728 over it, 2.46\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b770af8c03788bad6ac07cbce18f4808f1f301d19ffe372c3dee917f0c1fa44d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BTreeCursor.delete: MethodTooLong \u2014 delete runs 245 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 145 over it, 2.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":7041}}}],"partialFingerprints":{"codehealthFindingId/v1":"90acb5b7a4995403064551261cba2218ae44dbfd5447315207b53612037bccac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/index.rs: FileTooLong \u2014 1218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 718 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e57efcbe1a0a3a3100b2ffe6eccd0259a0b9e9d8b0f3ac56a5b25bcd5e0095"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Statement: 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":"core/statement.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"00907623d257c00a2c240217a9504d502853f023d40bde9295313ff4ffe1266d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::view::translate_drop_view: FunctionTooLong \u2014 turso_core::translate::view::translate_drop_view runs 240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 140 over it, 2.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":"core/translate/view.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e269631a795155265873300b5c9dc5f7bc575daf0f06640ec76ce3a842ff37d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::index::emit_refill_index: FunctionTooLong \u2014 turso_core::translate::index::emit_refill_index runs 239 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 139 over it, 2.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":"core/translate/index.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c319c7a6baf47424ce873bb8337f509d8d39b3ca9e4d09552573aa043375c37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::access_method::find_best_access_method_for_btree: FunctionTooLong \u2014 turso_core::translate::optimizer::access_method::find_best_access_method_for_btree runs 238 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/access_method.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"0570dfe375371abad503b303c9df7bcd034f860043e18dc04152fd63085dfb9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::update_agg_payload: FunctionTooLong \u2014 turso_core::vdbe::execute::update_agg_payload runs 237 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 137 over it, 2.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":"core/vdbe/execute.rs"},"region":{"startLine":7441}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f52971e324c695e1c09f5f9d89a764af1811959d15472a0243b44e50a75ea4b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rsapi.rs: FileTooLong \u2014 1182 significant 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 682 over it, 2.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk-kit/src/rsapi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b837181827710f0a4b01feb5000ee7cedffe6172084630e37b750daa2c4f26d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::compound_select::emit_compound_select: FunctionTooLong \u2014 turso_core::translate::compound_select::emit_compound_select runs 236 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 136 over it, 2.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":"core/translate/compound_select.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4ea0cfa4d00992f572dcba5985acc84e7dd4a39f5af94d7a62863a10ccca13"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: VectorSparseInvertedIndexMethodCursor: ClassTooLong \u2014 941 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 3 blocks, lines 301-1635. The bar is 400 significant lines; this is 541 over it, 2.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"868cd97f10db069e1854e0afbd2f91fd43f13e24a252cbb9994c732fa9281afc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::translator::translate_column_expr: FunctionTooLong \u2014 turso_core::translate::expr::translator::translate_column_expr runs 234 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 134 over it, 2.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":"core/translate/expr/translator.rs"},"region":{"startLine":2623}}}],"partialFingerprints":{"codehealthFindingId/v1":"d20c37b3c0478012a37f08c876797e13e77b78d01fb66106dbd6823b9e1eb92c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner/env.rs: FileTooLong \u2014 1167 significant 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 667 over it, 2.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":"testing/simulator/runner/env.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0a7d8572f780500cd12b33a2d1a0b63a85ccad953164c62e2e63de15f18ca4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/value.rs: FileTooLong \u2014 1143 significant 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: Value (201-1584). The bar is 500 significant lines; this is 643 over it, 2.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":"core/vdbe/value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfe9540561c03ecbb37cb95dfc12f2883aaf56fe5827707fd332375d7b8eec1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generate/stmt.rs: FileTooLong \u2014 1143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 44 free functions. The bar is 500 significant lines; this is 643 over it, 2.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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27e34f5999fd2f85a01d5ac88dacfe2f0790c15a88fb11e1b1d715321e67186"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.do_open_async_internal: MethodTooLong \u2014 do_open_async_internal runs 228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 128 over it, 2.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":1572}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbadbfda1944055c341003d010a0fef91c816b0bbb75cdfa4532e31494c64c4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Insn: ClassTooLong \u2014 908 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 2 blocks, lines 573-2773. The bar is 400 significant lines; this is 508 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":"core/vdbe/insn.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a4fd17e64d232b7c22f66de9f2132693f10259b1aad3e9ce3eb3309b91f970"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::main_loop::body::emit_loop_source: FunctionTooLong \u2014 turso_core::translate::main_loop::body::emit_loop_source 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":"core/translate/main_loop/body.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef159665dcf9da0ddbb1057819641a018956cb7acf2c4124489d9ff8efe50d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::find_table_access_plan: FunctionTooLong \u2014 turso_core::translate::optimizer::find_table_access_plan 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e7f66f9b356da4a09efdb576e9cf0dc09366742fb2990b6e027de5829e4a53"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::binary::emit_binary_insn: FunctionTooLong \u2014 turso_core::translate::expr::binary::emit_binary_insn runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binary.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"b864673300698153104ba2b905f29695d6fcdf4bf4a25c910ee1eed0d16cb1fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::group_by::group_by_process_single_group: FunctionTooLong \u2014 turso_core::translate::group_by::group_by_process_single_group 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":"core/translate/group_by.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"415d320811f36e2692da165de3f1818a07743afc4159befb51060208d83e8464"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_alter_column: FunctionTooLong \u2014 turso_core::vdbe::execute::op_alter_column 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":"core/vdbe/execute.rs"},"region":{"startLine":16956}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4aab93ed6ca9d35749fbad93e1ed5272bb6d353e07d006a4071c9599b81c2c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Limbo: TooManyMethods \u2014 67 methods. The bar is 30 methods; this is 37 over it, 2.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":"cli/app.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"394ddefa3b1388296290231df26ef408f1110916dd1cdf454d8043e050046ded"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dialect/engine.rs: FileTooLong \u2014 1111 significant 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 611 over it, 2.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":"core/dialect/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5c2496b446be8d0f62fe4b0943c9ed3fe450e3e987e1d8e334f594af5b723a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::binary::emit_binary_condition_insn: FunctionTooLong \u2014 turso_core::translate::expr::binary::emit_binary_condition_insn runs 222 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 122 over it, 2.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binary.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a77fad99e633a4ef6cf095a3ef336efb5ec254ad2795e81e650d7b91cfe3d32"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::index::translate_create_index: FunctionTooLong \u2014 turso_core::translate::index::translate_create_index runs 219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 119 over it, 2.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":"core/translate/index.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc3012e9e2677f7212403f433b7ed8c1b98967e7ef3edb07e637788dfe7995e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::analyze::translate_analyze: FunctionTooLong \u2014 turso_core::translate::analyze::translate_analyze runs 218 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 118 over it, 2.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":"core/translate/analyze.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5aec2b8a189157bb073086fe4910dac2df3cc73332c6aaaf03ba3914b0a557"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/mod.rs: FileTooLong \u2014 1086 significant 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 586 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/model/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9827325e6d5024f28dd545ee52a9e556359fccb208e5164341f28eac97d6ee"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Statement: ClassTooLong \u2014 868 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 73 methods, 4 blocks, lines 195-1748. The bar is 400 significant lines; this is 468 over it, 2.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":"core/statement.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"609ce975ef5a6d11b238cb3d950e5819bed44e114ff53b7e6deb062b368a1ee8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: regress/main.rs: FileTooLong \u2014 1084 significant 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 584 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/regress/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50d8e03f8f2a15b903a7f9aed6f878c7186a91909b0519da680e6af6fbda6f6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JDBC4PreparedStatement: TooManyMethods \u2014 65 methods. The bar is 30 methods; this is 35 over it, 2.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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"770047cc703d11527b66694a78652bccf832dd68705cdd5048af92806ab05bba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ProgramState: TooManyFields \u2014 65 stored fields beside 40 methods. The bar is 30 stored fields; this is 35 over it, 2.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":"core/vdbe/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4d026cd3b9e7afd3a55ed1da427f65b7c0270db1d972888cac5deedb9c4ecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: functions/datetime.rs: FileTooLong \u2014 1079 significant 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 579 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":"core/functions/datetime.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f4134ecf23ef774c7e72f4c4c88e1a6fd33fc393e83892d2cd324db23a0e3c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JDBC4ResultSet: ClassTooLong \u2014 863 significant lines (blank, comment-only and punctuation-only lines excluded), 215 methods. The bar is 400 significant lines; this is 463 over it, 2.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e89b1a9fc13fd084635ef9c90607ad10f4bfce52bb0cf51e6e569ce22efd474"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.to_tokens: MethodTooLong \u2014 to_tokens 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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c92cb374b81b67c8124a22c1b740a467bdc16965a9748c7e30669f43b9fc36c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::emit_plan_nodes: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::emit_plan_nodes 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":"core/incremental/vdbe_maintenance.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3edb339bec91ac400d578f48004c3f19dd1ed4cdf0aeda2c630991cc97700e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::plan::build_select_plan_dag: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::plan::build_select_plan_dag runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.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":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f4ab191ae2886b8ff98069dbef028a9899ca14fae4f91f16cf6a71253ab465"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Jsonb.deserialize_string: MethodTooLong \u2014 deserialize_string runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.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":"core/json/jsonb.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"46175a37de9925e10e49956bfcd84a6b7cecb1425401c391075669eb5b031d09"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PageInner: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cae11023f7f1534ff6fa0e9e07d5bfe66974bd8a64faff8d07826328b04ad3c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VectorSparseInvertedIndexMethodCursor.delete: MethodTooLong \u2014 delete 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d06472e6457745c37bd0e36d49f3a48e16b732b7bf078fbb431a9b35ed73a61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MvStore.maybe_recover_logical_log: MethodTooLong \u2014 maybe_recover_logical_log 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":"core/mvcc/database/mod.rs"},"region":{"startLine":9609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3452567f8accd96f29b5ba780f7cad77f9689172a59fb3b3c773c0b2d9e7eac8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_primary_expression: MethodTooLong \u2014 parse_primary_expression runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"130ce028de538379c6ba4698fe923db7b4616a95d69a3d5dd8004bdc0a4c94cd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VectorSparseInvertedIndexMethodCursor.insert: MethodTooLong \u2014 insert runs 206 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 106 over it, 2.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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ddb066f753c7fc0b85b5b890c784bfd7daa888094af939931fb3262d13e5e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/sync_server.rs: FileTooLong \u2014 1021 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: TursoSyncServer (2 blocks, 71-988). The bar is 500 significant lines; this is 521 over it, 2.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":"cli/sync_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3675c4b124c18216d85424e1b0c65b1f4d4c6c9b83dc68f77497faa1a01473fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::window::emit_window_op: FunctionTooLong \u2014 turso_core::translate::window::emit_window_op 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":"core/translate/window.rs"},"region":{"startLine":2859}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ca4c4a99b9f37aa4286b0e92294f03b02ae16837b3ebcd0b78ce51e71f6b2e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqltest::run_tests: FunctionTooLong \u2014 sqltest::run_tests 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":"testing/sqltest/src/main.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"254050e9604bcb8e2eb819e2d604fc893ba5106f465da16ee1378d30cb1a5ef0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SqliteCommand: TooManyMethods \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded), 61 methods. The bar is 30 methods; this is 31 over it, 2.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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7a8670d0a8c9c4f4282ea8111db9eb7d2c0fe05bdfe385563826d52bf9910b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: main_loop/hash.rs: FileTooLong \u2014 1016 significant 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 516 over it, 2.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":"core/translate/main_loop/hash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bcfa2660e0f85693046936e63cc1b0c192b88085ba93eb701c19362a02d831"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::planner::resolve_window_and_aggregate_functions: FunctionTooLong \u2014 turso_core::translate::planner::resolve_window_and_aggregate_functions 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":"core/translate/planner.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab1e89ab154dabdcc3a56182fe503c36d8e157f0fcd5b37acd44094baad9a30"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Turso.Data.Sqlite/SqliteDataReader.cs: FileTooLong \u2014 1007 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 507 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"939fbae1398a114d6a648fe44e4b7777f3b0b5805eeab70d137d75665dc97f48"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::consolidate::consolidate_delta: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::consolidate::consolidate_delta 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":"core/incremental/vdbe_maintenance/consolidate.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"61769ad69cf6e49aaa430ab6461a0ad98cef68762570590e7deb606099de883f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::condition::translate_leaf_condition_expr: FunctionTooLong \u2014 turso_core::translate::expr::condition::translate_leaf_condition_expr 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":"core/translate/expr/condition.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d17d09591d421f0b341589f83cf915bf948fd5e2a41c9fe3a085d61181febcf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JDBC4Connection: TooManyMethods \u2014 60 methods. The bar is 30 methods; this is 30 over it, 2.00\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4Connection.java"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b52bb3dbc47296b6627c591af46c773509f6a262a72a84c818a3dfe2b0d05ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::compound_select::emit_compound_order_by: FunctionTooLong \u2014 turso_core::translate::compound_select::emit_compound_order_by runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.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":"core/translate/compound_select.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac83366615f1082ed7e3391355e92ff094b848bec83fe48f446a8c83f2f9d13b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::seek_internal: FunctionTooLong \u2014 turso_core::vdbe::execute::seek_internal runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.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":"core/vdbe/execute.rs"},"region":{"startLine":6656}}}],"partialFingerprints":{"codehealthFindingId/v1":"090b92a33f1499e1d650c76b3a10ae43720ed6c739fcbb9923aa4d6c4ec66a51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::sink::emit_terminal_delta: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::sink::emit_terminal_delta runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/sink.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d67b3aaa07719a149176869a735d2126ec393132af328cfeb388b6135934ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::access_method::find_best_access_method_for_subquery: FunctionTooLong \u2014 turso_core::translate::optimizer::access_method::find_best_access_method_for_subquery runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/access_method.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62d6312442e810266d5838a90999eb187d4f17192feb5e4695525fc06a8b9ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_macros::ext::vfs_derive::derive_vfs_module: FunctionTooLong \u2014 turso_macros::ext::vfs_derive::derive_vfs_module runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macros/src/ext/vfs_derive.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5d82cb08e25c41e07e315e0816c1ea7232ed72c59887c932e80ffe2e639d37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Schema.make_from_btree_internal: MethodTooLong \u2014 make_from_btree_internal runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":3351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7818ad750ed71786a33779e4f672aa3bc38db7bfba89a1e803deac1ea2d41d6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::access_method::choose_best_btree_candidate: FunctionTooLong \u2014 turso_core::translate::optimizer::access_method::choose_best_btree_candidate runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/access_method.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab17b915f26c13ef59d682d8e37a1722d83903fd3074a852cdd5276a1c4f1761"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_journal_mode_inner: FunctionTooLong \u2014 turso_core::vdbe::execute::op_journal_mode_inner runs 197 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":18618}}}],"partialFingerprints":{"codehealthFindingId/v1":"775406e0015c31d0ed595d6e79cbd2f10e4fe83196d61e82b96af570ce615a6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::recursive_cte::emit_recursive_cte: FunctionTooLong \u2014 turso_core::translate::recursive_cte::emit_recursive_cte runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/recursive_cte.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98efe61b46a0afc341ec7b41f4671035001a594f008e1af671712bb93c5e4e8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProgramBuilder.resolve_labels: MethodTooLong \u2014 resolve_labels runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/builder.rs"},"region":{"startLine":1822}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82dd4d03f7e8e61cd70513e83caf570bb4bfd538dfbeaf5572690dccee7aae7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe_maintenance/join.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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90228bbd31040704c728ff31950b90fe9344ec1ffa24c995b53e3f3d1f5605d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TokenType.is_keyword: MethodTooLong \u2014 is_keyword runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/token.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c35fe7e52ebd34fa98e00b8f2c5a677d0c00a419c25f913e4417c49bdf96b82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::delete::emit_delete_row_common: FunctionTooLong \u2014 turso_core::translate::emitter::delete::emit_delete_row_common runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"030f5b98bf8ce26f560557ac8fb46492747895fe68c47ceaa331d2d1c9543b54"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HashTable: TooManyMethods \u2014 58 methods. The bar is 30 methods; this is 28 over it, 1.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":"core/vdbe/hash_table.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6644c6ee87df29014dd513a2f2f18aab39cf310919d045c366d4a2ed58cebc27"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Schema.handle_schema_row: MethodTooLong \u2014 handle_schema_row runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":4281}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b9aead4805d359de0ea010ae18ddc89b2f83446324b28eda9bc257c419a044"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sql_gen::generate::select::generate_select_impl_inner: FunctionTooLong \u2014 sql_gen::generate::select::generate_select_impl_inner runs 193 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4334d851f460e83600ecbe04a953b567fe0fe33a564835dead65ee1d97208932"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrent-simulator/multiprocess.rs: FileTooLong \u2014 964 significant 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: MultiprocessWhopper (3 blocks, 207-1208). The bar is 500 significant lines; this is 464 over it, 1.93\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":"testing/concurrent-simulator/multiprocess.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee02c67ce7620e216d47bf45041b3f44426d5d1ebd765580d473ee09816bfac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/statement.rs: FileTooLong \u2014 961 significant 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: Statement (4 blocks, 195-1748). The bar is 500 significant lines; this is 461 over it, 1.92\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb4d894bbb0b6e1bddc27acb52cc7de5b16311a17920721341bc9b7fe3789341"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::build_seek_def: FunctionTooLong \u2014 turso_core::translate::optimizer::build_seek_def 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":4560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4820515bbc5c1179b22d1ec043e9637536355d3696fa30e5f15d8e35dd4e2541"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sql_gen_prop/expression.rs: FileTooLong \u2014 959 significant 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 459 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":"testing/differential-oracle/sql_gen_prop/expression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f57eae4b2ad73dffc5d29fc74c572709aedc3142a7b5b5793dddfebfe5263c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe_maintenance/aggregate.rs: FileTooLong \u2014 951 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 451 over it, 1.90\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"606898464b5d4a455d04bd300979edd68f7b3965ab694eb69616882f89f02c49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamingLogicalLogReader.parse_next_portable_changes_frame: MethodTooLong \u2014 parse_next_portable_changes_frame 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b6be45867ab8af99d0a7f277719a24ec2062a8a020e9ebebb8ad6cfaf96266"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::main_loop::close::emit_unmatched_right_rows: FunctionTooLong \u2014 turso_core::translate::main_loop::close::emit_unmatched_right_rows 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":"core/translate/main_loop/close.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47c19f7b8f883bf76ee614b06ac7b7169cc1bfc4309781183b9eaac008f9a20"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: OpenLoop.emit: MethodTooLong \u2014 emit 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":"core/translate/main_loop/open.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"83cb9e8c341691b65922451c5c3fa42bdc18fdf874537a72b5099584c623580a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommitStateMachine.step_build_log_record: MethodTooLong \u2014 step_build_log_record 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":"core/mvcc/database/mod.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"300b2e344d8ec5be381970d6e35194a9461524bc45efa655abe5a68a920d09a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PreparedHashBuild.emit: MethodTooLong \u2014 emit 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":"core/translate/main_loop/hash.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf89aef8d73ce78f422d398bc52a7faf66827d6cbd506b05a6a8ceab4eb3947"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: turso/lib.py: FileTooLong \u2014 941 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 441 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/python/turso/lib.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306d86dc529ba6ef6270cb16d00499cb3cfef0978ad64f7ed60bb01d9484c4ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::view::translate_create_materialized_view: FunctionTooLong \u2014 turso_core::translate::view::translate_create_materialized_view runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/view.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a952d9b267619a41cb8b8d87f2b859b29e961bdaef595d1e98268e74652d28cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StatementProfile: 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":"testing/differential-oracle/sql_gen_prop/profile.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d11bf628887b1a9a9c84855af044fa847197eb72f4c8566cdfc59fbf668da74"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Insert.shadow: MethodTooLong \u2014 shadow runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/model/mod.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ec6bd7be3cca9698fca3f8e2819edcdaccdff436bd1a12e88f07991147b49a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::update::prepare_update_plan: FunctionTooLong \u2014 turso_core::translate::update::prepare_update_plan runs 185 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 85 over it, 1.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/update.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb0e0c7c6fad3d3f2c8eb6385c020472225c97dc9e27bd660e2ad534be92d6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pager.commit_wal_inner: MethodTooLong \u2014 commit_wal_inner 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":"core/storage/pager.rs"},"region":{"startLine":4545}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf7e1b4417053c5f8f7f3ddb33852475145899ff02d4bba545a874f1adf242f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::emit_column_constraints_validation: FunctionTooLong \u2014 turso_core::translate::alter::emit_column_constraints_validation 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":"core/translate/alter.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0c97de67c467d213dc24eb9c3a8c2a528519ff45fb5b30434e9e0384900cc7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CheckpointStateMachine: TooManyFields \u2014 55 stored fields beside 50 methods. The bar is 30 stored fields; this is 25 over it, 1.83\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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c53ce7b7221620c88645e46286f38381a0dab7536842fca39c3f7fa056403dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/trigger_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). 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":"core/translate/trigger_exec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b75f081064ef9206e036ce32647d58640ceb41155abe40499d2fe71c0986755"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_vacuum_into_inner: FunctionTooLong \u2014 turso_core::vdbe::execute::op_vacuum_into_inner runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":19152}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bf9eaac69792c32cf51ac3e6bc28eebace61db437af228526f3d52129328fe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Whopper.perform_work: MethodTooLong \u2014 perform_work runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd4a4355deffeec64d07e9f8fb4a57802bdfc155ddd1912cbedb077ad369c6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/sequence.rs: FileTooLong \u2014 907 significant 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 407 over it, 1.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":"core/translate/sequence.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f50ee31ace91f40c5727e1c79b21810f25f59fcb35024c68839a9ca006f7a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JDBC4DatabaseMetaData: ClassTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded), 177 methods. The bar is 400 significant lines; this is 325 over it, 1.81\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4DatabaseMetaData.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"81269695ea26a10426e198b2c4d22e3e5c2f4e194e9865c35672f9143941dfbd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runner/mod.rs: FileTooLong \u2014 906 significant 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 406 over it, 1.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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"049216debb0cf64abf3468832bcaa36a1e954a723f67c2f0ed367d7a01dbf7ea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Jsonb: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dfeca00bff39b6b15f793a7e38e88c3c0c4e3e49c08eb4d106466a725b6a38"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StreamingLogicalLogReader.parse_streaming_payload: MethodTooLong \u2014 parse_streaming_payload runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2434}}}],"partialFingerprints":{"codehealthFindingId/v1":"829c5d7f616c53078d50133bfb2a503e5d03be08e0b1727f8f964f55e09f3e72"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jdbc4/JDBC4ResultSet.java: FileTooLong \u2014 892 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: JDBC4ResultSet (33-1399). The bar is 500 significant lines; this is 392 over it, 1.78\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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ecab8679d1437785fa40fae48174049cc5ecb7c7aa06d5b01f959713a937ea"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseReplaySession.replay: MethodTooLong \u2014 replay runs 178 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 78 over it, 1.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_tape.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1664e0176b64e29bf3ca17192257945e1133fa02b3d385cb746e3b2a88b2d59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_test_or_snapshot: MethodTooLong \u2014 parse_test_or_snapshot runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7f6a8b0a6fa6e4467c5a37085aa1668177d3d59fc0715d851ff765b0cbb9bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::join::emit_join_phase: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::join::emit_join_phase runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"394ba1afd399db8ff49bcda4a5939555a5fdbed1fda321ac19984b79a5afda6c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiprocessWhopper.perform_work: MethodTooLong \u2014 perform_work runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/multiprocess.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebeddd9a3793907d20cab757317667fa2d56950046a6775d6841bfeb9dd67eb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MultiprocessWhopper: ClassTooLong \u2014 703 significant 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 207-1208. The bar is 400 significant lines; this is 303 over it, 1.76\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":"testing/concurrent-simulator/multiprocess.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b4487bb56f8029f3314b1e8a6304d543107af7a0adbe1da34509f3e9bf13e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/multi_index.rs: FileTooLong \u2014 875 significant 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 375 over it, 1.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"494801ba6a3f529d615ef3898de3b74a87e7245d979868763169efe58413bde9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Whopper: ClassTooLong \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), 22 methods, 2 blocks, lines 670-1751. The bar is 400 significant lines; this is 296 over it, 1.74\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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"353180e21dd2957a688fd19a20c614a7e02e3d81cd98648254a80e972bd172e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/expr_type.rs: FileTooLong \u2014 870 significant 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 370 over it, 1.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":"core/translate/expr/expr_type.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"929a359bd330ef891c063577dfd0dbfbbfb0a047c41fa69ef9d5ffd646e9bd77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::select::emit_query: FunctionTooLong \u2014 turso_core::translate::emitter::select::emit_query runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/select.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d48ecd0a338cf30c898f8df6b675caaa2e6191f3714246c1f3dd462e4250f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/binary.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":"core/translate/expr/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dbc980a1a13897f92bdd3e2269e038b652bbf05308381c1557d571e0545d2d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.drive_reparse_building: MethodTooLong \u2014 drive_reparse_building runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe54f06d5d785ae923adff4e3b7f988f7c58ef8279fa46ebef39d654a5aca83c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmitWindow.init: MethodTooLong \u2014 init runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":1105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0ff96d74114a0df7e56b9d87ddcded035ea078f5d221ec287b95604e0f7738"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShadowTablesMut.apply_snapshot: MethodTooLong \u2014 apply_snapshot runs 172 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 72 over it, 1.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/env.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"412dbe553e7218af2f2239022520baabaf83dad4502bc1b9c4b8bd95a577f1ad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::planner::parse_from_clause_table: FunctionTooLong \u2014 turso_core::translate::planner::parse_from_clause_table runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":1594}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e54351ea771a6a2311534aa276121ed1b793911cf305ab62339bd06b580608f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::pragma::pragma_for: FunctionTooLong \u2014 turso_core::pragma::pragma_for runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.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":"core/pragma.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0881ac212f5159f9b1fd1e665d8c8a1c28c3d809b1dd3c9ac6eddde4ebf69d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::compound_select::emit_program_for_compound_select: FunctionTooLong \u2014 turso_core::translate::compound_select::emit_program_for_compound_select runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.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":"core/translate/compound_select.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"073b95c044eac8ceea868ac886a3546cac4bdc429ad442107dec6d00b2be0120"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::translator::translate_subquery_result_expr: FunctionTooLong \u2014 turso_core::translate::expr::translator::translate_subquery_result_expr runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.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":"core/translate/expr/translator.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e369199a68f4bca8d41afcb846c01ee60c29f1070e00bf85ecf9ff263baa0561"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe_maintenance/set_op.rs: FileTooLong \u2014 847 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 347 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"155847c7824f8cb6a307bb1a83942a59d18a9b485a9454e8d306ef07aff90607"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: functions/printf.rs: FileTooLong \u2014 846 significant 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 346 over it, 1.69\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/printf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c019753550b6b86f72f552fe891573ab6f26d9d19b6e051c954a37193407c63d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.validate: MethodTooLong \u2014 validate 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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc838efcd3d7b664700229176ed5147e6a12cd8f4502b19257cc461c87cf2b23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::insert::init_source_emission: FunctionTooLong \u2014 turso_core::translate::insert::init_source_emission 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":"core/translate/insert.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"73db960180ada0b9f16510f3b224ecc193062cb2a6100fea006fb846619ebc47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/compound_select.rs: FileTooLong \u2014 837 significant 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 337 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/compound_select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e005626b848e1d82e9223a3ecedfb748f571ee315102cb3979abf2a7c184e946"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::join::emit_inner_join: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::join::emit_inner_join runs 167 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 67 over it, 1.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d27a8c2ab9084325be163fcf92afd8239379c417deeddfddda134ba06f2bb78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CheckpointStateMachine: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fed6e289bb0d937067396460d4684d70469993f150dc53563119ef37be5f5e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BTreeCursor.destroy_btree_contents: MethodTooLong \u2014 destroy_btree_contents runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":5606}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a96d80ed659b334a93824a2f415e2914fb1a0eb56496e0372f96ca7170a3a4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::delete::emit_row_loop_delete: FunctionTooLong \u2014 turso_core::translate::emitter::delete::emit_row_loop_delete runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bc1c9c508b8fd837851d9690ba99b02cb6ee19f2bb390acdb0a8770f7e047c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CloseLoop.emit: MethodTooLong \u2014 emit 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":"core/translate/main_loop/close.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5357132fbcb8c129053ca24617d23c91d404ec5772850abd40889ca58ff48943"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_sync_engine::database_sync_operations::decode_raw_mvcc_logical_log_to_file: FunctionTooLong \u2014 turso_sync_engine::database_sync_operations::decode_raw_mvcc_logical_log_to_file 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35510e41f019bd443197428863ef6a0bdcdb465814f96782e7fc22541e990cc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/unnest.rs: FileTooLong \u2014 822 significant 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 322 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/unnest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b4d17502280fedcae8c6b549c7beb5ffbb3db5fbb43f5238f9f61bbd20bb2ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BTreeTable.to_sql_as: MethodTooLong \u2014 to_sql_as runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":6078}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa1890310b583f5d098cff86763b33abb870d469612ae4b1f059a43a1469f15"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::select::build_materialized_build_input_plan: FunctionTooLong \u2014 turso_core::translate::emitter::select::build_materialized_build_input_plan runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/select.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"082eec64dedf01539c846852acb67a75443e91b8fbf48af484289058f93c1ea0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_window_step: FunctionTooLong \u2014 turso_core::vdbe::execute::op_window_step runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8337}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f6bdbec49173aa5e947c662299cd7d9b8208d2cfb5fc8c51513e9cc791aa5e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::inverse_agg_payload: FunctionTooLong \u2014 turso_core::vdbe::execute::inverse_agg_payload runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8995}}}],"partialFingerprints":{"codehealthFindingId/v1":"3036d81b26814a339e77cf362c75dc63e58700acc5db42dd0445808b7f0944af"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Parser: ClassTooLong \u2014 651 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 93-1047. The bar is 400 significant lines; this is 251 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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"98436ca47330967e3c3da9568b01315e99f447a4a3302554512148b97990198a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MvStore.maybe_complete_interrupted_checkpoint_nonblock: MethodTooLong \u2014 maybe_complete_interrupted_checkpoint_nonblock runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":9179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e216fa4892ef0af4c801bc4b33b2e323b8d4fd9b58c01e564cdcac0594a46c7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraceHashLoop.emit: MethodTooLong \u2014 emit runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/hash.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9edd3ad44861cfcd4d10533603eff87f37a84d9b105fc38f5a040739557390"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_pg_dump_fuzzer::report::render: FunctionTooLong \u2014 turso_pg_dump_fuzzer::report::render runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/dump-fuzzer/src/report.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f9d28d1083535d435b371b97c60f21d36d1d734e2cd50ead741063097813edf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatabaseReplayGenerator: ClassTooLong \u2014 647 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 2 blocks, lines 16-972. The bar is 400 significant lines; this is 247 over it, 1.62\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":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c6468c4de07921b14d0364b742eb30bcbdd19212d6076828c4d54249d5c7c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emitter/delete.rs: FileTooLong \u2014 807 significant 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 307 over it, 1.61\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f342016f3a96155c97d984d03eb08f0835be836456edd467216a273c047ee261"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::select::emit_materialized_build_inputs: FunctionTooLong \u2014 turso_core::translate::emitter::select::emit_materialized_build_inputs 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":"core/translate/emitter/select.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d03d2cc6a0fd05dfd29f17b931a779dc8009134e9775ef5e33f7a5c200cc7a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TursoSyncDatabase: TooManyMethods \u2014 551 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab913745321b6ffb3dd11696f0aa630a986806eed8c1dd5cb9a1815542b3139a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: JDBC4Statement: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4Statement.java"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3ceb73f2e98813fc39188ba4f82fde8e92db76ccbf112855dfc2e52a30f557"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Resolver: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca1c7742fc95816c826c665155d5a33fb3fa65512d1405adda0dda98023d04b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmitOrderBy.sorter_insert: MethodTooLong \u2014 sorter_insert 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":"core/translate/order_by.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"092b6466924e7b3de68c671193408a2e280e414e04c869dec75871e4474700ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_savepoint: FunctionTooLong \u2014 turso_core::vdbe::execute::op_savepoint 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":"core/vdbe/execute.rs"},"region":{"startLine":5455}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d33a083182bd6f2fa53f3ffa2094c5285fd345c9cde4ded44bca733195b56f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_macros::atomic_enum::derive_atomic_enum_inner: FunctionTooLong \u2014 turso_macros::atomic_enum::derive_atomic_enum_inner 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":"macros/src/atomic_enum.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a43569db8411fc858822980ccb191f24fcff156ac04d7f5c7c7b51cc13eaa0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BTreeCursor.insert_into_page: MethodTooLong \u2014 insert_into_page runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":3162}}}],"partialFingerprints":{"codehealthFindingId/v1":"13caa0a19996261d98cde05b3a1ad5f500b17269e24b80e9cfa53059b8430c31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::update::emit_update_column_values: FunctionTooLong \u2014 turso_core::translate::emitter::update::emit_update_column_values runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00237b49587bfb3704217e23d988c64444395e1ea0b4ebb99b54fe67f94eda2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: main_loop/close.rs: FileTooLong \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). The bar is 500 significant lines; this is 292 over it, 1.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/close.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8abd406c3554275b349de828ef62bc54cf890c6ee5cca7029f052777fef1ad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::index::translate_drop_index: FunctionTooLong \u2014 turso_core::translate::index::translate_drop_index 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":"core/translate/index.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"033f6248c884f9839123b34cb2e9b0ce884fc6445a347ca0019f2f353e1699ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgreSQLTranslator.translate_range_function: MethodTooLong \u2014 translate_range_function 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":"postgres/parser/translator.rs"},"region":{"startLine":2657}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1057e8a8bf6bf60201b03b9016a6aa0469cc2cbb10715afce4c948640fe2d72"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgreSQLTranslator.translate_json_to_record: MethodTooLong \u2014 translate_json_to_record 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":"postgres/parser/translator.rs"},"region":{"startLine":2889}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28bb94f4b9c903440298e86385f6d7881eb1746712f9999badbe9cc5b0919d1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TursoSyncServer: ClassTooLong \u2014 631 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 2 blocks, lines 71-988. The bar is 400 significant lines; this is 231 over it, 1.58\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/sync_server.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35ff074eddfa9702645146035ec2565322c2ba0ae7c9964f9a3edc159dfde4b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommitStateMachine.populate_portable_changes: MethodTooLong \u2014 populate_portable_changes runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d9cbca8572d481dbcbdc8d435454a0c8774a66971d820a08e8ad542ad17e38"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::util::rename_column_view::rewrite_select_table_for_column_rename: FunctionTooLong \u2014 turso_core::util::rename_column_view::rewrite_select_table_for_column_rename runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":3504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94a2444e42a290f7ee9886e4f4bd4881f4c2db2b96eba13ec8ddb1eaeba2394"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_create_type: MethodTooLong \u2014 parse_create_type runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":4917}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b96b03e61eef9d4dfb30d756270104db64689cc1b8bde42dde370549014b9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImportFile.import_csv: MethodTooLong \u2014 import_csv 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":"cli/commands/import.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d638a8ada202334106e0fc42af5bdb1cd711e1d7c02b8a1ab685c3284bd1436"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_sync_engine::database_sync_operations::send_push_batch: FunctionTooLong \u2014 turso_sync_engine::database_sync_operations::send_push_batch 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":3031}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b526d8119cc0b6a38291810b605c7c9fc6caf6f47258b9b6f860d0d4dfc92a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/group_by.rs: FileTooLong \u2014 778 significant 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 278 over it, 1.56\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/group_by.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8122309edc0f47782a0855b77ea2adf4cb7c92eab619aed27bac218e71041969"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::window::emit_window_flush: FunctionTooLong \u2014 turso_core::translate::window::emit_window_flush 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":"core/translate/window.rs"},"region":{"startLine":4009}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ee2923804355205c397b2c7ea61a3c3e04cc627d9691e43907080c56b14834"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_rename_table: FunctionTooLong \u2014 turso_core::vdbe::execute::op_rename_table 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":"core/vdbe/execute.rs"},"region":{"startLine":16455}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9b174a29b0b62d5db0c044b25ba975e7cc0ecb1418580380d1f827b14691df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_parser::lexer::keyword_or_id_token: FunctionTooLong \u2014 turso_parser::lexer::keyword_or_id_token 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":"sqlite/parser/src/lexer.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bfb2091f34b2474798e75bbbff60c8c8280d291a29703c09b7140599d90d43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::binary::emit_binary_expr_row_valued: FunctionTooLong \u2014 turso_core::translate::expr::binary::emit_binary_expr_row_valued 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":"core/translate/expr/binary.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"568ca13a600123f5b0a01bdada4759146f9ee9f2ac87fb189cd470bc9eadf5bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::subquery::emit_from_clause_subqueries: FunctionTooLong \u2014 turso_core::translate::subquery::emit_from_clause_subqueries 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":"core/translate/subquery.rs"},"region":{"startLine":1603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffeb3add79b2cddc839f135fa647640cae8ccc30ca62618d694ae8dda7e7d7b2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.attach_database_with_config: MethodTooLong \u2014 attach_database_with_config runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/attach.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84ba3b825c2585e04f24b30966ef259061bbb9f7088803bb6b74c4c922c83d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pager.allocate_page: MethodTooLong \u2014 allocate_page runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":5836}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff9268bc18c5fdf7c7983274330c419e285e8ed9b1019a117780f6ca1497a7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::validate_trigger_columns_after_drop: FunctionTooLong \u2014 turso_core::translate::alter::validate_trigger_columns_after_drop runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":4869}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2e8cd98507b77526a8c6146baa7dba77ba812c62ad4888f34589abaa9ca7ec"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScalarFunc: ClassTooLong \u2014 611 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 5 blocks, lines 961-1643. The bar is 400 significant lines; this is 211 over it, 1.53\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/function.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"3018dcc27af130bcc8687078f46eba62a74059e8a96b25303e398353716aa753"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::insert::emit_fk_child_insert_checks: FunctionTooLong \u2014 turso_core::translate::insert::emit_fk_child_insert_checks 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":"core/translate/insert.rs"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9ce88d02e569a6848abe44ef5f3a9af72e1a8f237c2a0deba85012813c719a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::trigger::translate_create_trigger: FunctionTooLong \u2014 turso_core::translate::trigger::translate_create_trigger 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":"core/translate/trigger.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1532a06bdd2cef8e2fd66f7a839ab3a5a3d93e68f481b235dfe9e050bf14bbe1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/main.rs: FileTooLong \u2014 752 significant 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 252 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":"postgres/cli/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b3d5df4e197ac70ddaca1cc4e6440d88a50977e8ab5b86b5f6f9b7796b71a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgreSQLTranslator.translate_create_table: MethodTooLong \u2014 translate_create_table 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":"postgres/parser/translator.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3e84852b56a6e8beab3ad0641b6e496d62f70d23b7b977e63e05ba3d7d9542"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/win_iocp.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":"core/io/win_iocp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f96126f458ee925a3e857dcb96a8e123f2df0a571e81c58bd31fe49fc6f26c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: emitter/select.rs: FileTooLong \u2014 748 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 248 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/select.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec2f1da45f74c7aa26b0edd615d371f66bb0818dca46735ef1a1e8e7efa7858"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/ast.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/ast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c561923e6dc1dba7607051104398059fa8374f7afc8b3f2e4d1a3881061572"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalLog.frame_and_pwrite_tx: MethodTooLong \u2014 frame_and_pwrite_tx 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"014a94e3e88b042d409d484fc80abf6c8caf929826fe97a521087675324e3f0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::condition::translate_in_list: FunctionTooLong \u2014 turso_core::translate::expr::condition::translate_in_list 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":"core/translate/expr/condition.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5afddcf041e7484119e693388eef41ab6724440078a3aba1fa6384535d33af"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.next_token: MethodTooLong \u2014 next_token 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a83f0946f3036829b0eb563c06dd96faf6f68a7f698cb79ef2c95d10892b96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: jdbc4/JDBC4DatabaseMetaData.java: FileTooLong \u2014 738 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: JDBC4DatabaseMetaData (17-1212). The bar is 500 significant lines; this is 238 over it, 1.48\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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4DatabaseMetaData.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e334d523de879ee441f82d283501ab354bcc1fba571d4b2c30da44ba1f81aa08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: parser/mod.rs: FileTooLong \u2014 737 significant 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: Parser (2 blocks, 93-1047). The bar is 500 significant lines; this is 237 over it, 1.47\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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0becd0d3ddddf36029117d36381c5c50569647e83fcdf084c737c8034f6a0309"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Jsonb.deserialize_number: MethodTooLong \u2014 deserialize_number runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"0455741a45a6c548e63eeb219ed29b10deaccc03381e3e95981bacfa91ec5d11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::rewrite_trigger_sql_for_column_rename: FunctionTooLong \u2014 turso_core::translate::alter::rewrite_trigger_sql_for_column_rename runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":3367}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3264037b00c055023d502f1c9675e64b305ba46f9fefabe42c412f67c215cad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::planner::parse_join: FunctionTooLong \u2014 turso_core::translate::planner::parse_join runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":3069}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fd09c9e3daf818139f23858fc87929aaf3b55ee44ad26e4f2a53d1eb8db4e4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ProgramBuilder: TooManyFields \u2014 44 stored fields beside 118 methods. The bar is 30 stored fields; this is 14 over it, 1.47\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":"core/vdbe/builder.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"57093f3cff58138ec0f4a6ae67359d680834fe54164c77be8ce2ccf647d9eceb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: common/promise.ts: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 233 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"418d7cde3c4243d8631a5a5d04b24bef7d781716297bc90bda9c8e39684c2baf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: optimizer/order.rs: FileTooLong \u2014 732 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 232 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/order.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b3928f1bf5fc1cbec4f801c96ac3400ba4a995ddcf1b8a133e396415a12b68"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BTreeTable: 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), 38 methods, 3 blocks, lines 4999-6547. 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":"core/schema.rs"},"region":{"startLine":5652}}}],"partialFingerprints":{"codehealthFindingId/v1":"229e008b48994ba6410a3375322ca31cdff4693b4dcc8322f343987b35ecb570"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/capi.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 50 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":"sdk-kit/src/capi.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df2e4787dff6c73f3d6714d3ce6c57017a167eee16448ed31e4b9a19063036c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MvStore.begin_exclusive_tx_with_checkpoint_read_guard: MethodTooLong \u2014 begin_exclusive_tx_with_checkpoint_read_guard 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":"core/mvcc/database/mod.rs"},"region":{"startLine":6453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e35f5d21b61c3433cafb0a31cab7c6f47113c18a96ade8dc1dfc0d758322abc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::planner::prepare_recursive_cte_plan: FunctionTooLong \u2014 turso_core::translate::planner::prepare_recursive_cte_plan 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":"core/translate/planner.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0635dba1db0b0e39b3d92e6c9ec4fad69f3c74d989b695cba0fe7e606b3978c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::new_rowid_inner: FunctionTooLong \u2014 turso_core::vdbe::execute::new_rowid_inner 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":"core/vdbe/execute.rs"},"region":{"startLine":12629}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0a9cba2b04398b822a3bb4645fc5ef8d9505f91138ed5c9dd3b43807a075f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/mod.rs: FileTooLong \u2014 728 significant 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 228 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":"core/json/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8a270a2ac4c7f70250f0ad6f92c74bd94dcc762404ee057dd3af9a40155528"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: generation/query.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":"sql_generation/generation/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ed72269612cc51c304e10a621178668d62a99c9f8ba2ab6aec6cc20740e300"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_open_read: FunctionTooLong \u2014 turso_core::vdbe::execute::op_open_read 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":"core/vdbe/execute.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a16e7b058fcc13b60011c4a9261f898b2b122c7529573a1a9880444ceb9bee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseSyncEngine.bootstrap_db: MethodTooLong \u2014 bootstrap_db 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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15c792198d6f9f9d1125822de12861dd68abc3211082ae7aeeaee01ca3bb270"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::apply_trigger_cmd_for_column_rename: FunctionTooLong \u2014 turso_core::translate::alter::apply_trigger_cmd_for_column_rename 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":"core/translate/alter.rs"},"region":{"startLine":4585}}}],"partialFingerprints":{"codehealthFindingId/v1":"5575b20820821b69f3f9014c081d8ab7dd9e335ffe4a7b5c8d489d710c5c493e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_open_ephemeral: FunctionTooLong \u2014 turso_core::vdbe::execute::op_open_ephemeral 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":"core/vdbe/execute.rs"},"region":{"startLine":15687}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce144544bc8eecb6cb66c9f1cee9e1106e5b390963fdb61115d3ee4b2d14e8ca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgreSQLTranslator.translate_create_table_column: MethodTooLong \u2014 translate_create_table_column 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":"postgres/parser/translator.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"5147fdb0dd6c3143906b25e9e4b23f517b275640f240c7562150161f775abeb4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StreamingLogicalLogReader: 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1691}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f168b654df70cab2be10fb8728bcf0c441a8df57afd2d036b3f1ac689fbec91"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: turso_macros: TooManyFunctions \u2014 43 free functions. The bar is 30 free functions; 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":"macros/src/lib.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7015b01f83242fd1c6e531caf8cda62fd8eb02171c4e975e8031d263e9f1b2f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 716 significant 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 216 over it, 1.43\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1a5b0aff2bdf0a3a39ae8702574e98182caa381d1d1328df0b503a9f2cae37"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::validate_one_select_column_refs_after_drop: FunctionTooLong \u2014 turso_core::translate::alter::validate_one_select_column_refs_after_drop 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":"core/translate/alter.rs"},"region":{"startLine":5449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64ce341f9c8b455fb1f864d77bc8ff1a3f010eb98dde242f574d34caccef9b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_program: FunctionTooLong \u2014 turso_core::vdbe::execute::op_program 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":"core/vdbe/execute.rs"},"region":{"startLine":5940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2435c3086b0760ef67c5572350b3154e8fd588e61af315052465a0cfee2f1cba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Turso.Data.Sqlite/SqliteConnection.cs: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 208 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c99a1695fc04d63339c47d5634de4eb7ee18c1d525d2734f0a8e8d27cd3fd1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/encryption.rs: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 208 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/encryption.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bbbb9e660069dabed3a67ac9333eb771fc53cb215bbbc6b8313ff8b82677d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/database_replay_generator.rs: FileTooLong \u2014 708 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: DatabaseReplayGenerator (2 blocks, 16-972). The bar is 500 significant lines; this is 208 over it, 1.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"128070a4b58bd6d97db02d4763d3e476413e24f2b8cfc4d6c26cd5eeb22147be"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::functions::datetime::parse_arithmetic_modifier: FunctionTooLong \u2014 turso_core::functions::datetime::parse_arithmetic_modifier runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c9aa80336623ff3177886ec3c9c19929a8e9bcc644d4640d15c4fde81c9c11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::plan::validate_planned_node: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::plan::validate_planned_node runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc5be1681b450eaee3fee6e44e96dcd645458b6c6531019366b299e896b8b3c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::sequence::emit_disk_advance_past: FunctionTooLong \u2014 turso_core::translate::sequence::emit_disk_advance_past runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/sequence.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff9075fdea20247935a9c83e18f913b532cd1d13d5e585ec6b038615f118d29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_sync_engine::database_sync_operations::pull_updates_v1: FunctionTooLong \u2014 turso_sync_engine::database_sync_operations::pull_updates_v1 runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a90f8af807035983d45b520b59d2ee106693824f2d489fcae9a6b81d9e7319"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MvStore: TooManyFields \u2014 42 stored fields beside 200 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":4370}}}],"partialFingerprints":{"codehealthFindingId/v1":"4192c50884c6559cb53d4e6dba4f05ced2323aee2154f86f591a1c1ec8697fd0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TursoConnection: TooManyMethods \u2014 535 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39064d43332be6971aeb96cc7109b941484fdae4497f1cd648eb2a6426bfe4a6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Column: TooManyMethods \u2014 42 methods. The bar is 30 methods; this is 12 over it, 1.40\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":7995}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e306b59cae9daec6461e82d8009427b2c9e214681c93e853df5da73a936e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MvccLazyCursor.seek: MethodTooLong \u2014 seek 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":"core/mvcc/cursor.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff7cbe6aabb7d3e93e2fa920c8dc04355f8b113c32666583079b3cbaac575fc"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: limbo_sim::run_simulator: FunctionTooLong \u2014 limbo_sim::run_simulator 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":"testing/simulator/main.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f21acf2f2e6d1bcc58a00dbb64d1e9e2d9aa86a42ce1fc673a91c7225a5810b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Turso.Data.Sqlite/SqliteCommand.cs: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 197 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11850a50caf85a5f0415928f9fa6ee0afc2c5c0a8ec36aa6bd5834cfdfccb6bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::main_loop::multi_index::emit_in_seek_multi_index_branch: FunctionTooLong \u2014 turso_core::translate::main_loop::multi_index::emit_in_seek_multi_index_branch 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":"core/translate/main_loop/multi_index.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c5f9296e4b14c2b98452cfe844e92e239e96f0c484e8617a63996df37a7053"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::unnest::try_rewrite_single_value_aggregate: FunctionTooLong \u2014 turso_core::translate::optimizer::unnest::try_rewrite_single_value_aggregate 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":"core/translate/optimizer/unnest.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"d814148c4d607880e4c2fa517e4b7db3781e96742d687d619ccb6d17768a58ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::group_by::group_by_emit_row_phase: FunctionTooLong \u2014 turso_core::translate::group_by::group_by_emit_row_phase runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/group_by.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"84576a99b52608220541ddacc9deb495bf54980002b4e605ba85893838915279"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::roles::check_statement_privileges: FunctionTooLong \u2014 turso_core::translate::roles::check_statement_privileges runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/roles.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b4fcfedd4acf2c7df4b34d01250fefba544088150a433d15c3a50e31c4fc6b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_integrity_check: FunctionTooLong \u2014 turso_core::vdbe::execute::op_integrity_check runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":16192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0fff6fafcc4bf308144786bf7d788c46debe0031d8708499667c492c442ca4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseSyncEngine.apply_logical_mvcc_changes_internal: MethodTooLong \u2014 apply_logical_mvcc_changes_internal runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":1956}}}],"partialFingerprints":{"codehealthFindingId/v1":"951681f402320c72356b0538460a2b6e2c1e1689b3b30d18606ca21b43497b6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lexer.rs: FileTooLong \u2014 689 significant 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: Lexer (3 blocks, 216-983). The bar is 500 significant lines; this is 189 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/lexer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8057d820ba613809bfc7ba82a27e2650b6ffcee2fc0fe1697040754263f5ac0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/database_tape.rs: FileTooLong \u2014 686 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 186 over it, 1.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_tape.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c8482db181bf4798012675a9f740c428e740475dbc5a8bed54940125d026e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::delete::emit_delete_insns_when_triggers_present: FunctionTooLong \u2014 turso_core::translate::emitter::delete::emit_delete_insns_when_triggers_present 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":"core/translate/emitter/delete.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b4a81738ab84683bbc4aca57285acb6514bb596e8f9d7a4b27f51dc4b6e617"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::fkeys::emit_fk_drop_table_check: FunctionTooLong \u2014 turso_core::translate::fkeys::emit_fk_drop_table_check 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":"core/translate/fkeys.rs"},"region":{"startLine":2690}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e1edbc3add3cd92f95348e29cd58847c1c4ad3208bcca207497955f2c62df8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::sequence::emit_disk_read_nextval: FunctionTooLong \u2014 turso_core::translate::sequence::emit_disk_read_nextval 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":"core/translate/sequence.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec3be0335961fb91fa793fe1de0a8b348eeffde00e4b11a3b6bd5b0c7daa314"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::util::exprs_are_equivalent: FunctionTooLong \u2014 turso_core::util::exprs_are_equivalent 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":"core/util.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc239ea7d2c173f3be15030a4a1e11da320f930411c426f5d0e8ec75689830f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_open_write: FunctionTooLong \u2014 turso_core::vdbe::execute::op_open_write 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":"core/vdbe/execute.rs"},"region":{"startLine":13125}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa947bd947042587e6c8e12a63b23e49665760a3032593284527064a8a9057c7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ProgramState: ClassTooLong \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), 40 methods, 2 blocks, lines 1068-2036. The bar is 400 significant lines; this is 146 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1c31e10dadd0639d60d2ee5c759a626521afeeee25c1d953073e1a59532d7a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Property.get_extensional_query_gen_function: MethodTooLong \u2014 get_extensional_query_gen_function 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":"testing/simulator/generation/property.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"09185cbdf180292ea1f208de39bb419cff5f34b4773741e69773d83ba6925670"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::insert::emit_notnulls: FunctionTooLong \u2014 turso_core::translate::insert::emit_notnulls 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":"core/translate/insert.rs"},"region":{"startLine":1906}}}],"partialFingerprints":{"codehealthFindingId/v1":"c289eb20f8bcfd087061c468224ebd6339715109a246fe4ce02d0f51da62d1e4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeekEmitter.emit_termination: MethodTooLong \u2014 emit_termination 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":"core/translate/main_loop/seek.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d572f40900f18a67d0f1baf22e5f09e3065a904d65db81f4494e8b729c727a45"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SequenceCorrectnessProperty: ClassTooLong \u2014 537 significant 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, 4 blocks, lines 903-2152. The bar is 400 significant lines; this is 137 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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c5e3859d30c669a625717f32525e86a47ad7eecd579724227c6a6a999e4e51"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_auto_commit: FunctionTooLong \u2014 turso_core::vdbe::execute::op_auto_commit 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":"core/vdbe/execute.rs"},"region":{"startLine":5220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d625ec428642a8c41d4d43884be04c14287b0d19ec8dfef252ac8a2f8b071b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_whopper::worker::execute_sql_inner: FunctionTooLong \u2014 turso_whopper::worker::execute_sql_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":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b14037cc0c5e6955edbe1df6a864f2bc705769a3baceb80147db31ca888ab8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sqltest::runner::run_single: FunctionTooLong \u2014 sqltest::runner::run_single 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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae15f7afc72c1729591cbefb004b4de1a0ed6fd6e5115048ed7bff3761d2985"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProgramState: 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":"core/vdbe/mod.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e84f4796826a68aa2bf06b2e98b03f6539aaf934f9c59d4d2cb8b7c2413d6f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SimulatorEnv.new: MethodTooLong \u2014 new 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":"testing/simulator/runner/env.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd636dc6c724f56824df173e0fb573f4973ccbd520543010e71e6ec20097ab04"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: stress/main.rs: FileTooLong \u2014 661 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 161 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/stress/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff437214b300d5efc6f9724e5344fb0240cbf3e5ee65f822c589a8a032198fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::halt: FunctionTooLong \u2014 turso_core::vdbe::execute::halt 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":"core/vdbe/execute.rs"},"region":{"startLine":3593}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3881ab5480e63e97d6dbf8713df5f669dff0f52d7b9134859050aa51e0569db"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/eqp.rs: FileTooLong \u2014 658 significant 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 158 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":"core/translate/eqp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01142750e57699d9315357afdd00c3e6971995b775e57077e1d1322ebebcbc59"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::analyze::emit_index_stats: FunctionTooLong \u2014 turso_core::translate::analyze::emit_index_stats 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":"core/translate/analyze.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"605ac5ac1dd7d289e6d4900c4236665552c48825349a9e9fae2e1e6e1a9414d1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::find_select_plan_form: FunctionTooLong \u2014 turso_core::translate::optimizer::find_select_plan_form 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":1082}}}],"partialFingerprints":{"codehealthFindingId/v1":"6079349405aea9469bf7aa75ea675d242aabc08e81d73cbcb83346201911b574"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: vdbe/sorter.rs: FileTooLong \u2014 654 significant 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 154 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/sorter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"766875d6c2e66bb568055c00a9affae91ae1980254886194216076c7a21a4a8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/collate.rs: FileTooLong \u2014 645 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/collate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf795914b56969cd9a6e06e735ab70526841557d865fc4adebd4d2bd408ea9e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: model/interactions.rs: FileTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 140 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":"testing/simulator/model/interactions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6116e0efafd802d910e84a6c07c2782f6d8ae54b608aa359b3ff883b0a658bbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeekEmitter.emit_start_bound: MethodTooLong \u2014 emit_start_bound 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":"core/translate/main_loop/seek.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"46d882ba3418e1aa41eebcf4caf18c64a6c4d7c6f8955a0b92cb4b84cbc9542c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::schema::resolve_check_expr_type: FunctionTooLong \u2014 turso_core::translate::schema::resolve_check_expr_type 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":"core/translate/schema.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"097e103e65bec08eb27281a837b9e73410ef10ff4e99ffef9d31284b37c5f3d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::window::emit_window_full_scan: FunctionTooLong \u2014 turso_core::translate::window::emit_window_full_scan 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":"core/translate/window.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"683744ccefebd6bb8a763c1e8f1144c7f4f25aea70514fd2ccac675d14d7acf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/display.rs: FileTooLong \u2014 635 significant 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 135 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":"core/translate/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bed1fc9d0b57b13288a09d1d29243dbfed20d0a3f53cbbb1b61c3df8b6b940"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::join::compute_greedy_join_order: FunctionTooLong \u2014 turso_core::translate::optimizer::join::compute_greedy_join_order 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":"core/translate/optimizer/join.rs"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"878ff2310befa2ae332ac53df591507c2d6be8c97a837a0eb568f11ea7634937"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Program.normal_step: MethodTooLong \u2014 normal_step 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":"core/vdbe/mod.rs"},"region":{"startLine":2589}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cfacf01ec61b3eef906f2314d43bfd5ded966903c783894ec531bb06d32933"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sql_generation::generation::query::gen_insert_upsert_values: FunctionTooLong \u2014 sql_generation::generation::query::gen_insert_upsert_values 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":"sql_generation/generation/query.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e99b4717f191e87689a160403cc373244223e089d41b8cb03dfd11dd7527c71"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sync.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":"bindings/rust/src/sync.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb20877182dd36c31aa5570d4656ae29cbb693f860950e485749edfa8f6930c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: server/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":"postgres/server/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41526c4e492efd05b510cb9558d2a27dbeaba843ae2ee1339514c6ff3477e9ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BTreeCursor: TooManyFields \u2014 38 stored fields beside 94 methods. The bar is 30 stored fields; this is 8 over it, 1.27\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":"core/storage/btree.rs"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e734f7ad26d1bd44bcd9b4a20d805e6611a15edc220edabb6e9b87efcb910ec"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TursoBindings: TooManyMethods \u2014 328 significant lines (blank, comment-only and punctuation-only lines excluded), 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Raw/Public/TursoBindings.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"177293b269591970ba483e55d86c6af2c9480fef8f65f324c215970f685089b0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: BTreeTable: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":5652}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16b96e5ae46e24fc473ca6027411451d7178591487dd44837f054480ee2eb13"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Statement: TooManyMethods \u2014 38 methods. The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/statement.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34869866f107ccd339cbc0aa28154cbefd7efda36ce6e71afaedd79eb7776ca"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SimulatorCLI: TooManyFields \u2014 38 stored fields beside 1 method. The bar is 30 stored fields; this is 8 over it, 1.27\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":"testing/simulator/runner/cli.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f87ac2c1f6382b0d21c0c4565cf0749b18bb348b1c777bb2be2e909d30646fe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 632 significant 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 132 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":"testing/sqltest/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5260225b6ffeaa31c24ef887f7aa120dbe8dfbfb791127470002d40a8935ae0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::functions::datetime::parse_modifier: FunctionTooLong \u2014 turso_core::functions::datetime::parse_modifier 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":"core/functions/datetime.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9074d31e68801e81243ca6e8926a2ebf3a8fb84ad8a615e0b1bf9ee6d1e78a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental::vdbe_maintenance::members::emit_add_to_member: FunctionTooLong \u2014 turso_core::incremental::vdbe_maintenance::members::emit_add_to_member 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":"core/incremental/vdbe_maintenance/members.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff266346f0adc151dee6ba999d0aea793444b44d8eeee8995038b0db4456c367"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::walk::walk_expr: FunctionTooLong \u2014 turso_core::translate::expr::walk::walk_expr 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":"core/translate/expr/walk.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a672905cc1049f91ef3b15e695869cfc122c8b99e3e5833645cc803b478512"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::walk::walk_expr_mut: FunctionTooLong \u2014 turso_core::translate::expr::walk::walk_expr_mut 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":"core/translate/expr/walk.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7f45b23b0dfab4b24b37228b00ce763315bdac2f1eb213aeb70ba9e97ca5ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::try_match_index_method_pattern: FunctionTooLong \u2014 turso_core::translate::optimizer::try_match_index_method_pattern 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d04fc8aa77f1de2d308e2197616a77086ca763349d0d4bed3046cfb8a320b6f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::plan_unmatched_right_rows: FunctionTooLong \u2014 turso_core::translate::optimizer::plan_unmatched_right_rows 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"91f8e07d2caf74fec25291129abf3555ee5f470978345b5ed7836f52edda0ca8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/aggregation.rs: FileTooLong \u2014 622 significant 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 122 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":"core/translate/aggregation.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77ed6caa4b84e06679ca250ec7947fd25dbb1fe687ca172b415eb4b50fec961"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Lexer: ClassTooLong \u2014 497 significant 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, 3 blocks, lines 216-983. The bar is 400 significant lines; this is 97 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":"sqlite/parser/src/lexer.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e57f44da6f4b78b7bfbcdcb4b582036db9bee4446fa06bd214951747311325"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::apply_one_select_for_column_rename: FunctionTooLong \u2014 turso_core::translate::alter::apply_one_select_for_column_rename 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":"core/translate/alter.rs"},"region":{"startLine":4243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29a7a965308d0ad638bb00585def2e880e4d5387aad18da7b0662df6578efad"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_hash_probe: FunctionTooLong \u2014 turso_core::vdbe::execute::op_hash_probe 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":"core/vdbe/execute.rs"},"region":{"startLine":17752}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6a3b2789219bb9a45f96802055727a18fb45162bf33b304b2f0d138f5cd44c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::value::pattern_compare: FunctionTooLong \u2014 turso_core::vdbe::value::pattern_compare 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":"core/vdbe/value.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"2686366cc43f47334d9b5250e184e9f24a51d1989db460604f1a7a20884a2402"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PgClassTable.load_rows: MethodTooLong \u2014 load_rows 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":"postgres/frontend/catalog.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bab920355cf18dbf5c5042fd65695363f00568e9606e531de628d0a3f16367"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_sync_engine::database_sync_operations::decode_recovery_ops_to_logical_txn: FunctionTooLong \u2014 turso_sync_engine::database_sync_operations::decode_recovery_ops_to_logical_txn 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1319}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ebfc2877279a16d9edb669f41bf1107ece899633ea8eae35100a6cd26631887"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_whopper::worker::run_worker: FunctionTooLong \u2014 turso_whopper::worker::run_worker 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":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"12db72822a23b4d150d7b7d943cab9ed30508b1669f51c4ddbfeb01ee1d10cd8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TursoRemoteDataReader: TooManyMethods \u2014 213 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoRemoteDataReader.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0df41ff1d5829fc046ab5fa0f5e7e901d7807b3496779a5f82f2499fe51cf4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CatalogContext: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/catalog.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"430bf41b2691f96982e4bdeb1074eeaedeeefc4a276c5cb9705b81d2bbc41b4a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SharedWalCoordinationMapHeader: TooManyFields \u2014 37 stored fields. The bar is 30 stored fields; this is 7 over it, 1.23\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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"492e0d858b75c1912bd2fb455af22be591e81a1edc0bfd71642609b8042f5f0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::vectors::expr_vector_size: FunctionTooLong \u2014 turso_core::translate::expr::vectors::expr_vector_size 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":"core/translate/expr/vectors.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac378980087d8544a1de9241c702263319f60d9356c792bfeb402dd4c15e5d79"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::order::plan_satisfies_order_target: FunctionTooLong \u2014 turso_core::translate::optimizer::order::plan_satisfies_order_target 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":"core/translate/optimizer/order.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"193a9a9332f1e71424309f022344597f786e3a48e38ed5b91e5cf650bb94c01b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::subquery::plan_subqueries_from_select_plan: FunctionTooLong \u2014 turso_core::translate::subquery::plan_subqueries_from_select_plan 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":"core/translate/subquery.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"622a41ce3a64090c87342b710a3d38a01f7426145cb4aaf01acbe3e7a4402c24"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_parse_schema_step: FunctionTooLong \u2014 turso_core::vdbe::execute::op_parse_schema_step 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":"core/vdbe/execute.rs"},"region":{"startLine":14794}}}],"partialFingerprints":{"codehealthFindingId/v1":"be295476606620194c0df1e957d7914d0a6deaf58294cdf13d9986973ba2ec21"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Operation.sql: MethodTooLong \u2014 sql 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":"testing/concurrent-simulator/operations.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8e7b9dcdc4940b8b9b6d446c4a97ecaa121c7a6b35a038b0a4dc32e9069a08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: time/mod.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), declaring 51 free functions. 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":"core/time/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45072ddf381140701dab65124ccb76c6162792336d2b06bea509a739b758dc3b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EmitWindow: ClassTooLong \u2014 489 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 2 methods. The bar is 400 significant lines; this is 89 over it, 1.22\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"469e6aa4f67e859f3aacccfb6f498cff20d99fd1f91de03f3df6faf768b78514"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::emitter::delete::emit_delete_insns: FunctionTooLong \u2014 turso_core::translate::emitter::delete::emit_delete_insns 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":"core/translate/emitter/delete.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d1c4749d3e9143830346e53f54b8ae5d1dc7f32f511c54b6709d6ac7d688fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::insert::emit_pk_uniqueness_check: FunctionTooLong \u2014 turso_core::translate::insert::emit_pk_uniqueness_check 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":"core/translate/insert.rs"},"region":{"startLine":3090}}}],"partialFingerprints":{"codehealthFindingId/v1":"19fe08b366c6c42f189a3e963906bc46577aa2b2fbda8e84483467e720f254b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::window::emit_window_range_test: FunctionTooLong \u2014 turso_core::translate::window::emit_window_range_test 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":"core/translate/window.rs"},"region":{"startLine":2525}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc74f09e56843f9e542308a652a178e8ae2071948aa106422a55df4204d0cba"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashTable.spill_multiple_partitions: MethodTooLong \u2014 spill_multiple_partitions 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":"core/vdbe/hash_table.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb9374538b6094707a8954ae5913734651b5037edc6b3d95b7f4a676fbd291f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sql_gen_prop::cte::recursive_cte_definition: FunctionTooLong \u2014 sql_gen_prop::cte::recursive_cte_definition 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":"testing/differential-oracle/sql_gen_prop/cte.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9a42fc98511a0dfc8976c77e151f9e2fcc5d7bb35c98d2237c69400e05bc03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/update.rs: FileTooLong \u2014 607 significant 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 107 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/update.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b022c2f67fe3cbc4b3f530cb41421c2f30babb6edac9889fb25b864f9d971d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/view.rs: FileTooLong \u2014 605 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 105 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d5cd113b36aaf09eb5cc479ad532385c2eae9877b07b050cf61f666456527d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarFunc.fmt: MethodTooLong \u2014 fmt 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":"core/function.rs"},"region":{"startLine":1359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d843de4af85d169e1b77d9b51196a323bc4c6f7291715c33ecac4c3d8469eda6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Statement.reset_internal: MethodTooLong \u2014 reset_internal 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":"core/statement.rs"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"2962aea8970a12dc0b7a54d196acadb792a0c5ab3abe3ecf443e733502832463"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_whopper::build_workloads_and_properties: FunctionTooLong \u2014 turso_whopper::build_workloads_and_properties 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":"testing/concurrent-simulator/main.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"512b52d450b9732443c5d30835e55ff5889519acbb147cdbfea2bce24d134f69"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/custom_types.rs: FileTooLong \u2014 601 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 101 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/custom_types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d96f95414a9736de4104f15b9df4788c1fee2d9a8f3dab5f9ff31dae09a534e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TableReferences: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/plan.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"da07f5a52656197df239b6de4acb76c78ea6ad5583e33a148bda958010aa1d61"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: main_loop/open.rs: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/open.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8860fd5ea93705861957362687c62f97a0b038e918626449197d937d79ed38"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: snapshot/mod.rs: FileTooLong \u2014 600 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 100 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f9b6f336966d8a46c666e4e2c48fad44bdb0a08b9eb30db85aeefe66a869011"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::storage::btree::fill_cell_payload: FunctionTooLong \u2014 turso_core::storage::btree::fill_cell_payload 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":"core/storage/btree.rs"},"region":{"startLine":10609}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e0deb5fe1b6afb93c019eaf2ec7e3c92b4fc4b8034e5c2368cec71c7dcec02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmitGroupBy.init: MethodTooLong \u2014 init 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":"core/translate/group_by.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1edc31fed286c514e26b2cf57f147bf0e7cb370ab23b95c8bb5f6e4b380890"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: limbo_fuzzy::editdist::edit_distance: FunctionTooLong \u2014 limbo_fuzzy::editdist::edit_distance 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":"extensions/fuzzy/src/editdist.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0645f385e6f0d8cedc1471992c7fe0043dea15c323b78e8f9eefe79756af5a64"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Generated.parse: MethodTooLong \u2014 parse 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":"postgres/dump-fuzzer/src/summary.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5e5c9eb3b3c7215cab55e2afc042cf5c7b3d2ecfb6069e34d26081c73b95d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgreSQLTranslator.translate_alter_table: MethodTooLong \u2014 translate_alter_table 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":"postgres/parser/translator.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a51d02855d3b03700d901e3c391394375c40934225004f384783eec2dfcdcc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseSyncEngine.wait_changes_from_remote_inner: MethodTooLong \u2014 wait_changes_from_remote_inner 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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":1696}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbeb7720d7c8924037865a2cc81fe132ab98e8028d30df7b9b499b1f88e5a37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Whopper.new: MethodTooLong \u2014 new 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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"9438a73d1fab0ecc80bb6a125f248efefd7447329a309221e3f42269ba41abeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/row_security.rs: FileTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 97 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/row_security.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ab3bea02f5d35eb9b721c43dbb18d8fdcfc926b3bd7c28142af2bd39fb62be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Connection.sync_autoincrement_backing_tables_from_sqlite_sequence_nonblock: MethodTooLong \u2014 sync_autoincrement_backing_tables_from_sqlite_sequence_nonblock 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":"core/connection.rs"},"region":{"startLine":4397}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca431da510186a0fa4316a57e97e17f17e78f4f6c90ff99e5a8c1c9ac1bdabfe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Jsonb.serialize_string: MethodTooLong \u2014 serialize_string 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":"core/json/jsonb.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5328ece9b9cae19dfdc45495df932c3f48752107642877ee9aabd8dc3fa070a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::validate_expr_column_refs_after_drop: FunctionTooLong \u2014 turso_core::translate::alter::validate_expr_column_refs_after_drop 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":"core/translate/alter.rs"},"region":{"startLine":5179}}}],"partialFingerprints":{"codehealthFindingId/v1":"06407ae4525b13cb472d9bc7138c7a46ab90875ad87d6e3f5f9ce3ee6e3961ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::functions::translate_sequence_function: FunctionTooLong \u2014 turso_core::translate::expr::functions::translate_sequence_function 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":"core/translate/expr/functions.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f255be0ba657de03070840bd53adc81d6a9b5baf48acfce8878f4c98638aa8f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MultiprocessWhopper.new: MethodTooLong \u2014 new 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":"testing/concurrent-simulator/multiprocess.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4d0945930f66cd218565bfe8b4c8088dced99c488d2a31363689ad187a65cc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TokenType: ClassTooLong \u2014 472 significant 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, 2 blocks, lines 6-498. The bar is 400 significant lines; this is 72 over it, 1.18\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":"postgres/parser/token.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6b5e16dda0316f398f4555462763c11f339f3c8330a854644ad294c5bf74b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_window_value: FunctionTooLong \u2014 turso_core::vdbe::execute::op_window_value 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":"core/vdbe/execute.rs"},"region":{"startLine":8621}}}],"partialFingerprints":{"codehealthFindingId/v1":"511784ffda66e29a878bd68b3d32e08ca88db74d99d500d3f093c6f58e45657e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CoverageReport.fmt: MethodTooLong \u2014 fmt 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":"testing/differential-oracle/sql_gen/src/trace.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"6873c07755c1748d9f4e051479c1856c386bef5df915b7a5f1576008d6c38cdb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarFunc.is_deterministic: MethodTooLong \u2014 is_deterministic 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":"core/function.rs"},"region":{"startLine":1095}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3dbc9a5421e6b57d2f99e8cc3ec610b97ea98c6f3d44d10018064bfda3d566"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DagBuilder.derive_output_schema: MethodTooLong \u2014 derive_output_schema 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":"core/incremental/dag.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"575f33ea0ad3ba6d19623285cfc988571da65cd8c068e92a12c1f4883f20aa11"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::access_method::try_hash_join_access_method: FunctionTooLong \u2014 turso_core::translate::optimizer::access_method::try_hash_join_access_method 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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eed3e5e1219f4a3e172d4da97386f3101ce3abfd501c562b975bb930218e591"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PageInner: ClassTooLong \u2014 467 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods. The bar is 400 significant lines; this is 67 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"25992f07fb16fca6148bebdd1739f5082bcc10fbd00ae8d88e9f02bf562c2e26"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PageCache: 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":"core/storage/page_cache.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"270f8061f07f45574a30ffd0a12cb6dbdece5a280a01b33ca5bdfeef02b13a1b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Context: 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":"testing/differential-oracle/sql_gen/src/context.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3630be3fe2b3d83d3b3e99d733f48d8eb79d682d0b6ea53c02c7baa5eb204b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: json/vtab.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/vtab.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf10c8a5b74567193dec71fedc77f612ca9f0001468119384def1353cf88c43"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/integrity_check.rs: FileTooLong \u2014 580 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 80 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/integrity_check.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dad6bf8069f3d98551fc5e4b8606c6b9bc87ac785cd9d729d4a1b5c41122689"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Limbo.handle_dot_command: MethodTooLong \u2014 handle_dot_command 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":"cli/app.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"0124a145ebd753af38545a20d66ee0976eda2c1df0e3e6c66e85ef4f080f579d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarFunc.result_type: MethodTooLong \u2014 result_type 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":"core/function.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0bd056c3e02d6a706211913f215c42aead17b8e5d039ce85f17dbb0fb4a21f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::insert::emit_replace_delete_conflicting_row: FunctionTooLong \u2014 turso_core::translate::insert::emit_replace_delete_conflicting_row 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":"core/translate/insert.rs"},"region":{"startLine":3926}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfa3382a35ce58dbc195e92021efabb73cd62b759250e0e3d0a93a6a90e32f6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrent-simulator/workloads.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 75 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/workloads.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d309a884f1934d2903175a615d095b1e0b0f8660a88d8896bff9986fdb4901"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::main_loop::close::emit_table_read_advance: FunctionTooLong \u2014 turso_core::translate::main_loop::close::emit_table_read_advance 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":"core/translate/main_loop/close.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab2a3dd18b6f7ea61f1cd0eb8cefc74031719efea4fa95650facc38c1a4d168"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::planner::keep_parenthesized_join_columns: FunctionTooLong \u2014 turso_core::translate::planner::keep_parenthesized_join_columns 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":"core/translate/planner.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c94f9bee4f1091e63caabefb082635b081157da62e05f1d3a1ba28051801b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_data_type: MethodTooLong \u2014 parse_data_type 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":"postgres/parser/parser.rs"},"region":{"startLine":1757}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b284d2480223621f97ebf33caaed83c906067ce495e03efa7d1d9e0bd89a89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PostgreSQLTranslator.translate_binary_expr: MethodTooLong \u2014 translate_binary_expr 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":"postgres/parser/translator.rs"},"region":{"startLine":3894}}}],"partialFingerprints":{"codehealthFindingId/v1":"1256965956fba5e97fb2a67bb3826a88d7c6205fad27d8cfde6b577fc0c9a3ee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: numeric/mod.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":"core/numeric/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2dbb55e5ab2457defb679c4928e40f2d4cbd75ebbf9ae4c3579a7a9d5b873f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/mod.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":"core/translate/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"265fc0b3a41183dee452d80be2648f172fd4698e7d0f6ba6f4dc0b28aef74f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ShadowTablesMut: 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), 30 methods, 4 blocks, lines 346-1071. 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":"testing/simulator/runner/env.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"7880bce9fe3701db2c2255c5c057f6a05d42529cd2667d168cf9d350ac8fdde3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_pg::session::prepare_statement_inner: FunctionTooLong \u2014 turso_pg::session::prepare_statement_inner 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":"postgres/frontend/session.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dd7d5ee8f2c32075cab79a02bbf352b3391d2820194cee988f148c5922ebfb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Pager: TooManyFields \u2014 34 stored fields beside 149 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e01ecadd152aa9cf373e749c8b9a1bf28619b05374ec823d8b43fd4582dd0d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Program: 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":"core/vdbe/mod.rs"},"region":{"startLine":2197}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d36c4773dd6bb03a7f86862b2aeaf4d145ede85c452a5f6047a7c5e7f79e24"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Turso.Data/TursoSyncDatabase.cs: FileTooLong \u2014 566 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 66 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":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd51eacde3a840db97e542b668a57ce72f6a3b41d80a66006a58b319d09faa89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::aggregation::emit_ungrouped_aggregation: FunctionTooLong \u2014 turso_core::translate::aggregation::emit_ungrouped_aggregation 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":"core/translate/aggregation.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf5bc48980fbf28189f066bb6aa82fca3eee9e355aa007c076d73b65e58689e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::constraints::estimate_bound_expr_selectivity: FunctionTooLong \u2014 turso_core::translate::optimizer::constraints::estimate_bound_expr_selectivity 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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":1890}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9cd183054fdb164bb0ed19e0f8e360369437728053fc6ceeb88d53d5c36531"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::util::view_source_from_select_table: FunctionTooLong \u2014 turso_core::util::view_source_from_select_table 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":"core/util.rs"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"865feacd2f63472d1525d23de773428b3398ccd0705f66ca2d416537e826f964"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/io_uring.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":"core/io/io_uring.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee3371cbc5915f49b3cf7ed93f0a25c2d478c71977bd0fd9459f9a3bb2fdc3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::delete::prepare_delete_plan: FunctionTooLong \u2014 turso_core::translate::delete::prepare_delete_plan 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":"core/translate/delete.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"9210b1798bdb3234d9cd9918887bcbb7f1de7f9f48569943213f3c20fb5c743b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::insert::bind_insert: FunctionTooLong \u2014 turso_core::translate::insert::bind_insert 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":"core/translate/insert.rs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a00c087d19e2b69a1662bd87043a410f3fd7a1de293ac1135ffb96cd2f6922"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmitOrderBy.init: MethodTooLong \u2014 init 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":"core/translate/order_by.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e6bd13a06dbf50035502769ffeda2dbfaa2896e61dbdfbda9ace56399fe5a9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_joined_tables: MethodTooLong \u2014 parse_joined_tables 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":"sqlite/parser/src/parser.rs"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1532558491be433f75dbc59ba5e16209144d4112507836f866ccb595336ffe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: io/mod.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":"core/io/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f571d85213c5b3a53433a13b8ef081fa4e3aabebf50d629ccb732f4c724a8fb3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MvStore.bootstrap_nonblock: MethodTooLong \u2014 bootstrap_nonblock 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":"core/mvcc/database/mod.rs"},"region":{"startLine":5128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1630046b386359c7378bcdf2bb4e592ba487a53560bffc1a1d0a6c9b8de4146"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Schema.populate_indices: MethodTooLong \u2014 populate_indices 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":"core/schema.rs"},"region":{"startLine":3651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e757fad20f03c54f9285e659d42431e29a4869c0ec928c8d2d2b1cf6f866f356"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::apply_select_for_column_rename: FunctionTooLong \u2014 turso_core::translate::alter::apply_select_for_column_rename 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":"core/translate/alter.rs"},"region":{"startLine":4109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c147e3fd62fed0c483b5920a306ff18f6a6ff00ae7552c47ac075689b360d4cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EmitOrderBy.emit: MethodTooLong \u2014 emit 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":"core/translate/order_by.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c059500a58245cd23df8abb89cfa219daf1ffbd6532c3bde59effaa8878496a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scanner.feed_line: MethodTooLong \u2014 feed_line 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":"postgres/regress/main.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba8c4ab579637815c8dfafc19b908ee197c16c88274d2156f2b2c2e296345b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sql_gen::generate::stmt::generate_create_table: FunctionTooLong \u2014 sql_gen::generate::stmt::generate_create_table 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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6bf72aafb2cd2b2e6decd2c6868c5f8d15181b35065eed23bc9e66935b5fec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: go/driver_db.go: 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":"bindings/go/driver_db.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2657b46076fe521e5f29c33bca30963481d428c5e7e12f88a614c30de80ab7b9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TursoDataReader: TooManyMethods \u2014 174 significant lines (blank, comment-only and punctuation-only lines excluded), 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":"bindings/dotnet/src/Turso.Data/TursoDataReader.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3529705f26fe5f27e8d31398292434b8226a45b10b29c7d88091c06209db742"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TursoStatement: 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":"bindings/java/src/main/java/tech/turso/core/TursoStatement.java"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f0b98eae22c932ed753ae9cd279a1634ab30ac4f1a4d481693d23ed560c83a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::incremental_blob::build_blob_program: FunctionTooLong \u2014 turso_core::incremental_blob::build_blob_program 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":"core/incremental_blob.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81e409dcb08a9ec024ee58714a2c80300b421cb5a9deb3455851f9544e5a952"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_pg_dump_fuzzer::main: FunctionTooLong \u2014 turso_pg_dump_fuzzer::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":"postgres/dump-fuzzer/src/main.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf81b66648f8083898625443434549449d839b6fedaeeed147f633441797ac9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: logical_log/serializer.rs: FileTooLong \u2014 548 significant 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 48 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":"core/mvcc/persistent_storage/logical_log/serializer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b73ddbcb30f73f641121b07bb74114f72bd95eab5bf3bc2e869b6fa71d871"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Turso.Data/TursoConnection.cs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ecf7cf91d5d0b9f03c6759eacdb14df1df83cf9485123300fef4f42f804a59"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cli/mcp_server.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 72% of them inside a single declaration: TursoMcpServer (2 blocks, 202-818). 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":"cli/mcp_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b98bb61985f52bcf55e53c471041f6ffabc009926bc3ba996fabbfa1f0d1837"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TursoSyncDb.handleIoItem: MethodTooLong \u2014 handleIoItem runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"bindings/go/driver_sync.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa5b1aac4e8455eb252348d23c4fd6526bf9229b2f7e5f8a5878e6fdf4fbdb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: promise.executeBatch: FunctionTooLong \u2014 executeBatch runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2a74b018bf17b5040651bcb016068e12cc399aa4aebc1aba25c0ca0009b12c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Database.new_connection: MethodTooLong \u2014 new_connection 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":"core/database.rs"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea30a49a1181e42f9ad6b0b5095c7586c7d552038871214bdc16275e1485fc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::insert::emit_unique_index_check: FunctionTooLong \u2014 turso_core::translate::insert::emit_unique_index_check 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":"core/translate/insert.rs"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e60a1a6caa535a891d027b5fec02f56727b938566910b7bbc0b03be205f1047e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::multi_index::consider_multi_index_union: FunctionTooLong \u2014 turso_core::translate::optimizer::multi_index::consider_multi_index_union 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":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"129d6e6413236de2853475b7fb815c8368338c2d2d25c1c1d0ae37cb0a412eec"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashTable.load_spilled_partition: MethodTooLong \u2014 load_spilled_partition 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":"core/vdbe/hash_table.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f554a7d36b9e7534bade0a57ff7f3be6ad6219e6e6af8692a159d4cca01cc183"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: concurrent-simulator/main.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2744cd1dadae987f446d290a074743531275455a8419c0ad054d57b92542e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::storage::btree::free_cell_range: FunctionTooLong \u2014 turso_core::storage::btree::free_cell_range 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":"core/storage/btree.rs"},"region":{"startLine":9797}}}],"partialFingerprints":{"codehealthFindingId/v1":"e255b54ce9696a712e1c5e9f6ac6e0cf145f789447c89e435520d919ddf02070"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::translator::translate_case_expr: FunctionTooLong \u2014 turso_core::translate::expr::translator::translate_case_expr 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":"core/translate/expr/translator.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a3756aab10ef2b0ddf115db9c5de0f8e2c6eb5c4cf78ccbe60e39aeff852c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::trigger_exec::execute_trigger_commands: FunctionTooLong \u2014 turso_core::translate::trigger_exec::execute_trigger_commands 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":"core/translate/trigger_exec.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c434839dc78c4ecc35a821032c40becb5ba994cf9277467dcd812c92b2972880"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::window::emit_first_value_nth_value_lookup: FunctionTooLong \u2014 turso_core::translate::window::emit_first_value_nth_value_lookup 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":"core/translate/window.rs"},"region":{"startLine":3714}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcb9b39c1cc3380768c86d499e71ebfa6294d309955c4a5cbdf52b03e856a43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::finalize_agg_payload: FunctionTooLong \u2014 turso_core::vdbe::execute::finalize_agg_payload 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":"core/vdbe/execute.rs"},"region":{"startLine":8098}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8a519455b6aa0bdad0f2383b1709e7976371774675dcdb4c747390633263fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_delete: FunctionTooLong \u2014 turso_core::vdbe::execute::op_delete 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":"core/vdbe/execute.rs"},"region":{"startLine":12153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1482d6883f429a8205918ccc735fb2319522a80877cd6729596fc68b5d013f50"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vdbe::execute::op_idx_insert: FunctionTooLong \u2014 turso_core::vdbe::execute::op_idx_insert 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":"core/vdbe/execute.rs"},"region":{"startLine":12423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b14ed5ac55924da96e836791d210d9f37a175583cf339a7f29841e3ee714596"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_serverless_differential::gen_op: FunctionTooLong \u2014 turso_serverless_differential::gen_op 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":"serverless/rust/differential/lib.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da5f81a08229083052286399637d9bb2a6d547a77c2fcb62ad2bb839849d3d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::expr::expr_type::type_of: FunctionTooLong \u2014 turso_core::translate::expr::expr_type::type_of runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/expr_type.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb38b986de9dd03ba11a946de3c3354caf776a1837be70f1c0338caaccdc8af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::vector::operations::convert::vector_convert: FunctionTooLong \u2014 turso_core::vector::operations::convert::vector_convert runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vector/operations/convert.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eeea7aaef3701f176cc08fa2d09f20da49a58f0b2e800e67f6c48676f851745"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_serverless::batch::decode_batch_result: FunctionTooLong \u2014 turso_serverless::batch::decode_batch_result runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/rust/batch.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"5476ddc06a4f8db7e1d4f44a99ec70dd1d5eab62d78dadf2abee3f3b15bfed0d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Parser.parse_named_column_constraints: MethodTooLong \u2014 parse_named_column_constraints runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":4235}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89e44d2450dc8153c5406c0cc3a12e82d58474d81f3cbae6fa9c1eac60a6039"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Connection: TooManyMethods \u2014 32 methods, declared across 2 files: src/connection.rs (28), src/transaction.rs (4). The bar is 30 methods; this is 2 over it, 1.07\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":"bindings/rust/src/connection.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a6a14c3bb0f51946f2e803e224677c14d4e061015e6876f48a03bbfec91112"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WalFile: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"053e667f13d8528a9bbb7cc4e3c8981124621f8e3d237b65a9a5f973b012cd70"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ImmutableRecord: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/types.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0149405c68197945ebc9942a70ae4f45df36e995997ba2735b097b8ba167df"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: sql_gen::generate::expr: TooManyFunctions \u2014 32 free functions. The bar is 30 free functions; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/expr.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce32372d4da436dab909d1e2267477712e3c41001ab90c6cdbfc59d6acdf3702"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScalarFunc.arities: MethodTooLong \u2014 arities 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":"core/function.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1258409c79b5f4e4f8f70a5c655f4083ffd00b9ec45ec0b38a6ff4184bd7d49f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HashBuildPlanner.prepare: MethodTooLong \u2014 prepare 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":"core/translate/main_loop/hash.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcc76583dc560836abd36500980d6e0ee7d27bd0bef7d80ab7eef13049b47a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::window::emit_function_step: FunctionTooLong \u2014 turso_core::translate::window::emit_function_step 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":"core/translate/window.rs"},"region":{"startLine":3288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5301a939a9ccc43b6f111fb0691bc4e7a661a90127502e7642ef4e5697e9ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_sync_engine::database_sync_operations::logical_op_to_tape_operations: FunctionTooLong \u2014 turso_sync_engine::database_sync_operations::logical_op_to_tape_operations 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"48415e73a69cb1f09fc714b47dc9669f0eea1d8348ac4cd898e6979869391ec7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PageCache: ClassTooLong \u2014 423 significant 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, 3 blocks, lines 101-987. The bar is 400 significant lines; this is 23 over it, 1.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/page_cache.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb7d2a80b4e3ad044b5aa35f933ee983501f46be30b04d1f418c771d099bf7d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SyncEngine.new: MethodTooLong \u2014 new 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":"bindings/javascript/sync/src/lib.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6315908a8013af4158331f61a19eac07b0ead57e0ce10eb0e43481e8079345"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::validate_select_column_refs_after_drop: FunctionTooLong \u2014 turso_core::translate::alter::validate_select_column_refs_after_drop 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":"core/translate/alter.rs"},"region":{"startLine":5319}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f822c87f6458357fc79420663d7ec3a3682f2f7d8bc2079b96b3dc0adcfc5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_pg::catalog::pg_get_constraintdef: FunctionTooLong \u2014 turso_pg::catalog::pg_get_constraintdef 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":"postgres/frontend/catalog.rs"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"120d3ac289d15097efa712c19a38b3e5daa80ba91a1fb32820728378cd93fa8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: incremental/view.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":"core/incremental/view.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e7657b8d2fe74988f0e9ead5776501b80d77de1dde62338953889b3978e9fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: regress/describe.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":"postgres/regress/describe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1778014844b84ed9f507e896b3c7ffb9ee2a90651297da6af4afb4046c016586"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MvStore.delete_from_table_or_index: MethodTooLong \u2014 delete_from_table_or_index runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":5647}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf595205f0e9d65aa1161ef487e44235737183e3b63b2ecd8da2e46ee296fd6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TypeDef.from_create_type: MethodTooLong \u2014 from_create_type runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80c257885cdedf34a6e2c65a2bd88bb2f227b196fe01ced89e4329e966dce99"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BTreeCursor.indexbtree_seek_impl: MethodTooLong \u2014 indexbtree_seek_impl runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2962}}}],"partialFingerprints":{"codehealthFindingId/v1":"60dc58b364bb300d1a7fc2f57e2b2ad5162078584c41ff091764c36958dbe1ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::main_loop::close::replace_subquery_output: FunctionTooLong \u2014 turso_core::translate::main_loop::close::replace_subquery_output runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/close.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"553f947395a401d1d636a28cd1ef912fb5cb876f4fc88ec90aeba0d9772c66a9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TypeDef: 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":"core/schema.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87503c9d7ce1f07706a61ecf5e615a357950c0bcab93bd0ea3f833eda9c54b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CheckpointStateMachine.new: MethodTooLong \u2014 new runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9f979f265a3bcc020a6838498dfeeb647515053e39ce99bbda1acf74322acd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::alter::apply_upsert_for_column_rename: FunctionTooLong \u2014 turso_core::translate::alter::apply_upsert_for_column_rename 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":"core/translate/alter.rs"},"region":{"startLine":3980}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8690142f209fb89a14a4c31b553e731c0d5e888cba275d0a030fec8954b7ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::main_loop::close::emit_autoindex: FunctionTooLong \u2014 turso_core::translate::main_loop::close::emit_autoindex 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":"core/translate/main_loop/close.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf186caf4ddc2e769766d5c331a90bd4a7e1a88de5ad3e3af586554fcc958ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ClassCatalog.apply: MethodTooLong \u2014 apply 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":"postgres/frontend/classes.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"999b69d05433432961ff7357681ee1f2d9082d383bc51e428f19eb49ba926468"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: JDBC4PreparedStatement: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded), 65 methods. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b47bb679955e300169e353b854978f96ad64efa3cf18ce90dfde46fce89b10"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SqliteConnectionStringBuilder: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 the bar. The type holds no instance state, so there is no shared data to group its members by. To reduce it, split it by area instead: give each cohesive family of members its own smaller type, so no one type has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnectionStringBuilder.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f976c2ea537fd8ef90aac1b4c0d16b25ac28ba0ee74be87baad48a6657a8fbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::json::jsonb::validate_element: FunctionTooLong \u2014 turso_core::json::jsonb::validate_element 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":"core/json/jsonb.rs"},"region":{"startLine":3624}}}],"partialFingerprints":{"codehealthFindingId/v1":"326bf544366a22bae46dbd250aa698861cd4d8e515eadaf7f8b56cafc8880cdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::mvcc::persistent_storage::logical_log::try_parse_one_op_from_buf: FunctionTooLong \u2014 turso_core::mvcc::persistent_storage::logical_log::try_parse_one_op_from_buf 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1377}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc334620b36717ac9296d29004e799044f4e186b33326f103c9abd9d59bf42e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::optimizer::multi_index::analyze_and_terms_for_multi_index: FunctionTooLong \u2014 turso_core::translate::optimizer::multi_index::analyze_and_terms_for_multi_index 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":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"820869c0aa716a73a94e24a7c3ea1b769ab6c813ca52e02db026be526a031357"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseSyncEngine.checkpoint: MethodTooLong \u2014 checkpoint 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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b05c188e90b30e119e94905686a749fbfaa8a376b44f849970b43a47f4654b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: go/bindings_sync.go: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/go/bindings_sync.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c6fa8935212e1a91feb6bb5ed542a347d9a3f442b8167904f3e02f4def5665"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: translate/order_by.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), about 76% of them inside a single declaration: EmitOrderBy (87-624). The bar is 500 significant lines; this is 7 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":"core/translate/order_by.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0029b69bf4d3a443fed568fe6ccaca10a746de9ee7ef646092ec47b979d09d44"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EqpDetail.write_json: MethodTooLong \u2014 write_json 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":"core/translate/eqp.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6cef7b25c15972c1cfa32d78f9a94335631779c7fcc2a2723bf00b0efd8db1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ForeignKeyActions.prepare_fk_delete_actions: MethodTooLong \u2014 prepare_fk_delete_actions 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":"core/translate/fkeys.rs"},"region":{"startLine":2322}}}],"partialFingerprints":{"codehealthFindingId/v1":"859d40b0582d7a83637aba2327bdcd12f2f5244e771a1d9ea2063500a6205071"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: turso_core::translate::subquery::emit_materialized_subquery_table: FunctionTooLong \u2014 turso_core::translate::subquery::emit_materialized_subquery_table 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":"core/translate/subquery.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d882329fa13bd2613ccc8fd11fbe563d328ce997cd0269f634f07201f4b4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (6 members, 14 shared lines): postgres/cli/main.rs:283-316 | postgres/cli/main.rs:345-377 | postgres/cli/main.rs:379-408 | postgres/cli/main.rs:410-440 | postgres/cli/main.rs:442-476 | postgres/cli/main.rs:539-572 \u2014 These 6 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 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":"postgres/cli/main.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd141ea0200289cd0477ccba25a15830f0b679dadbd0b060ba294e0f6d2cc6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 30 shared lines): core/json/jsonb.rs:347-406 | core/json/jsonb.rs:426-490 | core/json/jsonb.rs:512-571 | core/json/jsonb.rs:593-652 \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":"core/json/jsonb.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"549ad015b3a36750d81c8636b391d9c3fa76edaa1ce8f1edbaf330d1b297c592"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 31 shared lines): core/translate/display.rs:109-238 | core/translate/display.rs:242-343 | core/translate/display.rs:347-470 \u2014 These 3 members are variants of one another: a block of 31 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":"core/translate/display.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"015d88ab9836f3e6134e6627deadd839864dcf1c77f1e9b743caad073399378b"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (135 shared lines): core/translate/fkeys.rs:1162-1520 | core/translate/insert.rs:4085-4302 \u2014 These two members are variants of one another: 135 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":"core/translate/fkeys.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0694ca298233b0f9e2d8fb81a401ab2f8c96487513c5ed1eb4f87559a8e8c8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (110 shared lines): core/translate/expr/walk.rs:13-191 | core/translate/expr/walk.rs:371-550 \u2014 These two members are variants of one another: 110 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":"core/translate/expr/walk.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"209dcc6ec23f9cc69082e843925ace8a80f18bfd353487773cc3ed62d02cc11a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (96 shared lines): core/index_method/toy_vector_sparse_ivf.rs:505-768 | core/index_method/toy_vector_sparse_ivf.rs:770-1040 \u2014 These two members are variants of one another: 96 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35a0f3ac8cc1340496d7e361ca7b8205275235762df5ade1342d9f2696becf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (95 shared lines): core/translate/sequence.rs:193-426 | core/translate/sequence.rs:444-653 \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":"core/translate/sequence.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"549c4817fe6b240a09f4ef46feb9920713eb8dd54a90a5e49a19770fab890df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (60 shared lines): core/schema.rs:8993-9081 | core/translate/index.rs:1263-1353 \u2014 These two members are variants of one another: 60 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":"core/schema.rs"},"region":{"startLine":8993}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6335682e29f2fa5e5052c60b30f1fb27feebade260f08ef3edfed1b128c6a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (52 shared lines): testing/differential-oracle/sql_gen_prop/create_index.rs:196-260 | testing/differential-oracle/sql_gen_prop/create_index.rs:266-361 \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":"testing/differential-oracle/sql_gen_prop/create_index.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63dd29c306470c34b68f6075a80c477f53e134b3f5ba950f1314f8cb0f232a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (45 shared lines): testing/sqltest/src/backends/cli.rs:239-368 | testing/sqltest/src/backends/js.rs:137-220 \u2014 These two members are variants of one another: 45 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f8217fa81feb78cfc2072dfbab74ea84acd203c2808812c5d03f2e776d76ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): testing/simulator/runner/env.rs:1644-1742 | testing/simulator/runner/env.rs:1813-1997 \u2014 These two members are variants of one another: 37 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":"testing/simulator/runner/env.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b3ac55defc86142e841dd4f6d9c73936753450bd4a28a1bf8a97d51d58b3f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): core/vdbe/hash_table.rs:1576-1681 | core/vdbe/hash_table.rs:1689-1857 \u2014 These two members are variants of one another: 35 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":"core/vdbe/hash_table.rs"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aac4ab829e8e7f191ce2232b3a9ccef035f0eb1c2dc379c9e9dc53fc411cf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): core/json/mod.rs:919-957 | core/json/mod.rs:964-1002 \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":"core/json/mod.rs"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"998d321a0abe6156f0036918f28049985f416e72f42f813d18fa018aa8becf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): postgres/parser/parser.rs:448-485 | postgres/parser/parser.rs:2016-2091 \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":"postgres/parser/parser.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4083eecb4a7ca47c473d08f326fa657e36846b37fe65d719064afbede981b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): core/functions/string.rs:13-38 | core/functions/string.rs:57-140 \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":"core/functions/string.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cea8f63f5747f9e29c40ef3dc69cc12f0db98fbca5784af8608c6f5fe6a089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): postgres/parser/translator.rs:661-873 | postgres/parser/translator.rs:1345-1425 \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":"postgres/parser/translator.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad880d739eeb8f57fcafb067a3e13b74f0994ae63839f8cb565b506b66a403ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): core/vector/vector_types.rs:119-145 | core/vector/vector_types.rs:146-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":"core/vector/vector_types.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"15078251fd754dc395e99d3e85f24a9c2f16c974a4ec7abcd39a1cf56af77925"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): testing/sqltest/src/generator/mod.rs:670-701 | testing/sqltest/src/generator/mod.rs:703-748 | testing/sqltest/src/generator/mod.rs:750-797 | testing/sqltest/src/generator/mod.rs:806-860 | testing/sqltest/src/generator/mod.rs:987-1016 | testing/sqltest/src/generator/mod.rs:1097-1143 | testing/sqltest/src/generator/mod.rs:1145-1194 | testing/sqltest/src/generator/mod.rs:1199-1258 | testing/sqltest/src/generator/mod.rs:1281-1334 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"17678e79f17495f6890d7b2a08499c51be364685eccf141cd6e3bfe928432b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): core/json/mod.rs:356-392 | core/json/mod.rs:399-434 | core/json/ops.rs:78-106 | core/json/ops.rs:113-139 | core/json/ops.rs:146-181 | core/json/ops.rs:188-223 | core/json/ops.rs:230-266 | core/json/ops.rs:273-309 \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":"core/json/mod.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"5140388c268979847fe2c83a08baa33e14177cc58c9963e43bba2eec5fa2cef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): sdk-kit/src/capi.rs:165-201 | sdk-kit/src/capi.rs:219-261 | sdk-kit/src/capi.rs:269-283 | sdk-kit/src/capi.rs:296-319 | sdk-kit/src/capi.rs:327-339 | sdk-kit/src/capi.rs:364-378 | sdk-kit/src/capi.rs:387-404 | sdk-kit/src/capi.rs:414-439 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d763cee060046b6f69189f3b2877c976b44a290562fcf94a2a6300d391ffba54"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): core/time/mod.rs:252-266 | core/time/mod.rs:571-585 | core/time/mod.rs:588-602 | core/time/mod.rs:605-625 | core/time/mod.rs:628-642 | core/time/mod.rs:803-815 \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":"core/time/mod.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dfc02920bfcae0f23e3f3c1e133f04d53ef832ed460e92442cf7cbdd94019ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): core/translate/emitter/mod.rs:1438-1536 | core/translate/emitter/mod.rs:1549-1664 | core/translate/emitter/mod.rs:1672-1747 | core/translate/schema.rs:1790-1836 | core/translate/schema.rs:1869-1939 | core/translate/schema.rs:2977-3048 \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":"core/translate/emitter/mod.rs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"0718171774f429fb6d0a6405c29e444608e47957592a2e8d7cb67a6caf1b31d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): extensions/fuzzy/src/lib.rs:18-32 | extensions/fuzzy/src/lib.rs:82-96 | extensions/fuzzy/src/lib.rs:177-194 | extensions/fuzzy/src/lib.rs:198-212 | extensions/fuzzy/src/lib.rs:231-245 | extensions/fuzzy/src/lib.rs:330-344 \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":"extensions/fuzzy/src/lib.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9254dc6ac2846eccc77e3d60e22ae8a018a2a005f464667879c10dc3b581237e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): core/index_method/fts/mod.rs:2996-3027 | core/index_method/fts/mod.rs:3030-3071 | core/index_method/fts/mod.rs:3075-3086 | core/index_method/fts/mod.rs:3091-3111 | core/index_method/fts/mod.rs:3718-3791 \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":"core/index_method/fts/mod.rs"},"region":{"startLine":2996}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca91f50264681d25518d1891808b471f729361ada08ac48a623213c46aa0fb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): core/vdbe/execute.rs:1200-1393 | core/vdbe/execute.rs:13130-13306 | core/vdbe/execute.rs:13418-13445 | core/vdbe/execute.rs:13452-13477 | core/vdbe/execute.rs:13484-13509 \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":"core/vdbe/execute.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe67317fa05e0fc6ac45e323259b9217c1e5331594c8d68469c9d87cbd9ab90"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): testing/sqltest/src/generator/mod.rs:358-430 | testing/sqltest/src/generator/mod.rs:436-485 | testing/sqltest/src/generator/mod.rs:549-604 | testing/sqltest/src/generator/mod.rs:612-663 | testing/sqltest/src/generator/mod.rs:1026-1095 \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":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d02177316776be205d8c4aee30ffecdacf64c3f84211f1d9f49fc13a8328d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/incremental/vdbe_maintenance/aggregate.rs:120-1114 | core/incremental/vdbe_maintenance/arrangement.rs:36-465 | core/incremental/vdbe_maintenance/members.rs:51-93 | core/incremental/vdbe_maintenance/set_op.rs:320-1112 \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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0c05b26f8e00d66c16a788336135192c619585d71913bf2fe5386e9bf1a00e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/io/generic.rs:19-33 | core/io/io_uring.rs:460-483 | core/io/unix.rs:50-73 | sync/engine/src/sparse_io.rs:23-36 \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":"core/io/generic.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"253c5a6f344f8a45f0b4a5f6f929ec7681b9ab7eb90cb509a76e792c13e6b29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/storage/encryption.rs:465-477 | core/storage/encryption.rs:480-492 | core/storage/encryption.rs:495-507 | core/storage/encryption.rs:515-527 \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":"core/storage/encryption.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c9b8fbfe3eb670da0da39f1b11e4c9407ef446e7a5d4923f917b065cbabe68"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/time/mod.rs:903-927 | core/time/mod.rs:930-954 | core/time/mod.rs:957-981 | core/time/mod.rs:984-1008 \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":"core/time/mod.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7b50069fdc3cd9cb98bbe848556c704e16b7b4f8fa35e6f4db38c97e2195a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/translate/emitter/mod.rs:2238-2303 | core/translate/emitter/update.rs:1105-2807 | core/translate/upsert.rs:1851-1882 | core/translate/upsert.rs:1894-1921 \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":"core/translate/emitter/mod.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb517dfea7d0588f0af37389967ee43b2b4deb50898220f6c6528f6b888b192"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/vdbe/execute.rs:7015-7055 | core/vdbe/execute.rs:7079-7119 | core/vdbe/execute.rs:7127-7167 | core/vdbe/execute.rs:7175-7215 \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":"core/vdbe/execute.rs"},"region":{"startLine":7015}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c8e5a0a691189bbd5dd37a1fccddced18b57ccd7cdf7ca98e7f6f27427eb71"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/vdbe/hash_table.rs:2286-2301 | core/vdbe/hash_table.rs:2305-2332 | core/vdbe/hash_table.rs:2336-2372 | core/vdbe/hash_table.rs:2377-2402 \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":"core/vdbe/hash_table.rs"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1da724540d70eef9add9a608fdb65836f4a2a7b136e59af27a735f6e35c533"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/vector/mod.rs:122-135 | core/vector/mod.rs:137-150 | core/vector/mod.rs:152-165 | core/vector/mod.rs:167-180 \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":"core/vector/mod.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba85e7d0c168adde946d493a6e59ecac03442215b2c74ab1ff2bbb713a11f589"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): core/vector/operations/distance_cos.rs:14-41 | core/vector/operations/distance_dot.rs:14-41 | core/vector/operations/distance_l2.rs:14-43 | core/vector/operations/jaccard.rs:6-33 \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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"610fa44b89224889176c210d922181d57314622a63ce67854857e845a59d1bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): postgres/parser/parser.rs:100-194 | postgres/parser/parser.rs:268-304 | postgres/parser/parser.rs:307-340 | postgres/parser/parser.rs:623-705 \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":"postgres/parser/parser.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5967f814a84485c400d88d27dcd92e2354b671bbc8123d1fde77e9a6c12c164"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): sync/engine/src/database_sync_operations.rs:1919-2090 | sync/engine/src/database_sync_operations.rs:2098-2193 | sync/engine/src/database_sync_operations.rs:2212-2293 | sync/engine/src/database_sync_operations.rs:3417-3503 \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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"71cdc77ba6be8fc96bc110690985c5c99fd0537d58a3a7a0fe3798e1e0561009"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): testing/sqltest/src/backends/cli.rs:112-149 | testing/sqltest/src/backends/js.rs:79-115 | testing/sqltest/src/backends/rust.rs:106-159 | testing/sqltest/src/backends/tursopg.rs:75-173 \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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddaaed3f539324fdaf9cab56ccd1010d03d9cbe0bff0e4f9c9de4a900fc01be"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:173-190 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:194-211 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:215-232 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:344-365 \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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26f04b63b31d14b958e3214cf00007d533519c648a146203bd976b77e335b58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (112 corresponding lines): core/mvcc/database/mod.rs:9486-9601 | core/mvcc/database/mod.rs:10533-10644 \u2014 These two members are one piece of code written twice and then edited apart: 112 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":9486}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a65937aa965910965d4875eed2529aa105d0b74063e5fcb8298b4aa2a86d23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:1023-1077 | bindings/dotnet/src/Turso.Data/TursoDataReader.cs:341-403 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"07359f0d29e5b6f5795e0f588cab53dc0624c11653624e1b0031f842f02ee761"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): core/mvcc/cursor.rs:972-1047 | core/mvcc/cursor.rs:1059-1137 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73e844901ff913218d69b808d84b7dffd285582d545e07ab88eace2523507c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (86 corresponding lines): core/mvcc/cursor.rs:1444-1536 | core/mvcc/cursor.rs:1541-1626 \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":"core/mvcc/cursor.rs"},"region":{"startLine":1444}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cf525464f71e29eb44de7957b6e03021eddf27a3e5fc807e18c4d2e0c3f418"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (85 corresponding lines): core/translate/subquery.rs:1891-1984 | core/translate/subquery.rs:1998-2082 \u2014 These two members are one piece of code written twice and then edited apart: 85 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/subquery.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"536287130b312c930027e0d3734c6a3f90a72698c5aea3944c3ab88087c69def"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): testing/differential-oracle/sql_gen/src/ast.rs:335-385 | testing/differential-oracle/sql_gen/src/ast.rs:389-444 \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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae60250e365dbfba782e73652c2d654c6b2739524668d5fa87073e486f23fbd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (87 corresponding lines): testing/simulator/runner/differential.rs:66-152 | testing/simulator/runner/doublecheck.rs:89-177 \u2014 These two members are one piece of code written twice and then edited apart: 87 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/differential.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"988098cc30a3337a673e09c71a0b05f806d66a9006cd15e4db8f96fa54b99bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (81 corresponding lines): sql_generation/generation/predicate/binary.rs:43-147 | sql_generation/generation/predicate/binary.rs:155-235 \u2014 These two members are one piece of code written twice and then edited apart: 81 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/generation/predicate/binary.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c80128341dd1ad0e731cd17dd15ac151e4565995a0401a8111d742ca73dabde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): core/mvcc/database/mod.rs:5433-5499 | core/mvcc/database/mod.rs:5510-5570 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":5433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e242bb748242ca3d1415deabbb478b95a8d93b6fb697ba4afa8cd0af780d155"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): cli/app.rs:1268-1333 | postgres/cli/main.rs:693-750 \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":"cli/app.rs"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0349967153354037719e829234610d8e48b9fa48e544cbc5abd5c9506b29781"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (64 corresponding lines): postgres/client/lib.rs:138-201 | postgres/regress/main.rs:1524-1592 \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":"postgres/client/lib.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"603d917947f6de7b0ad272fd90bff07e4852c0c8052a7d4a5242ed9f3527b44e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): core/storage/wal.rs:1039-1112 | core/storage/wal.rs:2109-2174 \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":"core/storage/wal.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2cacccc2d49020c539d3e9b7ffb02120f3c29bc25596bb7fdd2801f3d344eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 36\u002B corresponding lines): testing/differential-oracle/sql_gen/src/ast.rs:451-494 | testing/differential-oracle/sql_gen/src/ast.rs:498-533 | testing/differential-oracle/sql_gen/src/ast.rs:538-577 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 36 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25bae5b7c9fe8276b22a7be297c2b9aa34b746112f2a8e50f09abc3ccbd2cde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): sql_generation/generation/predicate/binary.rs:245-305 | sql_generation/generation/predicate/binary.rs:313-364 \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":"sql_generation/generation/predicate/binary.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1230d230f7b76be7d67d9ed9cda31f08bb2fb4746f29b86b97d93026fc801403"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): postgres/client/lib.rs:87-125 | postgres/regress/main.rs:1475-1512 \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":"postgres/client/lib.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9457a02d8f602b19624180fe499ed1d16807e6b8a8ce4160c2913c70e7eb64e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): sync/sdk-kit/src/rsapi.rs:301-354 | sync/sdk-kit/src/rsapi.rs:356-417 \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":"sync/sdk-kit/src/rsapi.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceef5d3e1ae03cf8eb01d8a9ef6e757a8328170fcfb78630c3cb4d896510fb97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (66 corresponding lines): core/translate/insert.rs:1518-1583 | core/translate/insert.rs:3257-3333 \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":"core/translate/insert.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0380a5b29505acdbd33265ea405ef2bc0a361735b6aa37dccaf79241b61944cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): core/storage/btree.rs:2054-2115 | core/storage/btree.rs:2283-2361 \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":"core/storage/btree.rs"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c614b638d6fc8d971c903b9effd5f3bd638b26d5ea31d54cc092c5d44c2290"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (51 corresponding lines): core/index_method/fts/rows.rs:288-338 | core/index_method/fts/rows.rs:390-443 \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":"core/index_method/fts/rows.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5f0f687cef42363e364b7c84cf0602fabd986c539425df7f2a041a72046594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): sql_generation/generation/value/cmp.rs:15-59 | sql_generation/generation/value/cmp.rs:69-121 \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":"sql_generation/generation/value/cmp.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff74e0d5c61548a9155627952b121dce45e694f4d7e550ce73062bca214e7ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (60 corresponding lines): core/storage/shared_wal_coordination.rs:929-993 | core/storage/shared_wal_coordination.rs:1000-1059 \u2014 These two members are one piece of code written twice and then edited apart: 60 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fa6e281c5471526bc25d10e5d9e69d350ccbcbcf1aae85ce80b535801bc7c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 52\u002B corresponding lines): testing/sqltest/src/runner/mod.rs:1024-1084 | testing/sqltest/src/runner/mod.rs:1091-1156 | testing/sqltest/src/runner/mod.rs:1165-1216 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 52 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54db8afee7d933eeb14e5b29816f0264e6585ee604a0caeb543e18aaaf608ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): core/mvcc/database/mod.rs:11219-11303 | core/mvcc/database/mod.rs:11310-11372 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":11219}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f7aeb70034cacebeb03c06901134fd053cbfb7009e3521a7cf6a22a3cd81f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): core/schema.rs:8866-8912 | core/schema.rs:8921-8966 \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":"core/schema.rs"},"region":{"startLine":8866}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcd26142ef6ff45f6641c8422bc024e38ee4ffbad1830cb607da8924b3c8d9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): core/storage/shared_wal_coordination.rs:2456-2504 | core/storage/shared_wal_coordination.rs:2521-2565 \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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":2456}}}],"partialFingerprints":{"codehealthFindingId/v1":"48273700322a8c0c7e0f2b5ed128e41a0d3d1814c0ba07a9b1f8424503630050"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): testing/simulator/model/mod.rs:407-442 | testing/simulator/model/mod.rs:443-476 \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":"testing/simulator/model/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa9798e8e068f9fa018a2f1f584690e90bfa5c5bd539d7716b226fc8de23403d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): cli/read_state_machine.rs:78-118 | testing/sqltest/src/parser/sql_complete.rs:80-120 \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":"cli/read_state_machine.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddde798980f0e5d56c89d0ec1719bffda28d735a28bd96b135ec464c585d584"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): cli/app.rs:1645-1679 | cli/app.rs:1681-1723 \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":"cli/app.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c436cda9a06f4cb259b975aa5aee394b0c7fbb4f2e90d6167c7eca707ce923"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): sync/engine/src/server_proto.rs:355-402 | sync/engine/src/server_proto.rs:478-525 \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":"sync/engine/src/server_proto.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"4191098733ba37823349f72fb9f7077833c602f8381d92eb6eb4acdad6f7da1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): core/translate/compound_select.rs:637-690 | core/translate/compound_select.rs:703-769 \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":"core/translate/compound_select.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f63fe60ff9b07cd4a9b13408dc764d27dea1ff5990d381ee8905da3181660cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): postgres/frontend/classes.rs:1759-1804 | postgres/frontend/roles.rs:328-369 \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":"postgres/frontend/classes.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12bb0085f05ce4036d363eb2d49690c79b4396c51ab122d674e2187697a4a13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): postgres/parser/parser.rs:1538-1597 | postgres/parser/parser.rs:1599-1654 \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":"postgres/parser/parser.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80fe0e0c24ccd621e4a06758392556710d1984bb4f77c3b7ce3d7ebae57d27e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): core/io/win_iocp.rs:757-810 | core/io/win_iocp.rs:812-856 \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":"core/io/win_iocp.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"3353cbb408dd1239ab0907e1d444d294fd11270925fafa27bb81ddae2aa70f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): core/storage/encryption.rs:729-775 | core/storage/encryption.rs:819-889 \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":"core/storage/encryption.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6061965ff9e5b0fe330f566249f18ffd63da904226cfc64a411d810952a5717"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): core/io/io_uring.rs:738-772 | core/io/io_uring.rs:774-811 \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":"core/io/io_uring.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff1db6a692424d1933930dc0a2d114c10c1d1acdf2990e2ac32c9ae1fafd771"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): core/mvcc/persistent_storage/logical_log.rs:1282-1332 | sync/engine/src/database_sync_operations.rs:911-957 \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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"124cae2302e0900e396c9a0674e8cced1b2b54f572970a407ea5bba81c82f6ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/storage/shared_wal_coordination.rs:410-427 | core/storage/shared_wal_coordination.rs:517-531 \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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"652cbd5cc8336f686c624d3002c9ddab7cffaba4f53f67961077b25be5943057"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): core/connection.rs:4231-4267 | core/connection.rs:4309-4343 \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":"core/connection.rs"},"region":{"startLine":4231}}}],"partialFingerprints":{"codehealthFindingId/v1":"52302e5a2b77792c8cb9125f1a138d35600d99fde3fc69503b9403ac3fde64af"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): sync/engine/src/types.rs:344-387 | sync/engine/src/types.rs:389-430 \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":"sync/engine/src/types.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70d65bcec6b9d9ee910aedc587681be1705eb75dd08bfb5f186608294f5ce86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): sync/engine/src/database_sync_lazy_storage.rs:604-638 | sync/engine/src/database_sync_lazy_storage.rs:647-676 \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":"sync/engine/src/database_sync_lazy_storage.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe75cd2c506216f5022305b694b0483e184c3b10783e746ebebc252fd22564b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): core/database.rs:3004-3033 | core/database.rs:3040-3075 \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":"core/database.rs"},"region":{"startLine":3004}}}],"partialFingerprints":{"codehealthFindingId/v1":"df59b0b3b5a38fc4f23f5b2d39ded0966cdf0c4687ad77cf95ce02025d69f9d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): core/percentile.rs:79-106 | core/percentile.rs:141-168 \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":"core/percentile.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a7131b57f4c62a51b2bc15b6d2c0282689a38d127b7959eb74c6b48c1ba63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): core/translate/compound_select.rs:594-624 | core/translate/compound_select.rs:798-827 \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":"core/translate/compound_select.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c01bbea5f17f256703f5ef618b6d07270067e7c263068110349e8fabb22ddc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): core/storage/shared_wal_coordination.rs:1495-1528 | core/storage/shared_wal_coordination.rs:1536-1566 \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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dda12be1599e7adac72f3a382f86479ba46c3bbe8d2a3e6531273aec4e1e97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): sqlite/parser/src/lexer.rs:402-439 | sqlite/parser/src/lexer.rs:441-477 \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":"sqlite/parser/src/lexer.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f792eee7d61e08b2fd1dad6eaa0be8de065015a66cfbffcbbb24e6b2a4c5212"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): core/pragma.rs:341-394 | extensions/completion/src/lib.rs:98-150 \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":"core/pragma.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cea16de4031c2fce90078e66c84d0da28960fdb152d69aded94b9c613703ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): core/ext/mod.rs:158-190 | core/ext/mod.rs:227-258 \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":"core/ext/mod.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc81e594fec73ab854590a7f25d9634d6b8ea87e637d373643401e6e9a80b635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): testing/concurrent-simulator/properties.rs:777-823 | testing/concurrent-simulator/properties.rs:825-879 \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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf88b4443f05d59d3c1655ce07c7bb6d6fb003417fc87e343bbf6e773048c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): core/json/ops.rs:21-43 | core/json/ops.rs:49-71 \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":"core/json/ops.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cd627dcbdf819541c082b7780b30a3a09802f6373d28efd386e2e25f60b198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): core/storage/encryption.rs:778-816 | core/storage/encryption.rs:892-937 \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":"core/storage/encryption.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"3001a4562300dfc21cd1bcbd882ac841995e5bb61a93a0d06b0d0e77d2fd0e47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): core/translate/planner.rs:269-303 | core/translate/planner.rs:395-425 \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":"core/translate/planner.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5881b48ae8faa01a91292d9a4d93693afcc5fa045fb4b8f3e882d6229227defa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): core/storage/shared_wal_coordination.rs:1730-1763 | core/storage/shared_wal_coordination.rs:1857-1890 \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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966119a598029a7a8f3404d586392cb5e5752910f10a3be7bd04ae978ec2f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): core/vdbe/execute.rs:3364-3393 | core/vdbe/execute.rs:3430-3462 \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":"core/vdbe/execute.rs"},"region":{"startLine":3364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20270bb43f0fc57b6da4e40b3361a432258edd7fc709624d7152845888c465e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): core/translate/emitter/mod.rs:2127-2174 | core/translate/index.rs:1363-1407 \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":"core/translate/emitter/mod.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bf2a0f6ded6ce85e2ba6fef486a70e4061a3a5110832aaba8f35e66138786e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): testing/stress-go/main.go:411-438 | testing/stress-go/main.go:540-572 \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":"testing/stress-go/main.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"af63bf8609781bc390dd83b00fb790fe09cda7e0faa0c1cc88faa5827d79b6a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): core/index_method/toy_vector_sparse_ivf.rs:159-191 | core/index_method/toy_vector_sparse_ivf.rs:199-225 \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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"116e80eb0ad4b20a7e5ab3687073795ecdca4079c4a62fb1ea19bcafe3fd1a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): core/translate/select.rs:1553-1576 | core/translate/select.rs:1640-1666 \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":"core/translate/select.rs"},"region":{"startLine":1553}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a5d5bccd4463c5aecdf389cb00008dd825a325c1c06a4b93814bdc3b70b993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): core/functions/printf.rs:679-705 | core/functions/printf.rs:707-729 \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":"core/functions/printf.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"790ec7a2e5960a44497d99acae5a0f215067403e35d67bd1f87e28b7eb35229d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): core/functions/printf.rs:731-768 | core/functions/printf.rs:770-799 \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":"core/functions/printf.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7e16aeedcf5dfdebe801d12e84ee72375f57750d5e52f09e330fc2a2f656e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): core/translate/insert.rs:1468-1506 | core/translate/insert.rs:3672-3721 \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":"core/translate/insert.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e079ae11bef2c19c0f39c30c367d3b44834980a0e6db7de67a57c776fdc3938"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): postgres/frontend/classes.rs:1389-1419 | postgres/frontend/classes.rs:1430-1451 | postgres/frontend/classes.rs:1461-1484 | postgres/frontend/classes.rs:1495-1526 \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":"postgres/frontend/classes.rs"},"region":{"startLine":1389}}}],"partialFingerprints":{"codehealthFindingId/v1":"440ba6ebbbe15f3d38fecc2c7b076a33bbf50720b39d0e90b564da2cb0c26b14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): core/io/windows_lock.rs:238-273 | core/io/windows_lock.rs:380-420 \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":"core/io/windows_lock.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc90844d730045cdeda73656c0cf0fccb0bf916e4ab3feea582492ce26046a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): core/mvcc/database/mod.rs:6294-6333 | core/mvcc/database/mod.rs:6345-6386 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":6294}}}],"partialFingerprints":{"codehealthFindingId/v1":"346e8f84ee2a925031e4f8e1be9f19e2eae1a2e11e99a4518f8c757f3bc0247a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): core/incremental/vdbe_maintenance/binding.rs:74-97 | core/incremental/vdbe_maintenance/plan.rs:588-612 \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":"core/incremental/vdbe_maintenance/binding.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7352f1db12129f70528d55655c322e29cb6c3404f0eaa4247ac832f4d980004"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): testing/concurrent-simulator/lib.rs:1289-1313 | testing/concurrent-simulator/multiprocess.rs:1018-1054 \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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1289}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7515fa887ad23e36e49acecf52c4d2037ba987e9f081929ad6a0108d346f79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): bindings/go/driver_db.go:91-129 | bindings/go/driver_db.go:373-423 \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":"bindings/go/driver_db.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c139a673a5cccc867c4aa96a717d8abce435247f7deaed90b30228ba97f9b614"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): core/storage/shared_wal_coordination.rs:1766-1792 | core/storage/shared_wal_coordination.rs:1893-1922 \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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1766}}}],"partialFingerprints":{"codehealthFindingId/v1":"e354f283e32537f33e05ba2cfec6748c5dc1fece8b9130093f751250e710f618"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): testing/simulator/runner/file.rs:140-159 | testing/simulator/runner/file.rs:166-185 | testing/simulator/runner/file.rs:224-245 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"testing/simulator/runner/file.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b17e9b89b2f375d886dae29d240d9b47afad160f68793324410b82c20f6953"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): postgres/cli/main.rs:257-276 | postgres/cli/main.rs:318-343 \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":"postgres/cli/main.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ed9603cbf19248af5d7f70fcb77912788082c07a824be20d5da3d31ae2b20f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 39\u002B corresponding lines): core/translate/trigger.rs:475-513 | core/translate/trigger_exec.rs:1181-1228 | core/util.rs:2015-2066 \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":"core/translate/trigger.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adf4a7d609c7af61c9e51cfa15d05c6ceff65f54e68f8f58e553815e091c76f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): testing/sqlright/crash_reports/lib/executor.py:23-82 | testing/sqlright/crash_reports/lib/executor.py:85-133 \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":"testing/sqlright/crash_reports/lib/executor.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3361aa9159085eb6f2d56b80ca12f33ca36eee215d4d3a2b88e93bdb387c6572"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): bindings/c/src/lib.rs:2943-2975 | bindings/c/src/lib.rs:2984-3012 \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":"bindings/c/src/lib.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"912dca6a0102fda9edc53d990ef5dbbac5b454b3cc98c364b247ed817116aa09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): core/numeric/mod.rs:119-129 | core/numeric/mod.rs:132-144 | core/numeric/mod.rs:147-160 \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":"core/numeric/mod.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"762febee73581d46316f875df7e9a1837831dbc04d9d047c921196e33e41fc97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): testing/concurrent-simulator/io.rs:375-399 | testing/concurrent-simulator/io.rs:406-442 \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":"testing/concurrent-simulator/io.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdab4b0c3a3967102b1833bf9df7d6287293af874d3ff797d9ad058bf7af4e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:234-262 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:636-661 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7596e5072633609c53b1883f7a24d8a2b6d0aff740650fa2d82d9f979a82fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): core/statement.rs:878-893 | core/statement.rs:909-926 \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":"core/statement.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b395f4d129409949c22f28f90743b0bde6061e37aa1eb0a34eb0048f43c80d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): core/translate/optimizer/multi_index.rs:218-245 | core/translate/optimizer/multi_index.rs:260-288 \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":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be8fd677a4bc384aeab9d5e9b4154dd7235ef25ba7b4e5bd615d9da463b8611"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): bindings/rust/src/lib.rs:461-482 | bindings/rust/src/lib.rs:502-530 \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":"bindings/rust/src/lib.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ffd710ee08085712a195c33c30ed58aacd08c3a61d320c755d688f8235e4e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): core/json/mod.rs:442-462 | core/json/mod.rs:470-498 \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":"core/json/mod.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1861458f0566205af2344a78dfc9f0eebef2e12fac235a1d0d08fa2128a84a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): core/storage/btree.rs:6148-6167 | core/storage/btree.rs:6172-6194 \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":"core/storage/btree.rs"},"region":{"startLine":6148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e448a20f82b14a02602026cd3857483376797b3e34043c346129afa0e047ede2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk-kit/src/capi.rs:940-957 | sdk-kit/src/capi.rs:966-979 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a5f5008d347ed870b6fbe319a3fec7d419fdccd0c9263c90163c67d248149c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): core/storage/wal.rs:5593-5613 | core/storage/wal.rs:5682-5701 \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":"core/storage/wal.rs"},"region":{"startLine":5593}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d08d0ba812e348c5da8349c0a9651b5a74f388fd96de172a6ec363404f9edac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): postgres/parser/lexer.rs:389-418 | postgres/parser/lexer.rs:487-511 \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":"postgres/parser/lexer.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ee7d84e8278189c41034394e3401e14a639c80ffa5615ad880496f90fa0435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:1462-1487 | bindings/dotnet/src/Turso.Data/TursoDataReader.cs:406-428 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e36ea9b02be6a8ce7467fd64c76c22386843421c900e6c5805166f4969aef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): core/connection.rs:1945-1967 | core/connection.rs:1992-2010 \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":"core/connection.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4aa566348b9a2c1a1691c76012666075a5a7f0d699c885e33e3002a177cd81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): core/io/memory.rs:59-83 | core/io/memory_yield.rs:64-89 \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":"core/io/memory.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"061109e25bb4b27e1df89932fc33b4e84c5548c0b7998f23ea6b83987c7c9435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): extensions/regexp/src/lib.rs:61-82 | extensions/regexp/src/lib.rs:85-114 \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":"extensions/regexp/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd5c0b83a8789c756bc50041652b4cb43040e3f1bcae46f7dac5ae1bd6821db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): core/storage/encryption.rs:946-964 | core/storage/encryption.rs:972-989 \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":"core/storage/encryption.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"d929acec94f61a4bb7c6b45a87d39d9b07145df75cc4306effe94f3e05728f60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): core/util.rs:3104-3132 | core/util.rs:3926-3955 \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":"core/util.rs"},"region":{"startLine":3104}}}],"partialFingerprints":{"codehealthFindingId/v1":"392f7ef60367674dbec9fc5163acc19fca005e976e67698b4846bd9f67aa538f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): postgres/regress/describe.rs:657-686 | postgres/regress/describe.rs:688-712 \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":"postgres/regress/describe.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14147f7ae88bd41b606dfbb5b2e6c80f3d546bacd418077af12ff4e30ea2a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 26\u002B corresponding lines): bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:173-198 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:201-226 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:229-256 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:401-426 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"436b6e969807ee75d450bef0b2d009395531a3813e0995d895c84bd92175b52b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): cli/app.rs:1947-1975 | cli/app.rs:1977-2006 \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":"cli/app.rs"},"region":{"startLine":1947}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c59e7c1d23332d18c3a424af0b5ad7fdfa87ad2815187900b91addf50783106"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): postgres/parser/lexer.rs:605-628 | postgres/parser/lexer.rs:630-655 \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":"postgres/parser/lexer.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7277884c42cc037e29bb18605859bf754a75e422a0005241fcb3cb7c03ddf81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): core/translate/values.rs:52-79 | core/translate/values.rs:144-175 \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":"core/translate/values.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6130e3e7e3966fa94fc2828ffca16385deb5c83c44857df9b07dcef8358ffc42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): sqlite/parser/src/lexer.rs:497-520 | sqlite/parser/src/lexer.rs:566-584 \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":"sqlite/parser/src/lexer.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"315a6cfe7b5783aec0bc10e48bb25c0fbf2b92dbb77a8e8e1e371e6865a616ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): testing/differential-oracle/sql_gen_prop/profile.rs:206-241 | testing/differential-oracle/sql_gen_prop/profile.rs:246-272 \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":"testing/differential-oracle/sql_gen_prop/profile.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"208882674fcd40c8f29df48f3e2fd416863432874b5e8a139a711cacc710a4bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): bindings/rust/src/lib.rs:294-330 | bindings/rust/src/sync.rs:318-349 \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":"bindings/rust/src/lib.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ba52f62230ef5f20f1197c9fa25a685203914c08ca626ad143c3f71680b14d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): bindings/javascript/src/browser.rs:177-205 | bindings/javascript/src/browser.rs:212-241 \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":"bindings/javascript/src/browser.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0881532665d1967c49f37e0a23cc316d7a7d9251e7baaac90cf28e63271f64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): core/percentile.rs:56-77 | core/percentile.rs:118-139 \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":"core/percentile.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d68e0cceaa7cb4d204eba04f95aeaf814b37e92c7d70a8ff076c84a317f088"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): postgres/parser/lexer.rs:354-376 | postgres/parser/lexer.rs:448-466 \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":"postgres/parser/lexer.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"202590ecd20b03248039aed2143af64c9e6c9e7dd27afc152187985c710b63cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): testing/differential-oracle/sql_gen_prop/expression.rs:1396-1419 | testing/differential-oracle/sql_gen_prop/expression.rs:1445-1477 \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":"testing/differential-oracle/sql_gen_prop/expression.rs"},"region":{"startLine":1396}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e77b675c39a1f5da0a354785fc462df234159603de91e2da6324d6f4406747"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): cli/app.rs:1571-1602 | cli/app.rs:1743-1766 \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":"cli/app.rs"},"region":{"startLine":1571}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8d0a2b5728af8f69ad1267d896647c3373c7fe8587ee102719df02fec49594"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): core/function.rs:752-768 | core/function.rs:849-866 \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":"core/function.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e236fb64980b954c230c6398e9d719bdfc243eba030ddf4af07bd1fe1afd908"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): core/translate/emitter/mod.rs:470-488 | core/translate/emitter/mod.rs:490-508 \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":"core/translate/emitter/mod.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca7be66e702cbdce645276d54efd442ebfa75af5e681418122782c287c4f9cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs:548-599 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs:610-649 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"af31a783777f967ee56b0cb5ede10876ccc57320f67f94cd9b1efe196d4d9abf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): core/translate/expr/arrays.rs:352-386 | core/translate/expr/arrays.rs:400-424 \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":"core/translate/expr/arrays.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc23933ddc965621b9189f8e92927dd09ede324612b1c48f899940cdb45a84d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): core/vector/operations/text.rs:104-124 | core/vector/operations/text.rs:126-146 \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":"core/vector/operations/text.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"55222b0edd423240dfb7bf0dadb652f26d49e6b20dff4433a8fa0ae50a1f9568"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): core/storage/subjournal.rs:64-92 | core/storage/subjournal.rs:100-125 \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":"core/storage/subjournal.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"16224a576a5c5ab33d2ee83337f55535347bcf6290e326a87aacab432d9e3a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): core/functions/printf.rs:1116-1136 | core/functions/printf.rs:1181-1197 \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":"core/functions/printf.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a952cda8448946ab6dd87c0795c8914c7ac6c3b95daa7c811636947aa66123b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): core/mvcc/database/mod.rs:8453-8483 | core/mvcc/database/mod.rs:8493-8529 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":8453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fde8615a33cab7e3ea800c9524317287c8052561c1e89ed443bfc4e6dcfd551"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): extensions/regexp/src/lib.rs:13-30 | extensions/regexp/src/lib.rs:38-58 \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":"extensions/regexp/src/lib.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c663d55d13a5cc6239c826d58c814c33f2ee7fef7d6df7444d57efe3e94772"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): testing/differential-oracle/sql_gen/src/ast.rs:758-779 | testing/differential-oracle/sql_gen/src/ast.rs:2042-2067 \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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f37a7a76aab8b633dd0bfda341cfe38adde38ee024a06f36045d4c89d8b851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): core/translate/plan.rs:3308-3338 | core/translate/plan.rs:3355-3392 | core/translate/plan.rs:3400-3431 \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":"core/translate/plan.rs"},"region":{"startLine":3308}}}],"partialFingerprints":{"codehealthFindingId/v1":"7569598c31e05ca12866951ab3ac7ae217e415e08b5f8d0c81abcd539f15d1b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs:102-132 | bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs:201-228 \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":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c39ab964e23ca6b98474fe99aa62062196f6779e1dc4a9fe9f8e77bec662f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): core/io/vfs.rs:122-144 | core/io/vfs.rs:146-169 \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":"core/io/vfs.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eae91d6f59a93bd9a5782fb660eb6fbb2b950ff936797aa435d45aeae2cf21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): postgres/parser/lexer.rs:468-485 | postgres/parser/lexer.rs:524-538 \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":"postgres/parser/lexer.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f47dfc8bd9452b9a11e18b9eeaa5b8be23d86af1fbc10b1f0afdaf5305999b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): testing/differential-oracle/sql_gen/src/ast.rs:1237-1267 | testing/differential-oracle/sql_gen_prop/schema.rs:89-113 \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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ae0adec573558bed0911205de648acabedbc86636a2a64a1fbb06ad7226aad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): sdk-kit/src/rsapi.rs:1343-1362 | sdk-kit/src/rsapi.rs:1427-1454 \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":"sdk-kit/src/rsapi.rs"},"region":{"startLine":1343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e616878cb9048e11b76793c2bc1db92b8f4565923b240c97e43b9f701d957a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): core/translate/expr/translator.rs:3144-3165 | core/translate/expr/translator.rs:3200-3221 \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":"core/translate/expr/translator.rs"},"region":{"startLine":3144}}}],"partialFingerprints":{"codehealthFindingId/v1":"25847419faad8adece87a81587627da1bad5e2917420c23e3783be74f1eb753a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): core/incremental_blob.rs:96-117 | core/incremental_blob.rs:121-142 \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":"core/incremental_blob.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6328ebf91397f331482007d10a4f8ade5e6c410f04cd59e35febd930530784de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/vdbe/array.rs:581-595 | core/vdbe/array.rs:600-614 \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":"core/vdbe/array.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"713a8949965b5ef723465335b37acaa37ebffeeb6fe7cb792f825ee23d48cd0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): testing/simulator/model/mod.rs:54-80 | testing/simulator/model/mod.rs:87-112 \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":"testing/simulator/model/mod.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f527e2bf75db97e480217f8aa711bbac879b05f91cf102b4400608820c420532"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): testing/differential-oracle/sql_gen_prop/expression.rs:1306-1325 | testing/differential-oracle/sql_gen_prop/expression.rs:1328-1343 \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":"testing/differential-oracle/sql_gen_prop/expression.rs"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9b059d360f0dce032568be7139a2b58d2ae8cbe6942fbd49a6a60176767559"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): testing/simulator/profiles/mod.rs:55-90 | testing/simulator/profiles/mod.rs:101-130 \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":"testing/simulator/profiles/mod.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e6fc5440b1578215674f7b95f10bb49315274c960bc91523c5d5aaccbec141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): core/incremental/vdbe_maintenance/stream.rs:359-374 | core/incremental/vdbe_maintenance/stream.rs:382-402 \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":"core/incremental/vdbe_maintenance/stream.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7afc8cce0820b5fa537d2bb8332d56dce410d121e84e5f78602bfff59832dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): testing/differential-oracle/sql_gen/src/ast.rs:1178-1203 | testing/differential-oracle/sql_gen_prop/create_table.rs:397-418 \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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90d97a8d94314b8714ec22856afc53d4a84f5f0d064b874a4d7e48fe7786702"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): testing/simulator/model/interactions.rs:653-673 | testing/simulator/model/interactions.rs:679-699 \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":"testing/simulator/model/interactions.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57a26fac318220a659c8af93ae7c4517ddf0853518e5297e502ae596398ccf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): bindings/javascript/sync/src/js_protocol_io.rs:256-273 | sync/sdk-kit/src/sync_engine_io.rs:328-345 \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":"bindings/javascript/sync/src/js_protocol_io.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a19eaaaf77bcfb98e9489ab925ebe17404e8e8c21ff7f76f39f8c45b80c22c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): core/functions/printf.rs:362-374 | core/numeric/mod.rs:497-519 \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":"core/functions/printf.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"250773fbe06ecf2afe694292295f4e375fc92cf43f7cc51dc9d85fe74f1cbdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/vdbe/value.rs:348-364 | core/vdbe/value.rs:958-972 \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":"core/vdbe/value.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b5ef0da0c93c50a30ab2a638b13799fa6aed4ab6e2ed4bee602d6b2c327857"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): core/vector/vector_types.rs:440-461 | core/vector/vector_types.rs:469-490 \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":"core/vector/vector_types.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a187c61e1942998fdbcb44c2b1f0571bdf2ec2cf890146c9f4e79b3d5fa2dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): postgres/client/lib.rs:220-236 | postgres/regress/main.rs:1609-1623 \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":"postgres/client/lib.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"092564b99656a647bdb30ff2d0081fe90aea14fa997900f7f6025e736fe91851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sync/sdk-kit/src/capi.rs:389-400 | sync/sdk-kit/src/capi.rs:421-432 \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":"sync/sdk-kit/src/capi.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e7850a4e6840e76ad4b7ba27a9cada709e91cd860ddce547c686914d5d6dec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): core/time/mod.rs:710-732 | core/time/mod.rs:879-898 \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":"core/time/mod.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc425d5e7d5689379cba6c5037ec9155c351de86268dd732ededda8f12e559b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): core/translate/plan.rs:3808-3824 | core/translate/plan.rs:3830-3845 \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":"core/translate/plan.rs"},"region":{"startLine":3808}}}],"partialFingerprints":{"codehealthFindingId/v1":"6486f34c6c0eb6418879d53aa6c3fecf677bb979f225c2536a3059212eee8580"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): testing/simulator/runner/env.rs:666-683 | testing/simulator/runner/env.rs:685-701 \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":"testing/simulator/runner/env.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0842504860eed57f58d8726db2f2bd23cd728112855eeddeab9bb721cbf614c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): core/types.rs:1584-1600 | core/types.rs:1658-1674 \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":"core/types.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"311b40ac740f14f9da70e5a12779e8f56dfed1ed07b6208a5807d90cb8b96541"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): macros/src/lib.rs:1103-1132 | macros/src/lib.rs:1244-1266 | macros/src/lib.rs:1366-1388 \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":"macros/src/lib.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea50c9ec33d10864d9d7b1a62dd712f5bdaf865333cb401fbfcb6a553bfb9d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): postgres/parser/parser.rs:790-809 | postgres/parser/parser.rs:811-830 \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":"postgres/parser/parser.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e17ac34dae078f1f0b5b9dbca9381a3798b244291ad36fe8b250709c6c43373"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/types.rs:1621-1630 | core/types.rs:1638-1648 \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":"core/types.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"04be99378395386ec546c0327db8f523c33dda5b50230bc45aa04b82db96f40b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bindings/c/src/lib.rs:2774-2795 | bindings/c/src/lib.rs:2803-2819 \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":"bindings/c/src/lib.rs"},"region":{"startLine":2774}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd07758e3f361ce6950ea2afebbfe53664eb76553b12e862039f14bed0177e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): core/translate/trigger_exec.rs:682-702 | core/translate/trigger_exec.rs:713-743 \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":"core/translate/trigger_exec.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58fb45a3f41c129603e030986c15a5b80f3dac1362c951ede94cc519d1b1c18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): core/vdbe/execute.rs:1849-1876 | core/vdbe/execute.rs:1887-1915 \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":"core/vdbe/execute.rs"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4b2f690859b37cb06696503c59815ee6e6aec5bff334b31f06707235f312f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sql_generation/model/query/predicate.rs:36-49 | sql_generation/model/query/predicate.rs:51-64 \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":"sql_generation/model/query/predicate.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4e11939152134bbcafc21ca3163ceca1a79c40482b1db6a6bc986db3c1315a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:303-328 | bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:332-360 \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":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fc443a521958d316fd5e6bb92b98b8c63b81e0928d22358921fe34535760f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 20\u002B corresponding lines): bindings/java/rs_src/turso_statement.rs:163-182 | bindings/java/rs_src/turso_statement.rs:191-210 | bindings/java/rs_src/turso_statement.rs:219-238 | bindings/java/rs_src/turso_statement.rs:247-271 | bindings/java/rs_src/turso_statement.rs:280-304 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/rs_src/turso_statement.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fbe2983d568534187b09f59090180315a09639b0cfbde7fa750ab1d7146d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): postgres/frontend/options.rs:48-66 | postgres/frontend/unnest.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":"postgres/frontend/options.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a309ed68cdcc0d91ec27129c37ac31cc7a9e849510011e28a5c07c8c91c507bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): testing/concurrent-simulator/lib.rs:1318-1339 | testing/concurrent-simulator/multiprocess.rs:1056-1073 \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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e08d77b88fd4f7de118c22d5caaacda69243b885bf7cb76139319f8850f7aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): testing/differential-oracle/sql_gen_prop/value.rs:85-96 | testing/query-result-oracle/lib.rs:48-59 \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":"testing/differential-oracle/sql_gen_prop/value.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b84589f842a9fc35371ce011d0b4659af97d39f3faeb64e4b816b1a351cb5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): bindings/go/driver_db.go:147-171 | bindings/go/driver_db.go:280-304 \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":"bindings/go/driver_db.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c536f7a48ee058cffa2883e1ad0b3973999c030fd3b84e674aa044e5f73878a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): core/database.rs:1313-1333 | core/database.rs:1471-1487 \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":"core/database.rs"},"region":{"startLine":1313}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a66ebd2983d9ec5330e1f2631005bfa6782044af740ab61c4b0b42ef28c8108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): core/statement.rs:852-867 | core/statement.rs:934-949 \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":"core/statement.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f3a0e17bb9f020374ec528bfaaf103584e027576bfc4f6847b619571ed889f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bindings/javascript/sync/src/lib.rs:548-564 | sync/sdk-kit/src/turso_async_operation.rs:55-72 \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":"bindings/javascript/sync/src/lib.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5ee2103ca30669f920896e7edab01a92c421f5f1f34c88330c7586d36dfc3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): sqlite/parser/src/parser.rs:952-973 | sqlite/parser/src/parser.rs:3767-3788 \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":"sqlite/parser/src/parser.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b5fa2d27a18e0746fdf4a4964a6fb438dccc929f86b362e6f40a17df03f6cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): bindings/dotnet/src/Turso.Data/TursoConnection.cs:520-547 | bindings/dotnet/src/Turso.Data/TursoConnection.cs:550-581 \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":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"a783bd46b1f5d043fa033a40583e7d418e050dcb0f16d1a36a20d60bea816b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs:406-453 | bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs:456-491 \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":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3871a89090f933a07152975b6a53efb18fee7497fc9bf22e5b020ead8768313"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): core/translate/eqp.rs:615-631 | postgres/frontend/functions.rs:1005-1021 \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":"core/translate/eqp.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"13697e7159f059acb840ac6dcf5c5389fa38fe6b20b8431ebda817ff886ceaf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/vtab.rs:88-113 | core/vtab.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":"core/vtab.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed91550691c84f81aea6d28fd9c99ae930453b67316504ea335dd7158c6c710"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): postgres/client/lib.rs:286-298 | postgres/regress/main.rs:1248-1263 \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":"postgres/client/lib.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a94925a1b5735d6c4e520508ed462c8e252b0e2b6c0fa61a624dc874fbe7fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): sync/engine/src/database_tape.rs:76-96 | sync/engine/src/database_tape.rs:123-143 \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":"sync/engine/src/database_tape.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d9be929caf6e7330ccedce0c9f27616cf4ef954aaa325f1abd6653e261a558"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): testing/differential-oracle/sql_gen_prop/drop_trigger.rs:42-60 | testing/differential-oracle/sql_gen_prop/view.rs: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":"testing/differential-oracle/sql_gen_prop/drop_trigger.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1a8811fdbab39a90e5b07ececc763b6f97f94a70c04b0fc3f0fd3a51189b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): bindings/c/src/lib.rs:882-906 | bindings/c/src/lib.rs:934-966 \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":"bindings/c/src/lib.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09d1c43b4474c2d1a779180b743394f85233899d958f8740604a438071d3858"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): core/io/vfs.rs:22-33 | core/io/vfs.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":"core/io/vfs.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d635bb6634b1aafd6d399b3a10e12dd1cb6c5a803988c7652d7bc51be53c805d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): core/translate/select.rs:1473-1492 | core/translate/select.rs:1531-1551 | core/translate/select.rs:1618-1638 \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":"core/translate/select.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cc2042f202abbb9b5a50657495bdb7b884a947ece8cc9672fae3e8e59265bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/types.rs:948-956 | core/types.rs:2446-2454 \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":"core/types.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"792d898faa69a59d045dded20fdae7b409224ec90a89e3d1757214401a268aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs:57-92 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs:95-129 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"544f021640bae70033fefb8d4a31f9c592ec9f29961bd995e2d318789f6fadea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): core/numeric/mod.rs:387-398 | core/numeric/mod.rs:404-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":"core/numeric/mod.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e744e0d73fbb1a537fe87d7a1a2485d917c8ed8654c3bc5addd051862782ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): core/translate/select.rs:1151-1176 | core/translate/subquery.rs:1408-1428 \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":"core/translate/select.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b36f105d3c4a57f69772195be9237dc9e1cbb43e13798db3ec7794616e0d42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/types.rs:936-944 | core/types.rs:2524-2535 \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":"core/types.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c68a7e72500fda9b9cdb1e652547d461135882b4316cc4e6be88effbe4903ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/vdbe/array.rs:356-370 | core/vdbe/array.rs:372-390 \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":"core/vdbe/array.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4caf137147a65b58f5eb4b3a5fa1d35c1f8e37c27b0b5de69969a0ced7b1171"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:71-95 | bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:98-126 \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":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"44905bdb18e816a3c28fc8a714fe5f2daa8ae2cb0f0d0ab6085c212089f341c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bindings/rust/src/connection.rs:101-121 | bindings/rust/src/connection.rs:411-427 \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":"bindings/rust/src/connection.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cd1ebd044d367fc674621d9e01da4d836109cf22303f911f91047883cf4442"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): core/json/mod.rs:512-529 | core/json/mod.rs:540-560 \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":"core/json/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd29759dcf2f40d005ec14dc2167632ea808dbc4e98bb779a9543daf7477b425"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): postgres/frontend/statement.rs:502-514 | postgres/frontend/statement.rs:523-538 | postgres/frontend/statement.rs:544-558 \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":"postgres/frontend/statement.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd160c85cb5fa04e364675342fa3ecfd28d52a39a4e8d1f04791d24c380dc4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs:15-36 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Functions.cs:16-37 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0741a35b758fcb2da76aaca8dfbfe894c918fc4fa66a44eaffd99ea0d0c706"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/vdbe/execute.rs:3916-3930 | core/vdbe/execute.rs:4149-4163 \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":"core/vdbe/execute.rs"},"region":{"startLine":3916}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c6afde6cb6828fdc73563614719f1a06c36b787954f42d371b3f2b9d256c12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): core/vector/operations/distance_cos.rs:97-114 | core/vector/operations/distance_cos.rs:142-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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d6168fb9ba3b99a358a848da79d458ec1540cad4be0f1cba9a5de884994b42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): postgres/parser/parser.rs:2647-2668 | postgres/parser/parser.rs:2715-2735 \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":"postgres/parser/parser.rs"},"region":{"startLine":2647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ec71735914db6632223e40df1ea5fbc1d2076718970fa58a163c4f5268e5ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): sync/engine/src/database_tape.rs:906-917 | sync/engine/src/database_tape.rs:923-938 | sync/engine/src/database_tape.rs:944-955 \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":"sync/engine/src/database_tape.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a8a7cb8d2e15251d3a56ed6596e9ac1c7590618215fc3195dd29b5497e481f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): testing/simulator/generation/property.rs:2195-2216 | testing/simulator/generation/property.rs:2223-2243 \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":"testing/simulator/generation/property.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8c6f5a869dfe6fcbf892d30758429dabc106cb07f103c53dc296b94accd069"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): core/mvcc/persistent_storage/logical_log.rs:1177-1193 | sync/engine/src/database_sync_operations.rs:1024-1044 \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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe09fc524acfcdf9bf492226cc4b515a50252e88e9888ba2dc61c2f2987ec28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 12\u002B corresponding lines): sync/sdk-kit/src/capi.rs:213-224 | sync/sdk-kit/src/capi.rs:231-242 | sync/sdk-kit/src/capi.rs:249-260 | sync/sdk-kit/src/capi.rs:316-327 | sync/sdk-kit/src/capi.rs:335-346 | sync/sdk-kit/src/capi.rs:353-364 | sync/sdk-kit/src/capi.rs:371-382 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/sdk-kit/src/capi.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"5022752a9b8b4cd46629dbabf51e52b07664580b15cf43c1a48f51e408f1ef50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): testing/differential-oracle/sql_gen/src/policy.rs:727-759 | testing/differential-oracle/sql_gen/src/policy.rs:764-790 \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":"testing/differential-oracle/sql_gen/src/policy.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e674937c81b28245bee09296c7fdc5e7ec931df6bf4cb73c77d2b4e07d15b2d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): testing/differential-oracle/sql_gen_prop/create_trigger.rs:434-450 | testing/differential-oracle/sql_gen_prop/statement.rs:423-436 \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":"testing/differential-oracle/sql_gen_prop/create_trigger.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eb8dda694138e064e79733a722456544975e48c789dabadca2c02b57377dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): bindings/c/src/lib.rs:2217-2232 | bindings/c/src/lib.rs:2238-2257 \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":"bindings/c/src/lib.rs"},"region":{"startLine":2217}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b63990a53e6ee0580f24605e6e90d7e498c9e27d5c9c6ccb8dd4f7e03e6cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bindings/rust/src/transaction.rs:200-216 | serverless/rust/transaction.rs:190-210 \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":"bindings/rust/src/transaction.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96fcbfc99b6bc52797f5f28291922d837e8ab3c74c79aabd86a8825293a7450"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): scripts/corruption-debug-tools/lib/record.py:187-222 | scripts/corruption-debug-tools/lib/record.py:226-261 \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":"scripts/corruption-debug-tools/lib/record.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"670c6a1e81fae412dddb5b016eb49ccf905fa401c02ae478395f7288c595b311"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): core/io/io_uring.rs:701-725 | core/io/unix.rs:278-303 \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":"core/io/io_uring.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0e1a7e6b301fe0b349e34f3f49cd2350b106977dac37d297df4ccb666b37f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): core/mvcc/database/mod.rs:6104-6120 | core/mvcc/database/mod.rs:6166-6182 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":6104}}}],"partialFingerprints":{"codehealthFindingId/v1":"37debb8b8a4e89147c542174205d462189e8bbfc937e5844ded40fa0291c4102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): core/vector/operations/distance_l2.rs:45-56 | core/vector/operations/jaccard.rs:51-65 \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":"core/vector/operations/distance_l2.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f54c5eb1576512f893f06572e8df8c1aba77300a716428f86b99205307667c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): sdk-kit/src/capi.rs:888-897 | sdk-kit/src/capi.rs:905-914 | sdk-kit/src/capi.rs:922-931 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"d145504e8869c50d4ae87de5c51c97b7c36e9d572858ba596c8a077a5d6329f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): sync/engine/src/sparse_io.rs:120-146 | sync/engine/src/sparse_io.rs:148-169 \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":"sync/engine/src/sparse_io.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d1ca1c52456015a7182339bc24775fa54d188307424012f639ad7f4c668d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): core/json/mod.rs:287-300 | core/json/mod.rs:307-320 \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":"core/json/mod.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ac5d17d5e458f9787838555e9a3df839394dd48658d0e47614a93e4dca0eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): core/mvcc/database/mod.rs:1072-1083 | core/mvcc/database/mod.rs:1093-1112 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9fc9df5a3b5c0f0208295fb00032a8936ba90d595279280cfeadf3d196d25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/vdbe/value.rs:1336-1345 | core/vdbe/value.rs:1347-1356 \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":"core/vdbe/value.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"5506a8dc29594f50f20945dc52caa631fb3574c41d7846ed5b201bf9413c66d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): testing/differential-oracle/sql_gen/src/policy.rs:399-428 | testing/differential-oracle/sql_gen/src/policy.rs:452-477 \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":"testing/differential-oracle/sql_gen/src/policy.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f20635e25b7c51fcd55010efd8e190c1172545784c7f12f96a0384f35de820"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:147-162 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:183-199 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe70071cfc5e1775bd8c6d949e0a8221d6eec44cfe41cc49c19a0b718237787e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): core/vdbe/execute.rs:305-313 | core/vdbe/execute.rs:320-328 | core/vdbe/execute.rs:335-343 | core/vdbe/execute.rs:391-402 | core/vdbe/execute.rs:438-449 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a1bad6f91c7cb88c77b58a238473403a68f8bcf2119aab7cd69bb5e4763fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): testing/differential-oracle/sql_gen_prop/expression.rs:563-592 | testing/differential-oracle/sql_gen_prop/expression.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":"testing/differential-oracle/sql_gen_prop/expression.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"10991c387f7b2945498136dd35e39af5063bee8fe1a7d09fc66199b69a2217e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): core/dialect/engine.rs:147-170 | postgres/frontend/catalog.rs:136-168 \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":"core/dialect/engine.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"81db6b386ca0ed9e7639525751f33de16dfb529d7f9ad42663e6a915a6ce4954"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): core/json/jsonb.rs:2383-2398 | core/json/jsonb.rs:2400-2415 \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":"core/json/jsonb.rs"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"1012a31a93f9c7a761a7f200844601efb08b57d1e83912180fc77f381e5edca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): core/storage/pager.rs:6077-6097 | core/storage/pager.rs:6099-6118 \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":"core/storage/pager.rs"},"region":{"startLine":6077}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8035ad261b15f4f42e7f628ed3dd372e7294dca2cee52ee4c6072d85a4b80b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): postgres/parser/lib.rs:264-276 | postgres/parser/lib.rs:308-323 \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":"postgres/parser/lib.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9faa2e3f8fefe8aa663f5d055ce4e64d36bc689dbf2d4f48aecd1a38bf29052c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/translate/planner.rs:323-341 | core/translate/planner.rs:507-521 \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":"core/translate/planner.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7248de511b559785b87547250ffb3a059328405758ebcb07dca2b5e0e09a106"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): core/io/win_iocp.rs:923-947 | core/io/win_iocp.rs:955-982 \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":"core/io/win_iocp.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"b596e435d6b8514e861f967cb1e4beb315b5124177f18b578c6f1ea6deb132ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): core/translate/fkeys.rs:2179-2199 | core/translate/fkeys.rs:2210-2230 | core/translate/fkeys.rs:2241-2261 | core/translate/fkeys.rs:2272-2293 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b050d8679970ca6021e0e6c4308314f7e47d52635e5751070b942bcf4730a3bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): sqlite/parser/src/parser.rs:2852-2869 | sqlite/parser/src/parser.rs:2900-2919 \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":"sqlite/parser/src/parser.rs"},"region":{"startLine":2852}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef17baf8a0c7795b25ab900bc5e48f3002b48ab8188483f8505741d1b57e8bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): core/mvcc/persistent_storage/logical_log.rs:3478-3489 | core/mvcc/persistent_storage/logical_log.rs:3491-3503 \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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3478}}}],"partialFingerprints":{"codehealthFindingId/v1":"d39f44576c8b88bf1e200787a930e11b85b6ceb868e6ec7e0a9792a476f8639b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): testing/concurrent-simulator/workloads.rs:563-578 | testing/concurrent-simulator/workloads.rs:616-631 \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":"testing/concurrent-simulator/workloads.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d6abf1da05fdeb48b12c2b3c3b506ed5ae4b60096fa7a8988e3a0ddf7e0c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): testing/differential-oracle/sql_gen/src/generate/stmt.rs:1106-1121 | testing/differential-oracle/sql_gen/src/generate/stmt.rs:1346-1366 \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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46af5d5f2bfc9d564ac8fd1cd3d14c4e2f516b2455977ea567b8e1e79992cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): testing/differential-oracle/sql_gen_prop/statement.rs:374-383 | testing/differential-oracle/sql_gen_prop/statement.rs:386-397 \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":"testing/differential-oracle/sql_gen_prop/statement.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cf7c9ee501b007ede4ce38a6723318cb5fe594330699cf98c9b7fdff06473b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:76-100 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:103-130 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe87b84f974ecbe1780d3b8471682025970cf75e80a450c58e25f95c9c393e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): core/translate/fkeys.rs:331-348 | core/translate/fkeys.rs:359-376 \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":"core/translate/fkeys.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6fed6649cea5169c9bc6eb57ee6ad1745ef3137bcaedaee11495f07f729e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): core/vdbe/execute.rs:1632-1653 | core/vdbe/execute.rs:9769-9791 \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":"core/vdbe/execute.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ce420edcc7b4bb749d6a1f1d6080fd42d5b355454db135ca100c73b9ab6e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): core/translate/plan.rs:632-648 | core/translate/plan.rs:4589-4601 | core/translate/plan.rs:4658-4687 \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":"core/translate/plan.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a87f1d5479354ccaf025d4a51ee617238fed1aebf2d198334dd73e7711e4269"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): core/vdbe/execute.rs:18017-18046 | core/vdbe/execute.rs:18053-18080 \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":"core/vdbe/execute.rs"},"region":{"startLine":18017}}}],"partialFingerprints":{"codehealthFindingId/v1":"51070e5251989a1c475fb073b6d15115783f607c4498cb548342498321bdd193"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): testing/simulator/generation/property.rs:2420-2435 | testing/simulator/generation/property.rs:2442-2463 \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":"testing/simulator/generation/property.rs"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f2d1437a11a46e18df35c0094ba8c9b251b4b300959ea07f7d7e169c44bdc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): bindings/javascript/src/browser.rs:247-259 | bindings/javascript/src/browser.rs:265-282 \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":"bindings/javascript/src/browser.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12b92a69a9e02920a17b7a8df453883c2eb1eede3527614f156917da1bb4124"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/translate/optimizer/mod.rs:3730-3746 | core/translate/optimizer/multi_index.rs:324-338 \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":"core/translate/optimizer/mod.rs"},"region":{"startLine":3730}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c368d72f5fff95b008b1f7de3db69f374d1504c442827b92d73c8f729541ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): core/vdbe/affinity.rs:186-211 | testing/stress/main.rs:459-473 \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":"core/vdbe/affinity.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfec42dce56478eeee7582dc8f1b17511e97757b9516da969124e5bbcd7098e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): sdk-kit/src/rsapi.rs:1244-1265 | sdk-kit/src/rsapi.rs:1279-1302 | sdk-kit/src/rsapi.rs:1304-1314 \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":"sdk-kit/src/rsapi.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6008174a518f91ea1a92a7efd0d5424be6d9705fb2cf920aca219de1a12544b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): sqlite/parser/src/parser.rs:5536-5547 | sqlite/parser/src/parser.rs:5550-5562 \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":"sqlite/parser/src/parser.rs"},"region":{"startLine":5536}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba0803766956e60a6afa9dc0c13b4a194b12b5533fd311afebc593ce7693f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): bindings/javascript/sync/src/js_protocol_io.rs:198-209 | sync/sdk-kit/src/sync_engine_io.rs:285-296 \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":"bindings/javascript/sync/src/js_protocol_io.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b630cfe2fd838f41534a09e8ccb7d50c25d1a6d7c93b1be016d1ef69bf37f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bindings/rust/src/value.rs:346-354 | serverless/rust/value.rs:310-318 \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":"bindings/rust/src/value.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e178eb940d8d22f38ed1faeb13d4b87022087ee8779767a74b25ce7c0ac8b794"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): cli/config/palette.rs:174-193 | sqlite/parser/src/ast.rs:1305-1322 \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":"cli/config/palette.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dc6b42c87626a0dbdf642d07c93039435f3b47a51a298e4329efbc70355ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/vdbe/execute.rs:481-489 | core/vdbe/execute.rs:496-504 \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":"core/vdbe/execute.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"595e65b2acec032d79bef1e1f3d2267f7eb2b9c147435917c0a0bb01c42b8cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): sync/sdk-kit/src/rsapi.rs:441-451 | sync/sdk-kit/src/rsapi.rs:453-465 | sync/sdk-kit/src/rsapi.rs:467-477 | sync/sdk-kit/src/rsapi.rs:479-491 | sync/sdk-kit/src/rsapi.rs:496-511 \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":"sync/sdk-kit/src/rsapi.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff05b6fc92baa639cf9dd3b8f9624d0531f19b7ec722f08f837bcf8b59d6108"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/functions/datetime.rs:1034-1045 | core/functions/datetime.rs:1048-1058 \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":"core/functions/datetime.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2372ba37795d98bed5fd31fef057419bba40030b7325907afa26a6dfcf84c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): core/time/mod.rs:454-472 | core/time/mod.rs:475-493 | core/time/mod.rs:496-514 \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":"core/time/mod.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3075b242b2fdd269fb628ded4ed337f9ffd14aa6744663b4855020428913ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): core/vdbe/execute.rs:1121-1142 | core/vdbe/execute.rs:1150-1171 \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":"core/vdbe/execute.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aca319a8407f83e8d134dee7d1cb3b90bec85095cc4c7652eb2a36c57d755cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): core/vector/mod.rs:37-47 | core/vector/mod.rs:49-59 | core/vector/mod.rs:61-71 | core/vector/mod.rs:73-83 | core/vector/mod.rs:85-95 \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":"core/vector/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"671e3ccf06a31b687ec2fe70f4023c66808942018dd86290ca078e1a992264ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): testing/differential-oracle/sql_gen/src/generate/expr.rs:36-59 | testing/differential-oracle/sql_gen/src/generate/stmt.rs:39-62 \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":"testing/differential-oracle/sql_gen/src/generate/expr.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"78feef5f8648a2f22407c024649af0cba52b27dc0fc2c324e663c6fb06481704"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): core/io/generic.rs:74-85 | core/io/generic.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":"core/io/generic.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e186460d79afeca06716cc0c043d21eafd4a2e9a12ec8d284efaaa91005d1ed2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): core/json/path.rs:187-202 | core/json/path.rs:403-418 \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":"core/json/path.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d39f33f5515867cd6ef0df57132c8c5bcf40588c681104e59d412e7599f26f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): postgres/parser/parser.rs:2681-2696 | postgres/parser/parser.rs:2698-2713 \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":"postgres/parser/parser.rs"},"region":{"startLine":2681}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc29d763fb7d849a890ad3e34064e8b58a76fb402a408d79ed5a6dbaad24308b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): testing/sqltest/src/generator/mod.rs:259-272 | testing/sqltest/src/generator/mod.rs:274-288 | testing/sqltest/src/generator/mod.rs:290-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 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":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17d440238a4a976beab820c8045c3d361812e69b17221fdb920d512f36074a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): bindings/c/src/lib.rs:3532-3543 | bindings/c/src/lib.rs:3569-3586 \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":"bindings/c/src/lib.rs"},"region":{"startLine":3532}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6a540224ecc9aac9daf5dac55f283efd3ba30173e9f868145209ca72f1bc71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): testing/differential-oracle/sql_gen/src/generate/literal.rs:18-34 | testing/differential-oracle/sql_gen/src/generate/literal.rs:150-161 \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":"testing/differential-oracle/sql_gen/src/generate/literal.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd84abdbe329f912d9a80c082abfa72a8bfd1f0fb09c038d2992d0118064e3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): testing/sqltest/src/snapshot/mod.rs:337-350 | testing/sqltest/src/snapshot/mod.rs:359-372 \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":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44e9110396293fbeb82fa144c3aee9351983cd555a17a2fdd93c3b9b14eccbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): bindings/dotnet/src/Turso.Data/TursoConnection.cs:375-409 | bindings/dotnet/src/Turso.Data/TursoConnection.cs:412-438 \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":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"33add0af4f013d1ac583d3bbb4389d1ab2c30dfe419b0f1834e5498b5e19ce5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): core/io/vfs.rs:110-120 | core/io/vfs.rs:171-183 | core/io/vfs.rs:195-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":"core/io/vfs.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"5870a0797a95e76eb5e6a80c377dca3b4845ef544bbed369c2aa4e8a9971e0c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/storage/shared_wal_coordination.rs:2629-2639 | core/storage/shared_wal_coordination.rs:2641-2652 \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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":2629}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe56f5e1c43396b1ad1cb7df34c4ea680ef736c4a1f6e840bab583fbbe92c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): core/translate/subquery.rs:476-494 | core/translate/subquery.rs:507-525 | core/translate/subquery.rs:537-555 \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":"core/translate/subquery.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"234dc4c7f0f68825f9c1e18551a5ba6ad144eee1dc102490c63aa3914939dea9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): postgres/client/lib.rs:370-379 | postgres/regress/main.rs:1665-1674 \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":"postgres/client/lib.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d9c06350e0ef253dabfd559e92e71dbedadafcf7e5ed7555fa1153a7e83693"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bindings/rust/src/value.rs:370-378 | serverless/rust/value.rs:334-342 \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":"bindings/rust/src/value.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"b572e97b7574ba071f72c27482cbb38f3977fcd1e3ab9b469c48b982ad662df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): core/incremental/vdbe_maintenance/plan.rs:1030-1043 | core/translate/optimizer/mod.rs:756-771 \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":"core/incremental/vdbe_maintenance/plan.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"96384ec8154c3479d7e2dd4cefe94d8ab5303fc13ac81e57be1d81afbe941969"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): core/io/win_iocp.rs:1002-1029 | core/io/win_iocp.rs:1083-1106 \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":"core/io/win_iocp.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"84309fd0a809d95164047a24e7303beca4f95371d3100be6cd16a23ee8596908"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): testing/differential-oracle/sql_gen/src/policy.rs:570-593 | testing/differential-oracle/sql_gen/src/policy.rs:635-656 | testing/differential-oracle/sql_gen/src/policy.rs:659-680 \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":"testing/differential-oracle/sql_gen/src/policy.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5400b8c1cb290502eaf1788a5122a4d4fc5709d9025f7bda9fd91a2e7b35c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bindings/javascript/sync/src/js_protocol_io.rs:296-312 | sync/sdk-kit/src/sync_engine_io.rs:357-374 \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":"bindings/javascript/sync/src/js_protocol_io.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4440458ed853ee905d617f95a493dc6f3b201a00942e537aed1d80e51f8ba17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): core/translate/optimizer/lift_common_subexpressions.rs:318-330 | core/translate/optimizer/lift_common_subexpressions.rs:333-345 \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":"core/translate/optimizer/lift_common_subexpressions.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1dbcd1c48c33c70ca9cedb76e70306ae4b29fbd76080bbd5e2f35f86f9ca79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/vector/operations/jaccard.rs:67-77 | core/vector/operations/jaccard.rs:79-89 \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":"core/vector/operations/jaccard.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f444b050995d49b6e8af8b92043b56161c55cbed14389b330a7523067947a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): core/storage/btree.rs:6928-6943 | core/storage/btree.rs:6946-6961 \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":"core/storage/btree.rs"},"region":{"startLine":6928}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee77ae4924ede7a487a33b521be1bb99d821f5e5915cf30f9ba14fc8a450620"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sdk-kit/src/capi.rs:500-509 | sdk-kit/src/capi.rs:532-541 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2085b889a660d70bc466c705571883d60f4629e4c2aa6c5ca0e80874f34c9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:311-323 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:436-449 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"6376521af3ac5d4961994c43f5c4523b6534b312c6a03cbec5b17e9f2d9f4fa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bindings/c/src/lib.rs:803-824 | bindings/c/src/lib.rs:827-843 \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":"bindings/c/src/lib.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f695ca02ae68046754f5baf898300de2292e497f971a9e2f046a31ccc1fafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/vtab.rs:304-312 | core/vtab.rs:343-355 \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":"core/vtab.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a55bdab0fcd5d022e30a1aa426f792b7da912f188f1186211e9a1f380fb6577"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): postgres/parser/parser.rs:714-728 | postgres/parser/parser.rs:730-744 \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":"postgres/parser/parser.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5667ab07458919253f00a4466041abed71b601cd68adf090a1337f76e82d33d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): testing/simulator/generation/property.rs:2347-2363 | testing/simulator/generation/property.rs:2370-2389 \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":"testing/simulator/generation/property.rs"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25cc6104eb85aee553e5c39d44af23900b57a586860ff90fe6b857e47f8421b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): testing/simulator/model/interactions.rs:214-226 | testing/simulator/model/interactions.rs:236-249 \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":"testing/simulator/model/interactions.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b63b7c6fea969449e85ebdeb9f06d4ae8b47ca2dd800148f7031b191b03ff37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): bindings/go/bindings_sync.go:710-725 | bindings/go/bindings_sync.go:737-750 \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":"bindings/go/bindings_sync.go"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c422e8e04ed65470bb91cd7f2e7b77042fa54d95c00cc3bc2a1098a2e1ca10d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): core/time/internal.rs:143-155 | core/time/internal.rs:157-169 | core/time/internal.rs:171-183 \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":"core/time/internal.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"8820559d71205f1f3bdd10b99c7d44960521b3330238a431c505f15ba55c3ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/translate/optimizer/lift_common_subexpressions.rs:288-296 | core/translate/optimizer/lift_common_subexpressions.rs:299-307 \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":"core/translate/optimizer/lift_common_subexpressions.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a153d8d75273b53999558e8ffbd87a4aa51d31a68db87dfe1bd5eea88208721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): core/translate/optimizer/unnest.rs:1391-1408 | core/translate/optimizer/unnest.rs:1447-1459 \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":"core/translate/optimizer/unnest.rs"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8289219366f5fb806a05d86056f16a14d345f5d4a4d026f89a28314a5b121e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): sdk-kit/src/capi.rs:83-93 | sdk-kit/src/capi.rs:101-113 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce377452c7ada258f80b7b417fcaacc3affc3053e6d9cff576e15b071adf15c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/vdbe/execute.rs:2892-2902 | core/vdbe/execute.rs:15550-15558 \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":"core/vdbe/execute.rs"},"region":{"startLine":2892}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde06613ac9d282c7756d1c696bcf334323861e9c9c63cea4d35002c3c4fb04d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): postgres/parser/lexer.rs:343-352 | postgres/parser/lexer.rs:378-387 | postgres/parser/lexer.rs:420-432 | postgres/parser/lexer.rs:434-446 | postgres/parser/lexer.rs:513-522 \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":"postgres/parser/lexer.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"3247df404afdd01224c87d1a26288634073841797bafbcf86c3bec32ee25b0e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): sqlite/parser/src/ast/fmt.rs:1488-1504 | sqlite/parser/src/ast/fmt.rs:2436-2450 \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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a4c9eecb3e5d00ed1d7bc0e4e8fd8937674aee94ab5400815dc8044ffa143f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 15\u002B corresponding lines): testing/concurrent-simulator/multiprocess.rs:467-483 | testing/concurrent-simulator/multiprocess.rs:489-506 | testing/concurrent-simulator/multiprocess.rs:508-522 | testing/concurrent-simulator/multiprocess.rs:528-545 | testing/concurrent-simulator/multiprocess.rs:550-564 | testing/concurrent-simulator/multiprocess.rs:570-584 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/multiprocess.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d313f0987695751c2ac44bec68f0120bf1bd1232652596bb5c1645568e7436"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): testing/sqltest/src/parser/mod.rs:686-696 | testing/sqltest/src/parser/mod.rs:709-719 | testing/sqltest/src/parser/mod.rs:734-744 \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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c1ef72664d2cb72f0aa5ce1c8c99db3024e18f8dc5c5bdcc3449532de78043"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs:75-90 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs:93-107 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7c83a92e5a50bfbc3474a9bf5892b83a16f73dc79d86544c5d63edff5de18a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): sdk-kit/src/capi.rs:52-61 | sdk-kit/src/capi.rs:446-455 | sdk-kit/src/capi.rs:462-471 | sdk-kit/src/capi.rs:516-525 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"719bf520d587b14512d1eccb9cea3f00b66330b5504a455588672b7ef8cae29f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): testing/concurrent-simulator/chaotic_elle.rs:253-264 | testing/concurrent-simulator/chaotic_elle.rs:297-308 \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":"testing/concurrent-simulator/chaotic_elle.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b45198fd2ff6f141f17e53e697f7fe2d59454f2e3c3ceb93ce141c3f65ab74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): bindings/dotnet/src/Turso.Raw/Public/TursoBindings.cs:132-150 | bindings/dotnet/src/Turso.Raw/Public/TursoBindings.cs:164-188 \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":"bindings/dotnet/src/Turso.Raw/Public/TursoBindings.cs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8639449f5ccb3aedb12509f078ad35604acb0bab3b35913510167b873b3c0198"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): bindings/python/turso/lib_aio.py:256-266 | bindings/python/turso/lib_aio.py:269-278 | bindings/python/turso/lib_aio.py:281-290 \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":"bindings/python/turso/lib_aio.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"f108550d1f40e1fd4088304655ac459be40c0ca73317b87258f726fcc80e3892"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): testing/differential-oracle/sql_gen/src/policy.rs:2127-2146 | testing/differential-oracle/sql_gen/src/policy.rs:2151-2169 | testing/differential-oracle/sql_gen/src/policy.rs:2172-2190 | testing/differential-oracle/sql_gen/src/policy.rs:2195-2213 \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":"testing/differential-oracle/sql_gen/src/policy.rs"},"region":{"startLine":2127}}}],"partialFingerprints":{"codehealthFindingId/v1":"936525ca184ed481ed01aef48a765e612137237d9324c445c5078469203e923f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): bindings/python/src/turso.rs:377-389 | bindings/python/src/turso.rs:392-402 \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":"bindings/python/src/turso.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9403de8c262d48831137d462ac66858aed8410f675ae5c6f2362b5af0adae5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): cli/mcp_server.rs:779-787 | cli/mcp_server.rs:789-797 | cli/mcp_server.rs:799-807 | cli/mcp_server.rs:809-817 \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":"cli/mcp_server.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5944859c32e7716bf606259a5e29afd21e257ef2eb8a79f7100af70083fd1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): core/io/io_uring.rs:123-137 | core/io/io_uring.rs:144-156 \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":"core/io/io_uring.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb46bc8808d3d06e484bebda6465c609835d8f309cbb99f0f3680a4a614cd84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): core/storage/btree.rs:727-738 | core/storage/btree.rs:740-751 | core/storage/btree.rs:6809-6824 | core/storage/btree.rs:6826-6836 \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":"core/storage/btree.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1e961f68dc26b9f8eddc05e410495f00c6591a84f0997b058046a9513cd973"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): core/storage/wal.rs:1267-1280 | core/storage/wal.rs:2386-2399 \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":"core/storage/wal.rs"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a4c0314b1daed41f65a7192bd3e3bc3d7f60110793e019170204b52e9103de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/translate/optimizer/multi_index.rs:109-119 | core/translate/optimizer/multi_index.rs:128-138 \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":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffb0e4d244a029127dc9c694f2a2c735991db552273708c6fcc7d2944c02011"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): core/translate/plan.rs:530-537 | core/translate/plan.rs:541-548 \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":"core/translate/plan.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"5217482d6295f1acffb7db5ffaebd75dbcdb469f19581e0eb0d5ca40e34340e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): core/translate/plan.rs:2195-2206 | core/translate/plan.rs:2210-2221 | core/translate/plan.rs:2229-2240 | core/translate/plan.rs:2288-2299 \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":"core/translate/plan.rs"},"region":{"startLine":2195}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7467db52dbb427213e60a7a492343abde9ed3e9bc0adac0f47db3a9985e56e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): core/types.rs:2258-2271 | core/types.rs:2274-2287 \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":"core/types.rs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacad36b34cae01acfebbe9451fefe06fcb2cdae977fead95c32826eb10d473a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): core/vdbe/value.rs:207-219 | core/vdbe/value.rs:221-228 \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":"core/vdbe/value.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1feda29190f699450aebb722cb1be836a079b6356d5f6a61d1c61472b85652c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): sdk-kit/src/capi.rs:585-594 | sdk-kit/src/capi.rs:634-643 | sdk-kit/src/capi.rs:679-691 | sdk-kit/src/capi.rs:869-881 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0277b2c7541c4335b494ec55b6b8d3fbde8e90be7e6fa380c811820b3510ab89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sdk-kit/src/rsapi.rs:430-443 | sdk-kit/src/rsapi.rs:490-503 \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":"sdk-kit/src/rsapi.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9afec5aeb4dfacde2e11e0f23b98a83ba799f7c8068401525abf0758721201"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): sqlite/parser/src/parser.rs:2871-2885 | sqlite/parser/src/parser.rs:3373-3391 | sqlite/parser/src/parser.rs:4618-4631 \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":"sqlite/parser/src/parser.rs"},"region":{"startLine":2871}}}],"partialFingerprints":{"codehealthFindingId/v1":"985560c5502531093b23aa84c421aed0452832fdcfcf5f9b410574524c4baefa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): sync/engine/src/database_sync_operations.rs:393-409 | sync/engine/src/database_sync_operations.rs:411-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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"682a5e9eb8a460b8036fa714083ea964dc3683a2cd30741593dfd310f3a39622"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): sync/engine/src/server_proto.rs:460-467 | sync/engine/src/server_proto.rs:538-544 \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":"sync/engine/src/server_proto.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2cc88aeb786cb951abc3c5d1b4cddf4d7997415e5e9f5768719f846d2b4a94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/index_method/fts/mod.rs:3488-3497 | core/index_method/fts/mod.rs:3567-3576 \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":"core/index_method/fts/mod.rs"},"region":{"startLine":3488}}}],"partialFingerprints":{"codehealthFindingId/v1":"485449b0ddf0defabec4d0015b1ec05a0bb5a2c4ec51dae030e8bf706359b69c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): core/mvcc/database/mod.rs:7995-8007 | core/mvcc/database/mod.rs:10718-10730 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":7995}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8023d78c24ed44bc04d18f09aec1b6ff2e080be9e81437c3abf5dc6865fb89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/storage/wal.rs:1282-1293 | core/storage/wal.rs:1299-1309 \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":"core/storage/wal.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d34de49579e93cdea4f9d4d8a88cdc8ee5eab6a9e38763f077eb8994de8c1b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): core/translate/delete.rs:426-447 | core/translate/insert.rs:2144-2157 \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":"core/translate/delete.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc13a6702cc318a18770fea710104d1f59efe0e9630550ab5f747a77b3ee54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): extensions/ipaddr/src/lib.rs:45-55 | extensions/ipaddr/src/lib.rs:58-68 | extensions/ipaddr/src/lib.rs:71-81 \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":"extensions/ipaddr/src/lib.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa09cd3688ef93a843f0bdd91dab1db456878813c96f3e76aa6a6886ac14737"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): postgres/parser/parser.rs:1521-1536 | postgres/parser/parser.rs:2093-2119 \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":"postgres/parser/parser.rs"},"region":{"startLine":1521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d869432698e398706b27c1f61c4c1acc26786a9ddc22b1842c8b7fe2b544d102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/index_method/fts/mod.rs:486-496 | core/index_method/fts/mod.rs:551-560 \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":"core/index_method/fts/mod.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d936ec81986e419a15a3bffd917b2b2bb2f2be87f60ff7c18c0b53baf6a3d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/io/memory.rs:316-326 | core/io/memory_yield.rs:183-193 \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":"core/io/memory.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d86daa4871ed8a937ece2de284fb64aabfdc23c9627d84e364733cc81aff463"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): core/vdbe/execute.rs:15458-15467 | core/vdbe/execute.rs:15474-15483 | core/vdbe/execute.rs:15625-15634 | core/vdbe/execute.rs:15641-15650 \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":"core/vdbe/execute.rs"},"region":{"startLine":15458}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b45d61d59b43be42801edba0d2fde1fd82776f196af2839caebe42a93b09a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/vector/operations/distance_cos.rs:43-52 | core/vector/operations/distance_dot.rs:43-55 \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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc85225b09e30cd534719cd4ddb1b21148167347a105d8dadf770bcb8a45f3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): extensions/fuzzy/src/caver.rs:11-20 | extensions/fuzzy/src/caver.rs:24-33 \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":"extensions/fuzzy/src/caver.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4728668dff6b001fa886dc4a08ca8993af672bc5428ef009413221cd6258a1a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): extensions/fuzzy/src/lib.rs:467-476 | extensions/fuzzy/src/lib.rs:493-502 \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":"extensions/fuzzy/src/lib.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9f753307082c23ebd18821c770e958438c8897001f8a4948da1cf6025a1e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): postgres/client/lib.rs:275-282 | postgres/regress/main.rs:1600-1607 \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":"postgres/client/lib.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"876fa7241f83adcac41551789c72072c3c9e347f87c379c69b8d5356fe0f378a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): postgres/client/lib.rs:342-348 | postgres/regress/main.rs:1637-1643 \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":"postgres/client/lib.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"764fb661caaf421815001546ae6dc5a3b7902cb62ca61643c0f552e78ea2f486"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sqlite/parser/src/parser.rs:3518-3526 | sqlite/parser/src/parser.rs:4075-4083 \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":"sqlite/parser/src/parser.rs"},"region":{"startLine":3518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17869359d0140c3d3d5cdf81be7960e74e0aa2f2eb7a1a08230470105bdd8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sync/sdk-kit/src/capi.rs:407-414 | sync/sdk-kit/src/capi.rs:438-445 \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":"sync/sdk-kit/src/capi.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad18c44d289f9d1dd5a58307167ef326474cac045344a5079d34cbb954ad309b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): testing/differential-oracle/sql_gen/src/generate/stmt.rs:1213-1226 | testing/differential-oracle/sql_gen/src/policy.rs:325-332 | testing/differential-oracle/sql_gen/src/policy.rs:2292-2303 \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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea524b550e42d4c8fdae16745b4be1ab73447e169984403e7a1b5a2c294c9ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs:323-343 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs:346-367 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a67d25a5d883dff3bbafa1f642adc5c9ab40c516a19a1f426b45cf946add74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): bindings/dotnet/src/Turso.Data/TursoDataReader.cs:255-269 | bindings/dotnet/src/Turso.Data/TursoRemoteDataReader.cs:250-263 \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":"bindings/dotnet/src/Turso.Data/TursoDataReader.cs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46ae338d33d5406040ef61183b811c8f41376cb2c47accf420644bba0fef386"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bindings/rust/src/connection.rs:442-450 | bindings/rust/src/connection.rs:457-466 \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":"bindings/rust/src/connection.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87b37962a804166bdf6ec8438a7a166e41a38c13b95db13f851baf8492fc6fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): core/io/mod.rs:948-955 | core/io/mod.rs:957-964 \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":"core/io/mod.rs"},"region":{"startLine":948}}}],"partialFingerprints":{"codehealthFindingId/v1":"9526e41ca9352ce756364bcff561d430980b09bfb56d4e1355a7942a0a1c107c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): postgres/frontend/statement.rs:92-98 | postgres/frontend/statement.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":"postgres/frontend/statement.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c930ce4cd6eaafa78af0dba4329a06384924a27b6ae3edf9f011ca63ad386114"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): sqlite/parser/src/lexer.rs:556-564 | sqlite/parser/src/lexer.rs:626-637 | sqlite/parser/src/lexer.rs:640-648 \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":"sqlite/parser/src/lexer.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d381cd81371318d884d36d5e95a53f5893a0a8927789dc8bc3b9c36765dabd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): bindings/rust/src/connection.rs:354-364 | bindings/rust/src/connection.rs:367-377 \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":"bindings/rust/src/connection.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"a44150a648656cd52cc3c8e3b5ead794e2db160a58ddd92a87f49b1bd21efd3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): core/index_method/fts/mod.rs:2901-2912 | core/index_method/fts/mod.rs:2933-2945 \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":"core/index_method/fts/mod.rs"},"region":{"startLine":2901}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f79c654f50238b11cce219cb3a169e10aef749611811d90b8a9dd2892cf45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): core/time/mod.rs:17-75 | core/uuid.rs:7-25 \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":"core/time/mod.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0b09af3497557c775e23de5f352f9945e34967d4e211478f6cb72370856438"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/translate/plan.rs:558-567 | core/translate/plan.rs:576-585 \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":"core/translate/plan.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c9aa6f144df25e673065a11b44ec32c49f253f18f71aa74cbe993158394053"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/vdbe/execute.rs:251-260 | core/vdbe/value.rs:134-144 \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":"core/vdbe/execute.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc3a624339e7a64d62832f56fbf9ae24a44fab15bcf03a009ac10070d09c06a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): bindings/dotnet/src/Turso.Raw/Public/TursoBindings.cs:308-324 | bindings/dotnet/src/Turso.Raw/Public/TursoBindings.cs:327-343 \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":"bindings/dotnet/src/Turso.Raw/Public/TursoBindings.cs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe954d3031c6f0ae52fbcea5023d4a788b1135b265869f2f0ac5d6990438c74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): core/mvcc/database/mod.rs:8076-8093 | core/skiplist/base.rs:245-272 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":8076}}}],"partialFingerprints":{"codehealthFindingId/v1":"859b4165e15872068022c0ce2876fbfadcc076ef032be296ef242a740112f908"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/schema.rs:5987-5998 | postgres/frontend/catalog.rs:4255-4263 \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":"core/schema.rs"},"region":{"startLine":5987}}}],"partialFingerprints":{"codehealthFindingId/v1":"a781fff778149e612d35c502172dbe31f6eaac3c91e0ca2653947498dfd579d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): core/time/mod.rs:334-344 | core/time/mod.rs:347-357 | core/time/mod.rs:517-527 | core/time/mod.rs:530-540 | core/time/mod.rs:543-553 | core/time/mod.rs:556-566 \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":"core/time/mod.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"50327d5fd643374f1176110c21533360521eecc1e16cec504aff91fab2a6dcf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): core/vdbe/execute.rs:366-371 | core/vdbe/execute.rs:376-384 \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":"core/vdbe/execute.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee609bdebaf8e110ecb3685b90d3df2f5da66176d5c5bffbce292be50be9996"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): core/vtab.rs:208-218 | core/vtab.rs:220-230 | core/vtab.rs:232-242 | core/vtab.rs:244-254 \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":"core/vtab.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da773d695bd5f3ef8c9bc7d0d65e16e01d319e499134af1174fb461ea4faf37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): postgres/frontend/catalog.rs:3238-3256 | postgres/frontend/catalog.rs:3303-3317 \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":"postgres/frontend/catalog.rs"},"region":{"startLine":3238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59fd7c6159b89d2eb41fd120b3695b180e5e913ad64656144310b2b6701a432"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs:820-827 | bindings/dotnet/src/Turso.Data/TursoCommand.cs:265-272 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9723a2698d6871410976e4d33d72ee8e7bd093dcfcbff6027b066a0b242bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs:132-152 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs:155-176 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"22786cfe0facbfc334700609dc41cfe4a3a7ae120448eb45a4540d12431378a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): bindings/go/bindings_db.go:701-714 | bindings/go/bindings_db.go:717-729 \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":"bindings/go/bindings_db.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c1058591f80ec6c52d6d68d5714a6830aaafa51b85b27f8845fc336b579dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): bindings/go/driver_sync.go:315-329 | bindings/go/driver_sync.go:365-379 \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":"bindings/go/driver_sync.go"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d06f4df4a41b081bd25699577c28e206354ac630411ea825e97dec4929c764b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): serverless/go/driver.go:231-242 | serverless/go/driver.go:297-307 \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":"serverless/go/driver.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d3283434b47c1411c7765e697822cd9432faf894b14f00a748ee9bac508c00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): bindings/c/src/lib.rs:1758-1771 | bindings/c/src/lib.rs:3306-3321 \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":"bindings/c/src/lib.rs"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fac02e2ccfca48d31ddd39215654777096573b1bba28aa9f9cb8d00314c9b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/mvcc/database/mod.rs:8770-8779 | core/mvcc/database/mod.rs:8862-8875 \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":"core/mvcc/database/mod.rs"},"region":{"startLine":8770}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c9a1f530ec89ba15a66d1039d4b5472756cfe843ae87be4b8fa12ea60b7e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): core/statement.rs:1468-1478 | postgres/frontend/statement.rs:597-603 \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":"core/statement.rs"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0b8b73e2a49870f9bb1689d09241afad86cb90128c52658586808bb8a987506"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sync/engine/src/database_sync_engine.rs:655-667 | sync/engine/src/database_sync_engine.rs:687-696 \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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec01d2076bb8ceabb88f355409c36a4f76db9c233dd5fac566f9001acdadacf3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): testing/concurrent-simulator/workloads.rs:585-593 | testing/concurrent-simulator/workloads.rs:638-646 \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":"testing/concurrent-simulator/workloads.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9c78a95382704eddffd67c32d63a05f6a05dc340273f34206fabaf2a319451"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): testing/differential-oracle/sql_gen/src/generate/stmt.rs:915-926 | testing/differential-oracle/sql_gen/src/generate/stmt.rs:933-947 \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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"f938cf01266d300164d7f66fdde36341dbba0bb8fabb6aeb42f9668c54cd57cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): testing/sqltest/src/comparison/pattern.rs:5-18 | testing/sqltest/src/comparison/pattern.rs:21-36 \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":"testing/sqltest/src/comparison/pattern.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"203ff7ddb0b5091f2f7cdca24bbde65182930574b89e2cd753a74479ef5fd444"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): bindings/c/src/lib.rs:1979-1991 | bindings/c/src/lib.rs:2007-2018 | bindings/c/src/lib.rs:2025-2036 \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":"bindings/c/src/lib.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f4525f2e72fe6d4a8db5aee4be7a053d15f4ee7a2e4ec07a47dd92b8b25e5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): core/json/mod.rs:128-134 | core/json/mod.rs:139-144 \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":"core/json/mod.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ce79466006228b964653e532f0d4cbd5363bdfc543f9b816666cd32a4df35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): core/translate/expr/walk.rs:193-208 | core/translate/expr/walk.rs:210-220 | core/translate/subquery.rs:2581-2593 | core/util.rs:942-952 \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":"core/translate/expr/walk.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd550e4798b264d51ec4152048673cccaa258c4454995ee765f5780a731fc57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): core/translate/trigger.rs:519-528 | core/translate/trigger_exec.rs:1236-1247 | core/util.rs:2068-2080 \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":"core/translate/trigger.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7deb633d8e5e938d1e36fbaf9907a9de828ea8d5a7eddb05ed1b3232ec0208e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): extensions/fuzzy/src/lib.rs:413-423 | extensions/fuzzy/src/lib.rs:426-436 | extensions/fuzzy/src/lib.rs:439-449 | extensions/fuzzy/src/lib.rs:452-462 \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":"extensions/fuzzy/src/lib.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab46af5bd61315fcaefb1e8f6cb02300b0319ac28242337e1534636b18c1900"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): testing/differential-oracle/sql_gen_prop/function.rs:681-693 | testing/differential-oracle/sql_gen_prop/function.rs:725-736 \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":"testing/differential-oracle/sql_gen_prop/function.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5a10d758219b199194325e85e4a8195dbc11be15063662c7cd5c9f9629ec43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): testing/sqltest/src/backends/mod.rs:222-234 | testing/sqltest/src/comparison/mod.rs:122-134 \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":"testing/sqltest/src/backends/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e722a08a25d79337f29db7982a0fb2581389be4e9a640fabb4e6b46ba347683f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): testing/sqltest/src/runner/mod.rs:116-128 | testing/sqltest/src/runner/mod.rs:185-197 \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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d53a6e90b4b2a29a56a565084cea3530545a6ca90a46354e1ada7e997a574f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/ManagedSqliteStatement.cs:138-159 | bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteRelationalConnection.cs:360-379 \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":"bindings/dotnet/src/Turso.Data.Sqlite/ManagedSqliteStatement.cs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6d3ca5b36253726286dd028972adc7a0a344d57e8391e717565b663b561bff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): bindings/dotnet/src/Turso.Data/TursoBatch.cs:191-206 | bindings/dotnet/src/Turso.Data/TursoBatch.cs:212-231 \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":"bindings/dotnet/src/Turso.Data/TursoBatch.cs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96bdf3d231af09ee6cf28635adb4ae46d35c9a6e871644ff238911b05ee7cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): bindings/go/bindings_db.go:487-498 | bindings/go/bindings_db.go:501-511 \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":"bindings/go/bindings_db.go"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1dca6e10d5fb44d199ac8ea4be7b1231b7adf8f4fdcf05cefb843514ff466ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): bindings/go/bindings_db.go:650-662 | bindings/go/bindings_db.go:666-679 \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":"bindings/go/bindings_db.go"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59a647b7bd5e9031f49533fa873d493c66a6058cab7065f95bee615999ad7b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bindings/go/driver_db.go:863-872 | serverless/go/driver.go:569-577 \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":"bindings/go/driver_db.go"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8cc135bd10fe97201753778adc41dfaf81f1046797133bce75d2ee98424183"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:140-148 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:151-159 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:162-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 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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"014a2ccdb35777d158beece9c1f5f58c0e7c74d002159aff2f7214a272a48130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): bindings/c/src/lib.rs:2455-2464 | bindings/c/src/lib.rs:2469-2478 \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":"bindings/c/src/lib.rs"},"region":{"startLine":2455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81f1ae4bfb48246b35e921bd3e5bfca662ee1a2b975b6e17297bee3f64a2d8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/index_method/fts/mod.rs:498-509 | core/index_method/fts/mod.rs:562-572 \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":"core/index_method/fts/mod.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a799f9148f9c387d029ee5243e34d4fb0bca7651c4c0d032a31c62609eaa33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/storage/page_cache.rs:556-568 | core/storage/page_cache.rs:573-582 \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":"core/storage/page_cache.rs"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6953860289bf4867888d37150011fd217a9d84bdc9b9148b644a4ecb3e92ecd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): core/storage/wal.rs:4180-4187 | core/storage/wal.rs:4193-4207 \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":"core/storage/wal.rs"},"region":{"startLine":4180}}}],"partialFingerprints":{"codehealthFindingId/v1":"673c22b8598b3dd5ceb585fd944d9da7683bcf6996c3fc4a946a433f4f0716ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): postgres/parser/translator.rs:8815-8827 | testing/simulator/model/lateral.rs:393-405 \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":"postgres/parser/translator.rs"},"region":{"startLine":8815}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f486681bf9341595f414444a73c62eaac4eef71248f189d2879658d7c1b2cbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sql_generation/model/query/insert.rs:148-157 | sql_generation/model/query/update.rs:56-66 \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":"sql_generation/model/query/insert.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7bb4869c4dc1b790a7a8eda81554e5d8cea2e622d9842ba26961444f1e6d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): testing/concurrent-simulator/workloads.rs:770-780 | testing/concurrent-simulator/workloads.rs:787-800 \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":"testing/concurrent-simulator/workloads.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c6c7f24efd2a3833a745772a21d57026c24d698d7633db80a2a61c72ad49d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): bindings/python/turso/lib.py:1142-1154 | serverless/python/turso_serverless/connection.py:606-613 \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":"bindings/python/turso/lib.py"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db3cf802b8045a0307e678d942fce64c803a674b9ccb659cd5cc9743fda1e26"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): core/turso_types_vtab.rs:45-62 | postgres/frontend/catalog.rs:1340-1356 | postgres/frontend/catalog.rs:3394-3411 \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":"core/turso_types_vtab.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac418ba5d2ff19319aa84fa6387531333ea9d196fe04f2db8efb90450f02574"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): postgres/parser/create_function.rs:129-139 | postgres/parser/create_function.rs:190-200 \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":"postgres/parser/create_function.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bda00116a5edcbebda011274a716dacdfeb5f98fa5aade9d78374d54e5a0ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): sqlite/parser/src/parser.rs:1456-1471 | sqlite/parser/src/parser.rs:2838-2850 \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":"sqlite/parser/src/parser.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18696e98a7fa702f586c05c275ff6a0cdbff99dcb16b67efb04a461b3fa576d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): testing/differential-oracle/sql_gen_prop/function.rs:749-756 | testing/differential-oracle/sql_gen_prop/function.rs:759-766 \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":"testing/differential-oracle/sql_gen_prop/function.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f2a1ac42125bfb79acfd0c74b2294ec8fbeb2a3331c0fc8ead926aa7168099"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): testing/differential-oracle/sql_gen_prop/select.rs:134-147 | testing/differential-oracle/sql_gen_prop/select.rs:152-165 \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":"testing/differential-oracle/sql_gen_prop/select.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b630c870e53c8d489a4fb2d67c8014c8e4d1e240c633969be47831331d1309fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): bindings/c/src/lib.rs:1544-1549 | bindings/c/src/lib.rs:1557-1562 | bindings/c/src/lib.rs:1668-1673 \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":"bindings/c/src/lib.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1957d9040bd6926c3b4b3ec3fece2dfd01cfefad8f8f87a3eab52e20f4e476f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/storage/wal.rs:350-360 | core/storage/wal.rs:371-382 \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":"core/storage/wal.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0282ac7e8bc456e393f1aa88c235cda4c67cdcd4c5c907d841c903ec4712141f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): core/sync.rs:19-26 | core/sync.rs:108-115 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/sync.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a97c55609bbfc479917c3060830cfb951ad4d10999e15e32e01e3151ae905d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): core/translate/expr/expr_type.rs:885-897 | core/translate/expr/expr_type.rs:1337-1349 \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":"core/translate/expr/expr_type.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"5435fbe74d4be8b21873e927eb67cf3d0503a1404bbac66c4dcffa533dd5460c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/vdbe/bloom_filter.rs:77-85 | core/vdbe/bloom_filter.rs:88-96 \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":"core/vdbe/bloom_filter.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0437ca2b4ef8185446da2e3fbcce4b33df05920fa9f513ff7d5a22a7f49d6555"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): core/vdbe/execute.rs:11322-11339 | core/vdbe/execute.rs:11346-11367 \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":"core/vdbe/execute.rs"},"region":{"startLine":11322}}}],"partialFingerprints":{"codehealthFindingId/v1":"515077a29f1c576f3f8bd878226572bbc511942c95d56d9547e0241f4ce6d125"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): core/vdbe/explain.rs:2910-2921 | core/vdbe/explain.rs:2929-2942 \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":"core/vdbe/explain.rs"},"region":{"startLine":2910}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6b296c62bca24b639440ef52b577e06684fe82a2a4acdb5287282109badc3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): testing/differential-oracle/fuzzer/ivm.rs:575-592 | testing/sqltest/src/backends/rust.rs:338-354 \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":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cac70926f8b071ec2d2fae89c4b46bd456623589f6c6b20c7679973a24411a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): testing/differential-oracle/sql_gen/src/policy.rs:1298-1315 | testing/differential-oracle/sql_gen/src/policy.rs:1318-1335 \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":"testing/differential-oracle/sql_gen/src/policy.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04219fe2fe0cf22d8370ae605ed452a5c1a81d6910225d6946bb6bfec0d8654"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): core/connection.rs:3806-3817 | core/database.rs:2461-2472 \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":"core/connection.rs"},"region":{"startLine":3806}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e556512c62525362c1a72c8c79ea547708c57eb22b225705a5882aaa5c5299"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): core/util.rs:2464-2477 | core/util.rs:2676-2689 \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":"core/util.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0036b159b4ac44557b8c0f3d7137a39b39fa221a91628cbe7840c589941f0dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): testing/concurrent-simulator/chaotic_btree.rs:171-188 | testing/concurrent-simulator/chaotic_btree.rs:195-207 \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":"testing/concurrent-simulator/chaotic_btree.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0996b993a99fcca0ef25fb06293db7c4a471d7ec2de8011b2b39d62a026efdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): testing/differential-oracle/sql_gen_prop/profile.rs:312-324 | testing/differential-oracle/sql_gen_prop/profile.rs:327-341 \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":"testing/differential-oracle/sql_gen_prop/profile.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41bbe7e9b0a13378511169b35224640955c885ccd278b4e1cea84a2f261c650"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/io/memory.rs:242-252 | core/io/memory.rs:254-265 \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":"core/io/memory.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"36a5af9da42f52299ebb0e98f47444b1cccb27f5ea91e9529054c033c9f0878b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/schema.rs:2174-2184 | core/schema.rs:2331-2341 \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":"core/schema.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7901b75893879638efec5d56ce175eb4bdab33719f4d14401720d02813607f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): core/vdbe/execute.rs:13806-13822 | core/vdbe/execute.rs:13829-13837 | core/vdbe/execute.rs:13922-13937 | core/vdbe/execute.rs:13944-13952 | core/vdbe/execute.rs:14564-14580 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":13806}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd07ce72773e3a0f3bb9ad5d95b8eefaa76479b9290074adedb8f6fd464129e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): core/vdbe/execute.rs:19479-19489 | core/vdbe/execute.rs:19500-19510 | core/vdbe/execute.rs:19517-19527 \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":"core/vdbe/execute.rs"},"region":{"startLine":19479}}}],"partialFingerprints":{"codehealthFindingId/v1":"251c977138fde99ca92a4029df9c8476f51b864a965059c4937926da811c98ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): extensions/crypto/src/crypto.rs:38-47 | extensions/crypto/src/crypto.rs:59-68 \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":"extensions/crypto/src/crypto.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"44697034e4985aa8db9b7350d2f0059c9b0a2b1fecb52f06190a6b2a3e3fdd20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): sqlite/parser/src/ast/fmt.rs:1955-1964 | sqlite/parser/src/ast/fmt.rs:2361-2371 \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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"b69cf53df02748aad5cd2d4c1487495fa81d9914333005b4889491e94a8718df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): testing/differential-oracle/sql_gen/src/generate/expr.rs:413-419 | testing/differential-oracle/sql_gen/src/generate/expr.rs:619-625 \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":"testing/differential-oracle/sql_gen/src/generate/expr.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b642a7986cee75888c92f8b1bcb885b35f5a793cab6d4c726bc6b838058ab7e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/mvcc/persistent_storage/mod.rs:174-184 | core/mvcc/persistent_storage/mod.rs:190-201 \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":"core/mvcc/persistent_storage/mod.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"de09105dd5158cc47ca2035e74d9e0e1f4fab2784fdaeab1f38e591ce9923d56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): sqlite/parser/src/parser.rs:3171-3181 | sqlite/parser/src/parser.rs:3998-4011 | sqlite/parser/src/parser.rs:4013-4025 \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":"sqlite/parser/src/parser.rs"},"region":{"startLine":3171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aa43e46484be508ab270afacb5b5847d743932f0c3d462f77d14db75144e73a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sync/engine/src/database_sync_lazy_storage.rs:118-128 | sync/engine/src/database_sync_lazy_storage.rs:138-146 \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":"sync/engine/src/database_sync_lazy_storage.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bb99f27647be7014627510bafb08be5c4f51db2ccc2b392f50b86c0886ffae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bindings/javascript/sync/src/js_protocol_io.rs:69-77 | sync/sdk-kit/src/sync_engine_io.rs:211-219 \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":"bindings/javascript/sync/src/js_protocol_io.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad158a0b089d8531ffd08a0c802fc95ecf548042ef4548e6a39281833370bca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): core/translate/trigger_exec.rs:1301-1311 | core/util.rs:2121-2130 \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":"core/translate/trigger_exec.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"f425abdcf59b52f9bc0d490b1c961f672371721b0a42b1d0ab4bb329e57648b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/vdbe/bloom_filter.rs:101-109 | core/vdbe/bloom_filter.rs:112-123 \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":"core/vdbe/bloom_filter.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f57ce30485d78ce4af8e51c01a336b955ae5f1a94ac560e675723ae44f97b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): core/index_method/backing_store.rs:115-132 | core/index_method/backing_store.rs:193-206 \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":"core/index_method/backing_store.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f33821652cdba85747fa812e9da9a4ce6b4a67388d717063313566b7e35c84c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): postgres/frontend/pg_type.rs:33-43 | postgres/frontend/session.rs:1537-1545 \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":"postgres/frontend/pg_type.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b3b71df498156ac659564f75a10a8785e5c9f11ffd641de45457e24bba216c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): core/translate/eqp.rs:679-689 | core/translate/eqp.rs:691-701 | core/vdbe/array.rs:196-206 \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":"core/translate/eqp.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70d996db3e7ef6441fb6b589d9dce4963eb74127c7ebbca039d406bda0d8ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): serverless/rust/rows.rs:35-45 | serverless/rust/statement.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":"serverless/rust/rows.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f323ef7d7c68425746b92993518199ede68db87d173720d4a41bf35ee31e05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): core/io/memory.rs:290-300 | core/io/memory_yield.rs:158-168 \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":"core/io/memory.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"1786ec51a90a1b1e67c0e53647287c310d69cad3cac8986f6f24d46d41015e7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): perf/latency/main.rs:377-383 | testing/concurrent-simulator/allocation_fault.rs:267-272 \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":"perf/latency/main.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1840ec3151f293418c186d32a792dcd7483eb950fe1ecbedd4c1cf9c19de980"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs:779-794 | bindings/dotnet/src/Turso.Data/TursoSyncDatabaseOptions.cs:124-151 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49fa34bc3e9177a98333ea1cfa89f3d87199ef17753ad8cdb42cab525cc8f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): serverless/rust/differential/lib.rs:660-667 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:365-368 \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":"serverless/rust/differential/lib.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29766c763a8fc5ce35e3eda156388babaf05da93b1389e1ee583c9d7235301e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bindings/dotnet/src/Turso.Data/TursoRemoteClient.cs:672-680 | bindings/dotnet/src/Turso.Data/TursoRemoteClient.cs:694-702 \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":"bindings/dotnet/src/Turso.Data/TursoRemoteClient.cs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"32158923903b372ff950a4970e378ade576130675c962a2c295e9081a2036637"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): sdk-kit/src/capi.rs:347-355 | sync/sdk-kit/src/capi.rs:290-297 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2b050efe8fb08b15e37866af51cb98672a1664cc3094e3e5a39f2199b8d779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): bindings/go/driver_db.go:451-457 | serverless/go/driver.go:499-505 \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":"bindings/go/driver_db.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bc98a59a39d24a4d182dc654b01f98dccd56e5c5ad62ca457d5fca22c3e514"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): testing/simulator/runner/io.rs:71-80 | testing/simulator/runner/memory/io.rs:267-276 \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":"testing/simulator/runner/io.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"371552cacf41f7a7ab39f0591dd1a838fd9033f0c34d8afbac559fbcc10a2a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): core/io/memory.rs:283-288 | core/io/memory_yield.rs:151-156 \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":"core/io/memory.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40ece60a48488a358d07d5b5d2f4be169cbc3ade924429f209baef5f3d8997a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): core/io/generic.rs:106-111 | sync/engine/src/sparse_io.rs:108-113 \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":"core/io/generic.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be87655dce8830c61d7bb7207c42bf4f05d20f7f5f145f95b6f25a687971448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): core/translate/catalog.rs:142-154 | core/translate/emitter/mod.rs:587-600 \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":"core/translate/catalog.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8186282c975179e4f77c410c5d9893598c11fcd077b0c91cb883dee14cc34404"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): testing/differential-oracle/sql_gen/src/context.rs:359-367 | testing/differential-oracle/sql_gen/src/generate/literal.rs:135-143 \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":"testing/differential-oracle/sql_gen/src/context.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1f61c45b8495734086e94af2ab8f2b094b5e8516d94f9623a055c472884d1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): core/io/generic.rs:98-103 | sync/engine/src/sparse_io.rs:100-105 \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":"core/io/generic.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"372555015c6fc8c665588f744a2f7b9382b4883eeefe5c18dce85bb1ec59f31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): core/schema.rs:8688-8697 | core/translate/optimizer/order.rs:47-47 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":8688}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f7c0054b5de71dc72b6ae50a170d94cbb6d6c299106636194552b4ef70eb05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): testing/differential-oracle/sql_gen/src/functions.rs:62-75 | testing/differential-oracle/sql_gen_prop/function.rs:133-146 \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":"testing/differential-oracle/sql_gen/src/functions.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b1041e30d573d090aa3d203ab6b3f7c327e7c437c8db30f6d8ef2eb956e439"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): cli/sync_server.rs:1219-1224 | sync/engine/src/database_sync_operations.rs:886-891 \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":"cli/sync_server.rs"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d430cca674cb068138b83b40b3dc1e56e65c4004bfdf6c11bd66dfba213f7819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): cli/sync_server.rs:1226-1231 | sync/engine/src/database_sync_operations.rs:900-905 \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":"cli/sync_server.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2410a177dae357c244c8aa2fb4136a736826b9b60318ff95250116430de3c6a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs:110-119 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Functions.cs:111-119 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b530f9903c1cb72a4a70415e8cf185e314507eb12bd36f767048c9c72e9d95d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/incremental/vdbe_maintenance/members.rs:108-116 | core/translate/order_by.rs:656-668 \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":"core/incremental/vdbe_maintenance/members.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee10e01946eb4d836182f5d7addae0df0ba119239d1b0ea90a0dd3e8fdb30f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): serverless/rust/rows.rs:53-58 | serverless/rust/statement.rs:79-84 \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":"serverless/rust/rows.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"618bbc5b68a2036e21ce8fa5c6b7bcef398788cd7c058ac29170c339c9b53162"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:433-441 | bindings/dotnet/src/Turso.Data/TursoBatch.cs:337-345 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"61336e2a37b93c92d926e0973d1199d9a1d2c1ce97325a8b871346725de9b5e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): bindings/dotnet/src/Turso.Data/TursoBatch.cs:33-43 | bindings/dotnet/src/Turso.Data/TursoCommand.cs:66-76 \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":"bindings/dotnet/src/Turso.Data/TursoBatch.cs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f113848435f5dd0fb9bda675b9b9ca19f1a485f5d8d57d1838d4c7aa72d09b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): core/io/generic.rs:113-116 | sync/engine/src/sparse_io.rs:115-118 \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":"core/io/generic.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"226a97902aae5f6b458d83e5e129be12233a979e2b47fd99d2ac1527accd2b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): core/translate/schema.rs:3762-3769 | core/translate/sequence.rs:1274-1281 \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":"core/translate/schema.rs"},"region":{"startLine":3762}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fba70ba29c7e049b6ac8da3b89a4af5e31eadf831d9283f65f8a5956f6b0b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): testing/simulator/runner/memory/file.rs:109-117 | testing/simulator/runner/memory/io.rs:246-254 \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":"testing/simulator/runner/memory/file.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd180689ed6e1994118550bd99a67746005045d095a1eeca98e38a9835b9d463"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): core/translate/plan.rs:2031-2036 | core/vdbe/explain.rs:36-41 \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":"core/translate/plan.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93e863235950ac7357433e8796b0b822182e232b06296694b5451198fdf2752"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs:60-60 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Functions.cs:58-58 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.Aggregates.cs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a3e179698377caf775898671768629bc6d514c0db1bd47d6734621cefaffa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): core/connection.rs:3776-3787 | core/translate/catalog.rs:197-205 \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":"core/connection.rs"},"region":{"startLine":3776}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5190ca32fce643120834aaaae975194ad6a1a6d7f64b95765d74fc66e3ba56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): core/storage/pager.rs:320-323 | core/storage/sqlite3_ondisk.rs:2334-2336 \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":"core/storage/pager.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8c3b1d5e24d1162bf47ef2b99c035802468354a68e97d13fa32bd781b67da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): sync/engine/src/database_sync_engine.rs:3172-3180 | sync/engine/src/database_sync_operations.rs:790-798 \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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":3172}}}],"partialFingerprints":{"codehealthFindingId/v1":"200f3c9c56cccb75a6591ec2c65838a2501ebe687a6056fc4cb54341dab76dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:139-145 | bindings/dotnet/src/Turso.Data/TursoCommand.cs:145-150 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"5072a7f24141ca024fd1978bb0848cd57b63a6f4734f00feb0cfd7f0c790f6bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnectionStringBuilder.cs:381-390 | bindings/dotnet/src/Turso.Data/TursoConnectionStringBuilder.cs:302-311 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnectionStringBuilder.cs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de253b06e7ac0c38f235b9785bfea17b3e4c3b8a9084d48212ad3e6a86b769f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): bindings/go/bindings_db.go:623-629 | bindings/go/bindings_sync.go:728-734 \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":"bindings/go/bindings_db.go"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"374d9c1ec5023d64c048bcbe4c85afb818ce05379ada8aab94be703c9bdb1002"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): core/io/memory.rs:328-331 | core/io/memory_yield.rs:195-198 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/memory.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"e253cc79a531029b19be31b6ab316a78cd5f4626ae87d4c6aafa74a050a93032"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): bindings/python/turso/lib.py:1258-1260 | serverless/python/turso_serverless/dbapi.py:154-156 \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":"bindings/python/turso/lib.py"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebda8492c7b14a9d3b7c29bddf139b6062ec0b6707b974a77b5f41c3b537739d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): bindings/python/turso/lib.py:1263-1265 | serverless/python/turso_serverless/dbapi.py:159-161 \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":"bindings/python/turso/lib.py"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70d8db1d316e374f3973c39007ca418bca2dea51f6e239e9150fb10e4293b23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): bindings/python/turso/lib.py:1268-1270 | serverless/python/turso_serverless/dbapi.py:164-166 \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":"bindings/python/turso/lib.py"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c8be2f7bec9810b66a422fe5374724523ed50837e10e56f003342bc3c8f3f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): bindings/python/turso/lib.py:1273-1275 | serverless/python/turso_serverless/dbapi.py:169-171 \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":"bindings/python/turso/lib.py"},"region":{"startLine":1273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea38d3b92aaa0eb527c46f16e9ae7357add22d79a4ad42648513ac71ec78830d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): testing/antithesis/stress-crash/helper_recovery_check.py:25-27 | testing/antithesis/stress-unreliable/helper_integrity_check.py:19-21 \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":"testing/antithesis/stress-crash/helper_recovery_check.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7547ccb6ba154307f0cabb197e423329f9f3b8e9590e959256b2762e1532d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): testing/differential-oracle/sql_gen/src/schema.rs:69-78 | testing/differential-oracle/sql_gen_prop/schema.rs:50-60 \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":"testing/differential-oracle/sql_gen/src/schema.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b77d375f8693636aad34024b46600e9254d48a6ec01d41d867693472919405f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): core/io/io_uring.rs:485-488 | core/io/unix.rs:75-78 | sync/engine/src/sparse_io.rs:39-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"core/io/io_uring.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f0f0db03593481c7934b7209e53a058cf0762f44e7c52cbbd33f158b8e2778"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): testing/differential-oracle/sql_gen/src/ast.rs:1464-1470 | testing/differential-oracle/sql_gen_prop/create_trigger.rs:39-44 \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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1464}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf1f15a140d2a7efae76f518c5b97b4a49397d27254bccab5ce1f91420c610c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): testing/differential-oracle/sql_gen_prop/value.rs:116-124 | testing/query-result-oracle/lib.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":"testing/differential-oracle/sql_gen_prop/value.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf53dc1d45d2c550d135951174f130d51d489e2415facf16df9d0253f5b28702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (95 lines \u00D7 2): core/mvcc/database/mod.rs:9507-9601 | core/mvcc/database/mod.rs:10550-10644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:9507\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":9507}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b403262945930bdc95f10f92e1464575898ea88005bee02e403baf52e27661c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (68 lines \u00D7 2): postgres/parser/parser.rs:106-173 | postgres/parser/parser.rs:624-691 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"685c2ab0f79d5fdd99e1cce23089dd3d1c7b29ebba1a3d8be248fda21a7fbcf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (61\u201364 lines \u00D7 2): testing/simulator/generation/property.rs:422-485 | testing/simulator/generation/property.rs:557-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.rs:422\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d7449ba3c37088a7fa6a1926ef18c331db5b4929b54f5d555c908dba0fd770"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 2): postgres/parser/parser.rs:1102-1159 | postgres/parser/parser.rs:1162-1219 \u2014 both copies are in the same file, so extract the block 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":"postgres/parser/parser.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"406868574a5be078fc343dfba0bdf15ab10e6f6542532b268263e59f2a3dcb7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): core/translate/index.rs:506-561 | core/translate/index.rs:606-661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/index.rs:506\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":"core/translate/index.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc474b58a8aacc782b277359ced3663c1dddb2996f170f15bf043666ed01ad7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50\u201353 lines \u00D7 2): testing/simulator/runner/differential.rs:103-152 | testing/simulator/runner/doublecheck.rs:125-177 \u2014 before extracting anything, compare \u0060testing/simulator/runner/differential.rs\u0060 and \u0060testing/simulator/runner/doublecheck.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/runner/differential.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/differential.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d1f2d5e232ea9f8cdc8735780db77d86284b5a7b0c75574af1217fb6d92398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): core/translate/display.rs:284-333 | core/translate/display.rs:404-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/display.rs:284\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u0060 in one and \u0060\u0026mut fmt::Formatter\u003C\u0027_\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":"core/translate/display.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23ca4432f03fe04a7d1e65d4f505d4d893d1ff972cdc2fa6beb6954341ec645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 3): core/json/jsonb.rs:360-406 | core/json/jsonb.rs:525-571 | core/json/jsonb.rs:606-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.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":"core/json/jsonb.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b6bf34d55ef9231a2ee91a46094ae0e26159acc9e2ddbf44d3df3cc0107b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42\u201347 lines \u00D7 2): core/translate/emitter/mod.rs:1456-1497 | core/translate/emitter/mod.rs:1585-1631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/emitter/mod.rs:1456\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":"core/translate/emitter/mod.rs"},"region":{"startLine":1456}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d43539e3de4561aae7a657e26fdae8bf46defb5decabd7e613d0f13b029b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (45\u201347 lines \u00D7 2): core/translate/fkeys.rs:1373-1419 | core/translate/insert.rs:4113-4157 \u2014 before extracting anything, compare \u0060core/translate/fkeys.rs\u0060 and \u0060core/translate/insert.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"core/translate/fkeys.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c80d61447fcfea974302d22d0aeef3311f323b42b09c93a1a2ad70d319176c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): core/translate/expr/walk.rs:149-191 | core/translate/expr/walk.rs:508-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 \u0060core/translate/expr/walk.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":"core/translate/expr/walk.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"385115f90ac588b28880c458ecce8f5a8a35964e52230fdc410082ef2fbc2ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201343 lines \u00D7 2): core/vdbe/execute.rs:3797-3839 | core/vdbe/execute.rs:3840-3865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:3797\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":3797}}}],"partialFingerprints":{"codehealthFindingId/v1":"551fc026fcc9282add97207bc6f130cd0c7c1d31f49bd0ff83df9fc5735fce21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (42 lines \u00D7 2): core/translate/optimizer/constraints.rs:909-950 | core/translate/optimizer/constraints.rs:1015-1056 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/constraints.rs:909\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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f3a46caa80070d639c02c95079fc4495865b6ddaef7095e34781eecef74116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 2): core/mvcc/persistent_storage/logical_log.rs:2860-2899 | core/mvcc/persistent_storage/logical_log.rs:3170-3209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/persistent_storage/logical_log.rs:2860\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2860}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cb9354fd7754533dfa0fac49995b468949eb528cf36e2e061348bcb980590a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201340 lines \u00D7 2): core/translate/sequence.rs:194-233 | core/translate/sequence.rs:445-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/translate/sequence.rs:235\u0060 calls \u0060alloc_registers\u0060, \u0060alloc_register\u0060 and \u0060core/translate/sequence.rs:483\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":"core/translate/sequence.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b6aa6c443ea5b0c700bf97ecacf29202b926a6da093af0d6a09f57a95f734c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): core/connection.rs:1713-1751 | core/connection.rs:4165-4203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/connection.rs:1713\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"8244b9c4f20ea36b755f0eba862479aebc1fb67907bf709c0209100d89825ece"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): sync/engine/src/database_sync_operations.rs:2006-2043 | sync/engine/src/database_sync_operations.rs:2151-2188 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/engine/src/database_sync_operations.rs:2006\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"143712270ac7fdfb2b27f3dd7501b7c31522a8e51e60e8bb02e613318d331cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201337 lines \u00D7 2): core/translate/alter.rs:1634-1670 | core/translate/alter.rs:2276-2310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:1634\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":"core/translate/alter.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"93260072bc57143d2b8e77d2b4232f43e23cb645d4bd0eb3c1a2476f7b19d6d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34\u201337 lines \u00D7 2): core/translate/emitter/delete.rs:990-1026 | core/translate/emitter/delete.rs:1058-1091 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/emitter/delete.rs:990\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"511bdb33e9f88c5a341a0e261c7258b01c2e1b19a0e17278706d6f086250889a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): core/translate/fkeys.rs:1452-1487 | core/translate/insert.rs:4239-4273 \u2014 before extracting anything, compare \u0060core/translate/fkeys.rs\u0060 and \u0060core/translate/insert.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/fkeys.rs:1452\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5faef812ef733daa64a12aa089892b1544d1116f09b199a98645a514232ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): core/json/mod.rs:920-954 | core/json/mod.rs:965-999 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/mod.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5683ace4d0e4e6cf39bd691389fbb66deca9995ca8c31c12bf0290eba7ba82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201334 lines \u00D7 2): testing/simulator/runner/differential.rs:67-99 | testing/simulator/runner/doublecheck.rs:90-123 \u2014 before extracting anything, compare \u0060testing/simulator/runner/differential.rs\u0060 and \u0060testing/simulator/runner/doublecheck.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/runner/differential.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/differential.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ff2939b0bb0252577209069cad4556f152f611c40f62fc1321837839c3395"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): core/translate/alter.rs:1683-1715 | core/translate/alter.rs:2330-2362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:1683\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3de4453f02c44444f143ad87a399bc76a5b88fe3678c53f5eb7233d3c56f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201333 lines \u00D7 2): core/translate/insert.rs:1531-1560 | core/translate/insert.rs:3259-3291 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"93588aa71cc27c8b31a51197b7f223931ea94ae3b436a795270e0b7ce1eb5212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): core/translate/main_loop/hash.rs:1141-1173 | core/translate/main_loop/hash.rs:1399-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 \u0060core/translate/main_loop/hash.rs:1141\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/hash.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3753886d52754e475f5a0e31c94f7a8425d14b330486bae853e448f62366a590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201332 lines \u00D7 2): core/mvcc/database/mod.rs:5453-5484 | core/mvcc/database/mod.rs:5534-5557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:5453\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":"core/mvcc/database/mod.rs"},"region":{"startLine":5453}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ca370ae19bef171f32d911987b517fd8608ef8e5905039de70bd054d43d38c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201332 lines \u00D7 2): core/translate/optimizer/constraints.rs:2240-2268 | core/translate/optimizer/constraints.rs:2317-2348 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/constraints.rs:2240\u0060 it begins part-way through the construct above it, so those exact 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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":2240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54d185736af2bb7657c51a18f46cda4fdcf88dc37b5cd16acc24ae6ab68ef46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201332 lines \u00D7 2): core/translate/sequence.rs:1160-1182 | core/translate/view.rs:711-742 \u2014 before extracting anything, compare \u0060core/translate/sequence.rs\u0060 and \u0060core/translate/view.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/sequence.rs:1160\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/sequence.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"32701d718bec111469cc91673c499eb518c9c3618046b3685826408b3a5b38b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): core/translate/expr/walk.rs:38-68 | core/translate/expr/walk.rs:397-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 \u0060core/translate/expr/walk.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/walk.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d870413ab8c7036de141ec64536c043b812c17169729caadb5ae6976b76104a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30\u201331 lines \u00D7 2): core/vdbe/execute.rs:11986-12016 | core/vdbe/execute.rs:12241-12270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":11986}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e0e5a0c3d519f6764431d89009ae6c04ad9f420352552518490aa6e9a83a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201330 lines \u00D7 2): core/translate/emitter/delete.rs:856-883 | core/translate/emitter/update.rs:2649-2678 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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, \u0060core/translate/emitter/update.rs:2682\u0060 calls \u0060Some\u0060, \u0060is_empty\u0060 and \u0060core/translate/emitter/delete.rs:884\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":"core/translate/emitter/delete.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"a078dab6bdd351e3b0555e4d75281cb7f566634adf3deecd42bc9dd845109c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): sync/sdk-kit/src/rsapi.rs:326-354 | sync/sdk-kit/src/rsapi.rs:389-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 \u0060sync/sdk-kit/src/rsapi.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":"sync/sdk-kit/src/rsapi.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8265a7d688e68e354e16a4b774356cc1330ddc08d450be973e46080595620619"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201328 lines \u00D7 2): core/schema.rs:9054-9081 | core/translate/index.rs:1329-1353 \u2014 before extracting anything, compare \u0060core/schema.rs\u0060 and \u0060core/translate/index.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:9054\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":9054}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea195f63f98d053c8a7a464014f872a1d979cd2262eaf91fb91c8aecf471c9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): core/translate/group_by.rs:781-808 | core/translate/group_by.rs:835-860 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/group_by.rs:781\u0060 it does not close everything it opens, so those exact lines 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":"core/translate/group_by.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5a1fe60e9dabb30cbcaa5d52afa345014afce556f1f27e43e46aba8a2bb88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): postgres/parser/parser.rs:452-479 | postgres/parser/parser.rs:2055-2080 \u2014 both copies are in the same file, so extract the block 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":"postgres/parser/parser.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e2457aa8e0530921562a24f60580adcf47b1c3a0c0398d7c8b87893b32dd4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): testing/simulator/generation/property.rs:487-514 | testing/simulator/generation/property.rs:619-646 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.rs:487\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"374736a348c9b1940b31d8ecdc5c7458c3c63e96e9197d9c7f02aff417c1b086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201327 lines \u00D7 2): core/dialect/engine.rs:149-170 | postgres/frontend/catalog.rs:142-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/dialect/engine.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":"core/dialect/engine.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad53e30082ecb61e8285f652fe183b9388118b2e7974f5af5c6842775c110c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): core/mvcc/database/checkpoint_state_machine.rs:2895-2920 | core/mvcc/database/checkpoint_state_machine.rs:2930-2956 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/checkpoint_state_machine.rs:2930\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2895}}}],"partialFingerprints":{"codehealthFindingId/v1":"247eb8d31873df9f822e44a4b4b76af814fa57c8e9249ab82340d34afea5709d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): core/statement.rs:1205-1231 | core/statement.rs:1289-1315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/statement.rs:1205\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"34afa9d6bee4cac5a4d09c64594c00cf8ebb5690c4b67fa8fa82af19335754d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): core/storage/btree.rs:2068-2093 | core/storage/btree.rs:2304-2330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:2068\u0060 it begins part-way through the construct above it, so those exact lines 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":"core/storage/btree.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9d24fe6ca576e8e613d03acef2007882d77c3deab96ece692f4a54db147df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): core/translate/expr/binary.rs:139-164 | core/translate/expr/binary.rs:176-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 \u0060core/translate/expr/binary.rs:176\u0060 it begins part-way through the construct above it, so those exact lines 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":"core/translate/expr/binary.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de308b76f044c219a36b2cbc49d11f0fe80e7b5a6737c6a3afd1f53eaed55d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): cli/read_state_machine.rs:93-118 | postgres/cli/read_state_machine.rs:128-153 | testing/sqltest/src/parser/sql_complete.rs:95-120 \u2014 before extracting anything, compare \u0060cli/read_state_machine.rs\u0060 and \u0060postgres/cli/read_state_machine.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/read_state_machine.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":"cli/read_state_machine.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"67821ce1397dbbcd7d4faef3cbde0cc96d04a97f6b1c9bb633e3947779bf9fd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 3): sync/engine/src/database_sync_operations.rs:1945-1970 | sync/engine/src/database_sync_operations.rs:2109-2134 | sync/engine/src/database_sync_operations.rs:2234-2259 \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 \u0060sync/engine/src/database_sync_operations.rs:1945\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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe76e85845ee6180d752d972ef2619766096db2987ec926544fb24e85d91ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): core/incremental/vdbe_maintenance/linear.rs:96-121 | core/incremental/vdbe_maintenance/linear.rs:175-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/incremental/vdbe_maintenance/linear.rs:124\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/linear.rs:203\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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"24dbd529673fba18badcbece983498a6c4a867721c4d02f2ccb5f4c0e17d2813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): core/translate/pragma.rs:1433-1458 | core/translate/pragma.rs:1498-1523 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/pragma.rs:1433\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":"core/translate/pragma.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"65feefd0c66b5808229586921ddddc39c42303dc3b6b465b595a27aabc7265a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): sqlite/parser/src/ast/fmt.rs:2027-2052 | sqlite/parser/src/ast/fmt.rs:2160-2185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/ast/fmt.rs:2027\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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":2027}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a3bcc907e7cafe82093c3fd22eabfa0ce23c894213c10704aefb7d5c5cbc9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): core/database.rs:3005-3029 | core/database.rs:3041-3065 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":3005}}}],"partialFingerprints":{"codehealthFindingId/v1":"251ef5034622f9c3c12f22ecb941d2a682a771a06af0eaca6f522c823f86c7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): core/incremental/vdbe_maintenance/set_op.rs:877-901 | core/incremental/vdbe_maintenance/set_op.rs:975-999 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/set_op.rs:877\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, \u0060core/incremental/vdbe_maintenance/set_op.rs:973\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs:875\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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b60f4b4c443b4f222f27fb3b8accb6cf79ba69330580a02b7bae6debdd55bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): bindings/java/rs_src/turso_db.rs:59-82 | bindings/java/rs_src/turso_db.rs:107-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/rs_src/turso_db.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"38723076e1aaba4ee3439bd8d97a84fb5bbfb7a82031c1580e0b4c9b2bf4be52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): bindings/rust/src/lib.rs:299-322 | bindings/rust/src/sync.rs:320-343 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"bindings/rust/src/lib.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"e471a0dde027b00708ca71ad90d43885e53c2fb8fc5563359baf23ba5586587b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): core/storage/btree.rs:5669-5691 | core/storage/btree.rs:5747-5770 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:5747\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":5669}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bad11aac3c7ac6c2ed74f25b51515b24a3bef842833c7b6d6f35108b0469a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): core/translate/planner.rs:604-627 | core/translate/planner.rs:653-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 \u0060core/translate/planner.rs:653\u0060 it begins part-way through the construct above it, so those exact 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":"core/translate/planner.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3fa07f40408aacc64c8b1460b84910fc5c4723c4e4359f16a8cfa33a9d4dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): core/translate/planner.rs:691-714 | core/translate/planner.rs:751-774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/planner.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":"core/translate/planner.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"19afd99a3448d197035f1c3dd3829dec5977676912257c7d2461bfdfd1bada0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201324 lines \u00D7 2): core/translate/sequence.rs:386-409 | core/translate/sequence.rs:634-650 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/sequence.rs:386\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/sequence.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6551e8d38c34d5230dfe1a0e88ed0256e2e2f48fa7bb27b721a11ebdc6a1d4d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): core/translate/view.rs:747-770 | core/translate/view.rs:865-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/view.rs:747\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":"core/translate/view.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"5738c44de0d63f7675b70bf5770dfa8f7cd21e05da4eb4f60f63ba9cf9c768e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): testing/simulator/generation/property.rs:805-828 | testing/simulator/generation/property.rs:1184-1207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.rs:805\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca36db44a724a4dc3ea5f76a75521f6d64d554f0cce308ee18c8f38a253dbe1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 3): core/translate/main_loop/init.rs:212-233 | core/translate/main_loop/init.rs:334-356 | core/translate/main_loop/init.rs:441-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 \u0060core/translate/main_loop/init.rs:212\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/init.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"55094f194c497ac7e1a5c2c2f94a39caf1adb0dd7d179dddf772ba413b8d40c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): cli/app.rs:1655-1677 | cli/app.rs:1692-1714 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/app.rs:1655\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/app.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"037f58ec5c6a76f98ef0c6f7464e45e69e3118ef593e74abe8a1263fee2fe3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): core/functions/datetime.rs:260-282 | core/functions/datetime.rs:327-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. 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, \u0060core/functions/datetime.rs:346\u0060 calls \u0060starts_with\u0060 and \u0060core/functions/datetime.rs:282\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":"core/functions/datetime.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"929279bea4e5e329dc9c72326b78bfd2dded2f3c5fc0ddf2d73df9988b2147c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:230-251 | core/incremental/vdbe_maintenance/set_op.rs:937-959 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/arrangement.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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bf9e7bfb6edd5ac04f02e1c72fc1bdafa6d3c70b30357f7a6874110f0727d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): core/pragma.rs:369-391 | extensions/completion/src/lib.rs:123-145 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/pragma.rs:369\u0060 it does not close everything it opens, so those exact 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, \u0060extensions/completion/src/lib.rs:146\u0060 calls \u0060Some\u0060, \u0060to_string\u0060 and \u0060core/pragma.rs:392\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":"core/pragma.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b1765ae18ff20cf381f6afa3114d6b6dc316f2b6397c3c0ccbd0881fa14963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): core/storage/btree.rs:5235-5257 | core/storage/btree.rs:5315-5335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:5235\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":5235}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee5e240458cf7dc223ef3e0bbef7f742c038a64b5cdcc8eaeba248791d187ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201323 lines \u00D7 2): core/translate/insert.rs:3309-3326 | core/translate/insert.rs:3463-3485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/insert.rs:3309\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/translate/insert.rs:3329\u0060 calls \u0060Some\u0060, \u0060preassign_label_to_next_insn\u0060 and \u0060core/translate/insert.rs:3486\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":"core/translate/insert.rs"},"region":{"startLine":3309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50a8fc8da44497b14f9073a85b4e63127be3d7863469a74f78ca5e9fb19efa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201323 lines \u00D7 2): core/translate/sequence.rs:343-356 | core/translate/sequence.rs:590-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 \u0060core/translate/sequence.rs:590\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/translate/sequence.rs:358\u0060 calls \u0060emit_insn\u0060 and \u0060core/translate/sequence.rs:623\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":"core/translate/sequence.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f48181cc3529e68e41ba180e1f2ea1ab783fe822488191893094434e067d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): postgres/client/lib.rs:151-169 | postgres/regress/main.rs:1549-1571 \u2014 before extracting anything, compare \u0060postgres/client/lib.rs\u0060 and \u0060postgres/regress/main.rs\u0060 as WHOLE FILES: this scan already matched 7 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/client/lib.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 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":"postgres/client/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"76901605a159b73f48068313411b31bf1105ede225c7d08a649576491eb439d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): postgres/parser/parser.rs:1558-1580 | postgres/parser/parser.rs:1606-1628 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"bded8fa64285b28e92c5f7e839495cd513bb5629bc70a83107a8f0ac3e8aef33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201323 lines \u00D7 2): testing/concurrent-simulator/properties.rs:781-801 | testing/concurrent-simulator/properties.rs:833-855 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/concurrent-simulator/properties.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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"0388b46763f39fab07fe91f1d469042ecab71fbc6f8848c1eca8a2484577119c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/create_index.rs:238-260 | testing/differential-oracle/sql_gen_prop/create_index.rs:336-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen_prop/create_index.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. 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":"testing/differential-oracle/sql_gen_prop/create_index.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f89d9de746260c706020db017d4f65c770e8e2fc4ce7024e3185208b5efc368"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 4): core/vdbe/execute.rs:7018-7039 | core/vdbe/execute.rs:7082-7103 | core/vdbe/execute.rs:7130-7151 | core/vdbe/execute.rs:7178-7199 \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 \u0060core/vdbe/execute.rs:7018\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":"core/vdbe/execute.rs"},"region":{"startLine":7018}}}],"partialFingerprints":{"codehealthFindingId/v1":"a73b9dd899629028ea46469ef6a2a187852d443de2ac2cbbfa7283a2e4b667b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): core/translate/alter.rs:1798-1819 | core/translate/alter.rs:2378-2399 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:1798\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"546cb35b289b5c00ff6fae8d512eab053bd1a9ae5d641dd6431f39d658235117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): core/translate/pragma.rs:1149-1170 | core/translate/pragma.rs:1188-1209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/pragma.rs:1149\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, \u0060core/translate/pragma.rs:1211\u0060 calls \u0060to_string\u0060, \u0060to_uppercase\u0060 and \u0060core/translate/pragma.rs:1171\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":"core/translate/pragma.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1483215cb27fd4cb3800319c495c94b58685a786848c6fd94b88aa611af5bc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): core/util.rs:565-581 | core/util.rs:688-709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/util.rs:565\u0060 it begins part-way through the construct above it, so those exact 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":"core/util.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf6694437e85cb767baf9b2565abafefc4f867b089fd6925f41a0d32df5e087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): testing/simulator/generation/property.rs:380-401 | testing/simulator/generation/property.rs:516-537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.rs:380\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":"testing/simulator/generation/property.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb4ee825ed9afa27dc935fae82b3cd5896139ecce90bcd28edb8b10be46ec1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): testing/sqltest/src/runner/mod.rs:1132-1153 | testing/sqltest/src/runner/mod.rs:1191-1212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/runner/mod.rs:1132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d119de5e0350ff1814e723d09dbfb822bdf36ee966ea2c7f95d9a63563317383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3): core/json/jsonb.rs:2794-2814 | core/json/jsonb.rs:2957-2977 | core/json/jsonb.rs:3126-3146 \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 \u0060core/json/jsonb.rs:2794\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":"core/json/jsonb.rs"},"region":{"startLine":2794}}}],"partialFingerprints":{"codehealthFindingId/v1":"035933090cf8d6afe75757326c92cd39c510fd2ac16447ed1169b82599310080"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:537-557 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:1024-1044 \u2014 both copies are in the same file, so extract the block 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, \u0060bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:559\u0060 calls \u0060TryGetSelectSource\u0060, \u0060GetTableColumns\u0060 and \u0060bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:1046\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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"37649779435cfb464f4db5f93321db3b81c695c6879da2c5dd548bddd2588011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:182-202 | core/incremental/vdbe_maintenance/set_op.rs:863-882 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/arrangement.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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bc3b2c07462be4fbd875e68718340a09e5bad12fbc5cb71e17dcfb733eb0ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): core/mvcc/database/mod.rs:5681-5701 | core/mvcc/database/mod.rs:5734-5753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:5681\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":5681}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8073bcec39c649029abfd5a79bb81fa616a08080e30e3c1a3e17ecda18102f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): core/translate/expr/binary.rs:760-780 | core/translate/expr/binary.rs:1067-1084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/binary.rs:760\u0060 it begins part-way through the construct above it, so those exact lines 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":"core/translate/expr/binary.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e2c5b25a8a12309524bcc59ed43939ae2257461db8c8072fb03ddcaf412166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): core/translate/fkeys.rs:1421-1441 | core/translate/fkeys.rs:1488-1508 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":1421}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0b8fa569d7fae510a996dda0dac680e8f1877217531680fade9595b1742dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): testing/concurrent-simulator/properties.rs:1708-1728 | testing/concurrent-simulator/properties.rs:1867-1887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/concurrent-simulator/properties.rs:1708\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":1708}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdc0dca5e3143f4a8c637e5775c23290fb4375863bfdcd237bd2f4a8655a4c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/create_index.rs:207-225 | testing/differential-oracle/sql_gen_prop/create_index.rs:299-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen_prop/create_index.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. 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":"testing/differential-oracle/sql_gen_prop/create_index.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d46be983e89f2eeac5493e192936ed650403fe35a0c33756600fa0ab92edb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): testing/sqltest/src/backends/cli.rs:113-135 | testing/sqltest/src/backends/js.rs:80-102 \u2014 before extracting anything, compare \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/js.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4d8d23a341d8bcf9be9008b0352396ace8608c53b343e6d01811cf1608963f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 6): core/json/mod.rs:363-382 | core/json/mod.rs:407-424 | core/json/ops.rs:154-170 | core/json/ops.rs:196-212 | core/json/ops.rs:238-255 | core/json/ops.rs:281-298 \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 \u0060core/json/mod.rs:363\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":"core/json/mod.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf921f2125ee406860e3c0c1d4977f77d4a66e141097fcae16c7c2fc42ba1be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): core/storage/btree.rs:8714-8733 | core/storage/btree.rs:8747-8766 | core/storage/btree.rs:8783-8802 \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 \u0060core/storage/btree.rs:8714\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":8714}}}],"partialFingerprints":{"codehealthFindingId/v1":"36eaefcbf4ae5c2ff14f4f6d31b25f9282c4a46795022f666f0326678b9d1fed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): core/storage/sqlite3_ondisk.rs:868-887 | core/storage/sqlite3_ondisk.rs:914-933 | core/storage/sqlite3_ondisk.rs:944-963 \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, \u0060core/storage/sqlite3_ondisk.rs:942\u0060 calls \u0060read_varint\u0060 and \u0060core/storage/sqlite3_ondisk.rs:913\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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"454c857c2c6645edd5a8ae89a299c0e84489fb779422f233d56245aa0ef08617"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): core/translate/emitter/mod.rs:1440-1458 | core/translate/emitter/mod.rs:1551-1569 | core/translate/emitter/mod.rs:1674-1693 \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":"core/translate/emitter/mod.rs"},"region":{"startLine":1440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df523af6a46d76cf0c6d01870acca05d55d33ae42c196e8c1c29070604ff882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 3): core/translate/sequence.rs:138-157 | core/translate/sequence.rs:288-305 | core/translate/sequence.rs:567-584 \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":"core/translate/sequence.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e75bf272fafaf9e1ba7ede84295d092511ddae4384507da581a57c5a5f9b6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs:352-369 | bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs:430-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"760400c7fad7bbff0497b7cfdf1e2d169d8fcb107578d02adf9e0c26640ecd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): core/attach.rs:40-59 | core/attach.rs:145-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 \u0060core/attach.rs:40\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/attach.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dbb7cb416187ccb09b9e1795213bb8474eb171ee47314f2a55afc21abaf5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): core/incremental/dag.rs:324-341 | core/incremental/dag.rs:362-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. 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":"core/incremental/dag.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a305de1d8e4beecc7c7f6c15c190bf75d03a6c48f7834935a741a49722ccac22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): core/incremental/vdbe_maintenance/members.rs:277-296 | core/incremental/vdbe_maintenance/sink.rs:208-227 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/members.rs\u0060 and \u0060core/incremental/vdbe_maintenance/sink.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 \u0060core/incremental/vdbe_maintenance/members.rs:277\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":"core/incremental/vdbe_maintenance/members.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d703344a9ea3262a7952e9b479aeeb07029608eabd4edff88ce7557637be6f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:520-539 | core/index_method/toy_vector_sparse_ivf.rs:783-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd5d1083939afd43922effebedd57db45892eae06625918e3b6ab25bced6648e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): core/mvcc/database/mod.rs:5435-5451 | core/mvcc/database/mod.rs:5513-5532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:5435\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":5435}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaecaba71955fff45c2b357537f88300a675bc6aaf90b34377669da7f95b9b6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): core/schema.rs:9032-9051 | core/translate/index.rs:1307-1326 \u2014 before extracting anything, compare \u0060core/schema.rs\u0060 and \u0060core/translate/index.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:9032\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 \u0060table\u0060 to \u0060\u0026Table\u0060 in one and \u0060\u0026BTreeTable\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":"core/schema.rs"},"region":{"startLine":9032}}}],"partialFingerprints":{"codehealthFindingId/v1":"171095b1c5d892432103ca78fbcaf17ed32628176bc978ab1ab0c206ae818f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): core/translate/alter.rs:1809-1828 | core/translate/alter.rs:2422-2441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:1809\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":1809}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fc4e190885c98e05a63f2f519442c356d1a3408a756e7f61ec3aac41b8bf70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): core/translate/alter.rs:4016-4035 | core/translate/alter.rs:4070-4089 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:4016\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":4016}}}],"partialFingerprints":{"codehealthFindingId/v1":"09418c23daf996d44322f37db2f84dd14b044d1fcf1b8999ad074c469ad6a8be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): core/translate/insert.rs:4159-4178 | core/translate/insert.rs:4274-4293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":4159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cacb40110dfa8ce06422613a71fb47c2ff09d5b8186e74892e8c3c17948c3bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): postgres/parser/translator.rs:2271-2290 | postgres/parser/translator.rs:2480-2499 \u2014 both copies are in the same file, so extract the block 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, \u0060postgres/parser/translator.rs:2292\u0060 calls \u0060translate_order_by\u0060 and \u0060postgres/parser/translator.rs:2501\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":"postgres/parser/translator.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc17e41f04cb0e74321c14c4a31143f9a26632d191ac02ae6da23f14076573ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): testing/sqltest/src/backends/cli.rs:303-322 | testing/sqltest/src/backends/js.rs:163-182 \u2014 before extracting anything, compare \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/js.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/backends/cli.rs:303\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44dfaed86a631569f964cd0556302ae9b8d6b10fd5bf1e62d37404cc412919a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): core/time/mod.rs:904-922 | core/time/mod.rs:931-949 | core/time/mod.rs:958-976 | core/time/mod.rs:985-1003 \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":"core/time/mod.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce8fc663fb0a0b01d77bde064ef6a036d0d4cd4fa416fc87390d58ac75f25a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (66 lines \u00D7 3): cli/read_state_machine.rs:132-197 | postgres/cli/read_state_machine.rs:167-232 | testing/sqltest/src/parser/sql_complete.rs:126-191 \u2014 before extracting anything, compare \u0060cli/read_state_machine.rs\u0060 and \u0060postgres/cli/read_state_machine.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/read_state_machine.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b377abb0f066c5cd21cac0ea41f6089645bc2c3c449ed6cd132e7aca4e35247c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): core/translate/view.rs:740-758 | core/translate/view.rs:828-846 | core/translate/view.rs:858-876 \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 \u0060core/translate/view.rs:740\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":"core/translate/view.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad704908ec3b6f4f53911063bdb58949c14a735d24653bdd9d7aff0d3a536c0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs:68-84 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs:110-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 \u0060bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs: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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cf753023f936d7bbe18f4492a75c65a82bdab86a997375a5af8ce82868a49d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/functions/printf.rs:543-561 | core/functions/printf.rs:1013-1031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/printf.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"4423e5cd454495cf4b129b93b726c1f9618bfe4f7bf28d835a2d982fb1b17881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/functions/printf.rs:750-768 | core/functions/printf.rs:781-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 \u0060core/functions/printf.rs:750\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/printf.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"0433c25217ba08ec97dec12f33c24a7db3a452008e089183e5562c25fe49dfd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:154-170 | core/incremental/vdbe_maintenance/set_op.rs:334-352 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 10 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 \u0060core/incremental/vdbe_maintenance/set_op.rs:334\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"273f511c1536097b1c1eb57d9cd5476d41eb0c6d9b715024c18be203d804ca66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/incremental/vdbe_maintenance/linear.rs:193-211 | core/incremental/vdbe_maintenance/set_op.rs:191-209 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/linear.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.rs:193\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f64a479eb20f990e6b3f3920631bddad1243a1b7ba6e87442ba3b55dc79a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/incremental/vdbe_maintenance/linear.rs:457-475 | core/incremental/vdbe_maintenance/source.rs:179-197 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/linear.rs\u0060 and \u0060core/incremental/vdbe_maintenance/source.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.rs:457\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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"adca8696603de6a49f93093e8a9fbbb7bb9059db1ffa04decb4aeae958b6f209"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/json/jsonb.rs:3449-3467 | core/json/jsonb.rs:3488-3506 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:3449\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":3449}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed80154c979430e84e9fc1c7a0ea0b90093f0b6fe07036b5438ceccfb6d5bef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/mvcc/cursor.rs:1486-1504 | core/mvcc/cursor.rs:1577-1595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/cursor.rs:1486\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":"core/mvcc/cursor.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"effc136b83873f9b892f3795a44fe3657fc8bcc61ea774bfe9d63344e236755d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): core/storage/wal.rs:4658-4672 | core/storage/wal.rs:4760-4778 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/wal.rs:4658\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":4658}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77b03ffc230f1c3618588c56aba95de240b35423d32596beb25ebbb659c9486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/translate/alter.rs:3996-4014 | core/translate/alter.rs:4050-4068 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:3996\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":3996}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a6dde065d10e528d9e3b837a993684f2401b820c3fc02af081c0203ef350a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): core/translate/emitter/delete.rs:406-423 | core/translate/fkeys.rs:1225-1243 \u2014 before extracting anything, compare \u0060core/translate/emitter/delete.rs\u0060 and \u0060core/translate/fkeys.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060core/translate/emitter/delete.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, \u0060core/translate/emitter/delete.rs:424\u0060 calls \u0060allocate_label\u0060 and \u0060core/translate/fkeys.rs:1244\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":"core/translate/emitter/delete.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad29fc8c3c3d235d1d745c3aa41d8d629b3b000301b05ec7fef5d2ae5330fb49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): core/translate/optimizer/constraints.rs:876-902 | core/translate/optimizer/constraints.rs:982-1008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/constraints.rs:876\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"df18a9847bae73e05f7ded4107d36bfdf70b35316d99e2fe9cc4402f826f6d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/translate/optimizer/constraints.rs:1133-1151 | core/translate/optimizer/constraints.rs:1236-1254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/constraints.rs:1133\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":"core/translate/optimizer/constraints.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"164dedfe30a42e0d1b356aef5ba53e37f2086fa5d653d832e6e055870ea9f1c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/translate/result_row.rs:234-252 | core/translate/values.rs:306-324 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/result_row.rs:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/result_row.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f69d2bd43003b046e075c70a7aa25bd1bd1eae3b63bf0303d03b65589108492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/translate/upsert.rs:271-289 | core/translate/upsert.rs:293-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":"core/translate/upsert.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe50f8f5134b47f00a2fed33097b551a1ef082315e8bc71c57b5115fd8b6ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/vdbe/execute.rs:17873-17891 | core/vdbe/execute.rs:17895-17913 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:17873\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":17873}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c38d6868dee755675d8f02f420b22e67fe554d1bd5124b41dae64ac707b8096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): postgres/client/lib.rs:95-113 | postgres/regress/main.rs:1483-1500 \u2014 before extracting anything, compare \u0060postgres/client/lib.rs\u0060 and \u0060postgres/regress/main.rs\u0060 as WHOLE FILES: this scan already matched 7 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/client/lib.rs:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"postgres/client/lib.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43ed0a5255f6f99661cdac064ef547df36bb07828b818e3eb6071f2b3e9bc5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): sqlite/parser/src/parser.rs:483-501 | sqlite/parser/src/parser.rs:635-653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/parser.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":"sqlite/parser/src/parser.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29f193a1130b160815bd567a8d98572e019707d844aabd51c5f985b66d9d1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): testing/simulator/runner/env.rs:906-924 | testing/simulator/runner/env.rs:943-957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/runner/env.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":"testing/simulator/runner/env.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"63af312665ab710d0760661bd327e96b6c57364c07387442d9d435560a9b6316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 4): core/functions/datetime.rs:887-904 | core/functions/datetime.rs:1117-1134 | core/functions/datetime.rs:1144-1161 | core/functions/datetime.rs:1320-1337 \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 \u0060core/functions/datetime.rs:887\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cee0022db53f7e79bf09f9a298f01b6d0716fe1e6686afa3c485c31a7a01b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): core/mvcc/cursor.rs:995-1012 | core/mvcc/cursor.rs:1083-1100 | core/mvcc/cursor.rs:1117-1134 \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 \u0060core/mvcc/cursor.rs:995\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":995}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb5e97fc28758ac13e556b36e7d5bbff5b3c0d9586c752cf0641a50c2ba8b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): core/translate/optimizer/constraints.rs:2445-2462 | core/translate/optimizer/constraints.rs:2477-2494 | core/translate/optimizer/constraints.rs:2524-2541 \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 \u0060core/translate/optimizer/constraints.rs:2445\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd809271c45ff5fc52092a39bb5e099e541ab30259d3df37d99417f8152a0a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): core/vector/vector_types.rs:121-138 | core/vector/vector_types.rs:148-165 | core/vector/vector_types.rs:198-215 \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":"core/vector/vector_types.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e69e86035b9942467c004f0c643b57d6f08ca44f6f0f8c3f276d3ffc50cfdec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): sync/engine/src/database_sync_operations.rs:1997-2014 | sync/engine/src/database_sync_operations.rs:2142-2159 | sync/engine/src/database_sync_operations.rs:2265-2282 \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 \u0060sync/engine/src/database_sync_operations.rs:1997\u0060 it does not close everything it opens, so those exact 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1997}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4163adaf38e1c276410ec23afea02cb84867c3cc6a82485ba0ec58c15b6b96b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/ext/mod.rs:173-190 | core/ext/mod.rs:241-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 \u0060core/ext/mod.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":"core/ext/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a5eef9bdd2e091c18328753902dd11ae7c377824fd1218e4fde9547cdb2238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/functions/string.rs:14-31 | core/functions/string.rs:58-75 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/string.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"186164038fecd0d66826c46fa71eea4e1bc8fe286dd4bd10252d57b9e647d416"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201318 lines \u00D7 2): core/incremental/vdbe_maintenance/set_op.rs:763-780 | core/incremental/vdbe_maintenance/set_op.rs:989-1003 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/set_op.rs:763\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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":763}}}],"partialFingerprints":{"codehealthFindingId/v1":"242f7a84b391a8564cde400bac78e8cb185a21046f5bba61c38fe0e5d95b5bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:644-661 | core/index_method/toy_vector_sparse_ivf.rs:944-961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:644\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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e478c361fed877a1d1579fccfa6e959fe6f1a7eb02414c63cb03f27ecab103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): core/json/jsonb.rs:1170-1187 | core/json/jsonb.rs:1216-1232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:1170\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbfebf72e6242bf8860633644396a49ba13ac002180339b1c129465ee029442"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): core/json/ops.rs:22-40 | core/json/ops.rs:50-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":"core/json/ops.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2693e8c4ae336275c19a32da4026f07665dc848150f6d11444942b8889ace4ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/storage/btree.rs:5065-5082 | core/storage/btree.rs:5084-5101 \u2014 both copies are in the same file, so extract the block 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":"core/storage/btree.rs"},"region":{"startLine":5065}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2f48699c28fa472a004981bbccd1cf339acfa08276e5d774a2c7109faf9827"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/storage/btree.rs:8475-8492 | core/storage/btree.rs:8547-8564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:8475\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":8475}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea5e53065c00406febcbfcc8e4fe4888d55dbc11be1c71683092f3a7b87a7f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): core/translate/emitter/update.rs:1387-1404 | core/translate/upsert.rs:807-823 \u2014 before extracting anything, compare \u0060core/translate/emitter/update.rs\u0060 and \u0060core/translate/upsert.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/emitter/update.rs:1387\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b2e7a09780dc7b428d01b2994fb3ac754169fc100e88df3100f8c85ffaf688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/translate/expr/binary.rs:799-816 | core/translate/expr/binary.rs:1106-1123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/binary.rs:799\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binary.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0310171dafd550f7dec94cd92062daad9f860c95aef1d2238836b1e0d2460fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): core/translate/expr/translator.rs:1806-1823 | core/translate/expr/translator.rs:2084-2100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/translator.rs:1806\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1806}}}],"partialFingerprints":{"codehealthFindingId/v1":"77064c372eca8b8746245931c18e9a343d73c67e3cb37e50f56f399703f105b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/translate/fkeys.rs:1342-1359 | core/translate/insert.rs:4209-4226 \u2014 before extracting anything, compare \u0060core/translate/fkeys.rs\u0060 and \u0060core/translate/insert.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/fkeys.rs:1342\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e094218e26973b133817f09240472179551f3339cea58760e702df6860933658"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): core/translate/insert.rs:2534-2551 | core/translate/schema.rs:1102-1118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/insert.rs:2534\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":"core/translate/insert.rs"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a05385a937060f314ae127f34bd9d0f04e3ab44df5f9597fc391657b20be56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/translate/plan.rs:3321-3338 | core/translate/plan.rs:3375-3392 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/plan.rs:3321\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/plan.rs"},"region":{"startLine":3321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b3137fcb32f30c77cdea86a31eb76cc27783a0b81a92f7a834c6ee66351e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): core/util.rs:3108-3125 | core/util.rs:3931-3948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":3108}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9c09db756970e889b57ec8e07ec4d2b70c8c64af5b070086e462e688e63bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): macros/src/ext/vfs_derive.rs:29-46 | macros/src/ext/vfs_derive.rs:54-71 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060macros/src/ext/vfs_derive.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":"macros/src/ext/vfs_derive.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee82bc52c5999a94deb8f4e660ffab6fb0a0a23cd55852384fa5a8ce7ed2eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): postgres/parser/parser.rs:278-295 | postgres/parser/parser.rs:315-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/parser.rs:278\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, \u0060postgres/parser/parser.rs:273\u0060 calls \u0060expect\u0060, \u0060parse_assignment_list\u0060 and \u0060postgres/parser/parser.rs:311\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":"postgres/parser/parser.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75478243a55eb3eeb631b8e7bc43802decb4f993a7a82ebd8bea23fa322aef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): sync/engine/src/database_sync_engine.rs:1051-1068 | sync/engine/src/database_sync_engine.rs:1098-1114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/engine/src/database_sync_engine.rs:1051\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"8314998b6658838b37434e2aedb5e3c9c5934c8bc2fb82faf45ddd8699ae63be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 9): testing/sqltest/src/generator/mod.rs:671-685 | testing/sqltest/src/generator/mod.rs:704-720 | testing/sqltest/src/generator/mod.rs:751-767 | testing/sqltest/src/generator/mod.rs:807-823 | testing/sqltest/src/generator/mod.rs:988-1002 | testing/sqltest/src/generator/mod.rs:1098-1114 | testing/sqltest/src/generator/mod.rs:1146-1162 | testing/sqltest/src/generator/mod.rs:1200-1216 | testing/sqltest/src/generator/mod.rs:1282-1298 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it 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 \u0060testing/sqltest/src/generator/mod.rs:704\u0060 it does not close everything it opens, so those exact lines 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":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c86bc273c43fc96e6c2a70a53a6037d5ae5d0f9f964e8d399822c44b5a64ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 3): core/storage/btree.rs:5670-5686 | core/storage/btree.rs:5748-5764 | core/storage/btree.rs:5788-5801 \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 \u0060core/storage/btree.rs:5670\u0060 it does not close everything it opens, so those exact lines 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":"core/storage/btree.rs"},"region":{"startLine":5670}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9db8a3275feaa0c4e710b9d1e681f383f01c13bcb136d9f58ac6307695848c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): core/translate/schema.rs:2607-2621 | core/translate/schema.rs:2740-2756 | core/translate/schema.rs:2818-2834 \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 \u0060core/translate/schema.rs:2607\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":2607}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee95e2fefc03a1dcfb9eada1020866292d4c95db4d411f0d59aaddd6082b742"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201317 lines \u00D7 3): core/translate/sequence.rs:767-777 | core/translate/sequence.rs:840-848 | core/translate/trigger.rs:596-612 \u2014 before extracting anything, compare \u0060core/translate/sequence.rs\u0060 and \u0060core/translate/trigger.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"core/translate/sequence.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"00afe715992ca3f85635b6a2aca5d5d464c460de8b97f82c0ca5608d59477434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201317 lines \u00D7 3): core/translate/sequence.rs:1163-1171 | core/translate/trigger.rs:597-613 | core/translate/view.rs:714-726 \u2014 before extracting anything, compare \u0060core/translate/sequence.rs\u0060 and \u0060core/translate/trigger.rs\u0060 as WHOLE FILES: this scan already matched 4 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/translate/sequence.rs:1172\u0060 calls \u0060emit_column_or_rowid\u0060, \u0060allocate_label\u0060 and \u0060core/translate/trigger.rs:614\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":"core/translate/sequence.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"987229767cb0ffff79df1e6691307206bcaab84831d78577fb547f3c9586d009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 3): core/util.rs:546-562 | core/util.rs:657-672 | core/util.rs:829-845 \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 \u0060core/util.rs:546\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9808638c39a4b94e9f0238dec31553c5e73666fd7173ba1bc2fd2af1f539e491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): core/attach.rs:62-77 | core/attach.rs:165-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 \u0060core/attach.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":"core/attach.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fc484dd27703ae34f0def570ddd8ec3a8123edf150716124092ffa5c555682f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/functions/datetime.rs:1186-1202 | core/functions/datetime.rs:1221-1237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"e18e8406e49907450eaa973c8723da02d81d8c5651e0b69e5a861dc790d6f2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:170-186 | core/incremental/vdbe_maintenance/join.rs:782-798 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f110def8099c7e4a5ba6a8b4b09363209dc2550c378acca6cf4df8b64661f20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:387-403 | core/incremental/vdbe_maintenance/aggregate.rs:1084-1100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"8408965ae30209c6f72797166026deedf9d17933f54c27d926d24d25e07f3330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:288-304 | core/incremental/vdbe_maintenance/join.rs:1191-1207 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 and \u0060core/incremental/vdbe_maintenance/join.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/arrangement.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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40df48590b96728a7c54093b984d56c8178efe38544a594553485842cfe3948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/mvcc/cursor.rs:1372-1388 | core/mvcc/cursor.rs:2272-2288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/cursor.rs:1372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b71a52432f838b6bf5416c4b3abc59a2dedb59b8a5cdc0bb91ceaf4b160c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): core/mvcc/database/checkpoint_state_machine.rs:2288-2303 | core/mvcc/database/checkpoint_state_machine.rs:2372-2388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/checkpoint_state_machine.rs:2372\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2288}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb28f6985b78cd6e4f3587a9346163e5fea6521f658a9318e548f789717940c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201317 lines \u00D7 2): core/mvcc/database/mod.rs:6523-6533 | core/mvcc/database/mod.rs:6759-6775 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:6523\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":6523}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e18952a6ade8d9e2da8832d0f872bbe63f55b4f9d7c5f3c7d5ace543262348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201317 lines \u00D7 2): core/storage/encryption.rs:740-752 | core/storage/encryption.rs:834-850 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/encryption.rs:740\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/storage/encryption.rs:832\u0060 calls \u0060starts_with\u0060 and \u0060core/storage/encryption.rs:739\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":"core/storage/encryption.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"e688bc5b7d8378d45090b849c092c57d47aa9f46379d27c169f3e15d59aa4585"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): core/translate/alter.rs:1677-1693 | core/translate/alter.rs:3216-3231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:1677\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":1677}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0c0d581101be44eb7c57fccc5bacb52cf321c6bd97bef46950212d5ad95160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/analyze.rs:222-238 | core/translate/trigger.rs:258-274 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/analyze.rs:222\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/analyze.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"334dad87571b646ff618aa85043f3588a39bafa53b1ccaa914adf132a6974f27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): core/translate/analyze.rs:333-348 | core/translate/analyze.rs:350-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 \u0060core/translate/analyze.rs:350\u0060 it begins part-way through the construct above it, so those exact lines 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":"core/translate/analyze.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"990b41a133b752b7669cb0aaee37ebe7f5e7a8387e9c925984eb3b69856a53a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): core/translate/emitter/delete.rs:578-594 | core/translate/emitter/delete.rs:964-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 \u0060core/translate/emitter/delete.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":"core/translate/emitter/delete.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e268dd9a55e25ff53cac6f2f62ae791550e012d39414bbbf0c64913f4e8c277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): core/translate/emitter/delete.rs:769-784 | core/translate/insert.rs:3983-3999 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/translate/emitter/delete.rs:769\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33729fbc2e5bc8979acba3efbb6c73d45a2be918cb74c22f5c58f74cf486179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/emitter/mod.rs:1520-1536 | core/translate/emitter/mod.rs:1648-1664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/emitter/mod.rs:1520\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce14489c064430f865f0fd31fd5c249237374e7ecc3ce69df8dd093576d6f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/emitter/mod.rs:2241-2257 | core/translate/upsert.rs:1900-1916 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/translate/emitter/mod.rs:2241\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":2241}}}],"partialFingerprints":{"codehealthFindingId/v1":"55755b9b5661cf40ca820a7e7189d091795973b81c6b287922c9328ae71466d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/emitter/update.rs:1524-1540 | core/translate/upsert.rs:1042-1058 \u2014 before extracting anything, compare \u0060core/translate/emitter/update.rs\u0060 and \u0060core/translate/upsert.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/emitter/update.rs:1524\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b572322f7ba37d10aee43d9113f3dab90a5effb93e552fa1046fe7e260d008"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/expr/walk.rs:131-147 | core/translate/expr/walk.rs:490-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 \u0060core/translate/expr/walk.rs:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/walk.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf6952790decf3db763768f34ca37a1aa64ffee4ba6032c0a146bbeb2f2c26a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/optimizer/mod.rs:4710-4726 | core/translate/optimizer/mod.rs:4765-4781 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/mod.rs:4710\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":4710}}}],"partialFingerprints":{"codehealthFindingId/v1":"250105a6dfd0d9a16b0e71e7dd3a96870be15ce1edb74cacaecfcf6d83338d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/optimizer/mod.rs:4831-4847 | core/translate/optimizer/mod.rs:4886-4902 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/mod.rs:4831\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":4831}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ade9d585ec6b5c6602597b8d232200f29c34e16b0bef1f94a81c71db070467f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/planner.rs:621-637 | core/translate/planner.rs:708-724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/planner.rs:621\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":"core/translate/planner.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f60ff85b5b2080ecf6b71f24e4016045fa1d985e56a88a215a6b3f4d035ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 2): core/translate/schema.rs:2271-2287 | core/translate/schema.rs:2737-2748 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/schema.rs:2271\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":"core/translate/schema.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbbb92dad963eb60caaa829dbb74b01fe58a9ced2a87bc4e6773d0f5cb6fbea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/window.rs:3361-3377 | core/translate/window.rs:3498-3514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/window.rs:3361\u0060 it does not close everything it opens, so those exact 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, \u0060core/translate/window.rs:3360\u0060 calls \u0060Agg\u0060 and \u0060core/translate/window.rs:3492\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":"core/translate/window.rs"},"region":{"startLine":3361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3fc5bc3b11c576d620e3f269d434bde81c5430044880474262bc4b352fc78eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sqlite/parser/src/lexer.rs:423-439 | sqlite/parser/src/lexer.rs:461-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 \u0060sqlite/parser/src/lexer.rs:423\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/lexer.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"6389da363a89c11b60d8542334bdfb58ffedffca7cf6498c3fe983f28e2a3f4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sync/engine/src/database_sync_engine.rs:1971-1987 | sync/engine/src/database_sync_engine.rs:2273-2289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/engine/src/database_sync_engine.rs:1971\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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"902ceb01f4d4ccc260dc99d809decb0b39428029d6b82bf8a1d99597fb558e5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): sync/engine/src/database_sync_operations.rs:234-250 | sync/engine/src/database_sync_operations.rs:535-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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eb76052829acbf9f68a013c48a7117debf7316debde889c7238b7f21e2bc9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): testing/differential-oracle/sql_gen/src/generate/select.rs:551-567 | testing/differential-oracle/sql_gen/src/generate/select.rs:832-848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9026392ea15fafec3c56d46a946b4037ea66df53f1b6634190272934c1b5c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): testing/differential-oracle/sql_gen/src/schema.rs:108-124 | testing/differential-oracle/sql_gen_prop/schema.rs:90-106 \u2014 before extracting anything, compare \u0060testing/differential-oracle/sql_gen/src/schema.rs\u0060 and \u0060testing/differential-oracle/sql_gen_prop/schema.rs\u0060 as WHOLE FILES: this scan already matched 6 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, \u0060testing/differential-oracle/sql_gen_prop/schema.rs:108\u0060 calls \u0060Some\u0060 and \u0060testing/differential-oracle/sql_gen/src/schema.rs:126\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/schema.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb0e66a599b9ae820d0aa25c8a34007d6d0fc16e3b1ab2526c66b2125abae50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): testing/sqltest/src/parser/mod.rs:824-840 | testing/sqltest/src/parser/mod.rs:856-872 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/parser/mod.rs:824\u0060 it does not close everything it opens, so those exact 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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"03577068d8b9f4bd7c30295f1476ebabd47e240e61161ffb915a880da27b41c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): core/json/jsonb.rs:352-367 | core/json/jsonb.rs:431-445 | core/json/jsonb.rs:517-532 | core/json/jsonb.rs:598-613 \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 \u0060core/json/jsonb.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. 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":"core/json/jsonb.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1fb220d1591452c500335bec7f687fc8e6a186ac49a66310e35096b19b5b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): core/json/jsonb.rs:375-390 | core/json/jsonb.rs:454-468 | core/json/jsonb.rs:540-555 | core/json/jsonb.rs:621-636 \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":"core/json/jsonb.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"021a4bdf1cb920d6c2a948de2719e34f82df7cdff590e1cb8284a691eff56860"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): cli/read_state_machine.rs:57-72 | postgres/cli/read_state_machine.rs:57-72 | testing/sqltest/src/parser/sql_complete.rs:59-74 \u2014 before extracting anything, compare \u0060cli/read_state_machine.rs\u0060 and \u0060postgres/cli/read_state_machine.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/read_state_machine.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a080d2a3d704740985efee0ee6a53c0d6818be130afde7f02382648a7dfd98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): core/incremental/vdbe_maintenance/linear.rs:194-209 | core/incremental/vdbe_maintenance/linear.rs:467-482 | core/incremental/vdbe_maintenance/set_op.rs:192-207 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/linear.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.rs:194\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, \u0060core/incremental/vdbe_maintenance/linear.rs:483\u0060 calls \u0060drop\u0060 and \u0060core/incremental/vdbe_maintenance/linear.rs:210\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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6101142c777e51e852d62360054e81c1cb31bbc9837bb3995c0852b20f4506e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): core/vdbe/execute.rs:13425-13440 | core/vdbe/execute.rs:13459-13472 | core/vdbe/execute.rs:13491-13504 \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 \u0060core/vdbe/execute.rs:13425\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":13425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c1a15d43e92f4c3e28f33ff7451c60ac5e018d52edcdb5188c6354a12e37cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): core/vdbe/mod.rs:2363-2377 | core/vdbe/mod.rs:2461-2476 | core/vdbe/mod.rs:2512-2526 \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":"core/vdbe/mod.rs"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"36996b7607bc1d3fbf322dfe3179a0315358f69f4255e924e6e882132151e346"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): testing/simulator/generation/property.rs:876-891 | testing/simulator/generation/property.rs:952-967 | testing/simulator/generation/property.rs:1032-1047 \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 \u0060testing/simulator/generation/property.rs:876\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"99edfe64bc73cb0e267051503921c3486063e722eec0ead90d0ed4d99958a1ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs:102-117 | bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs:201-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs: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. 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":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3fc156484913936ed462410d49461048f17306940c7feb243659a6ef508692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): cli/commands/import.rs:195-210 | cli/commands/import.rs:226-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/commands/import.rs:195\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/commands/import.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"1594a940c9c91505711cc6068bf1a9f1b401dcb96582fe2e663d205f33f4afa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): core/functions/printf.rs:520-533 | core/functions/printf.rs:990-1005 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/printf.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bba978399cc0c727d4d5a81f636d0b5e2b672af52cc66657aeecdc1ce061cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:702-717 | core/incremental/vdbe_maintenance/aggregate.rs:899-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.rs:702\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"3231f5e15accec8424303ce382c1ec99c3e1576f1e95d3136aef8d0019f0c6d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): core/io/unix.rs:368-383 | core/io/windows.rs:344-358 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/io/unix.rs:368\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/unix.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad90b13c213b83af1aa9cd6ad6ef3200b4b7ba18d95700515912d87042c2fa94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/json/ops.rs:86-101 | core/json/ops.rs:121-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/ops.rs:86\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":"core/json/ops.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5151ab9621dd89a9b883c667c67ce5738b786dbe0d975646ffb1c7dd50d026fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): core/mvcc/database/mod.rs:10338-10352 | core/mvcc/database/mod.rs:10458-10473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":10338}}}],"partialFingerprints":{"codehealthFindingId/v1":"4263a10cf2ec9d846edf3d7b94617c448dbd25292d203516b1ecf9f6ec11f2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): core/storage/btree.rs:2102-2115 | core/storage/btree.rs:2346-2361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:2102\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"11829503ba279b185adaa0327aa174ab1194a9ef09bc1fd5b8111c3b12aff385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): core/storage/btree.rs:7569-7583 | core/storage/btree.rs:7593-7608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:7593\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":7569}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65bf18f15abacf16bc1c8eabccf6eb0be51e0d684f9fc1d7e0b6d5dd8d46204"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/time/mod.rs:711-726 | core/time/mod.rs:880-895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/time/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df6f2b4398aff3e659386703b9eaecdd24b2df0fc48fa543af215389de51eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/compound_select.rs:85-100 | core/translate/compound_select.rs:1016-1031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/compound_select.rs:85\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/compound_select.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdedfa0755b7840a7e5c394c56f7bafbaefbf35cd150ab8718b707283b56eec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/display.rs:116-131 | core/translate/display.rs:354-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/display.rs:116\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/display.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03d0427bac56900b85aa19af8de932f439b6d66176eb9f8600310ea3ccf5339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/expr/binary.rs:352-367 | core/translate/expr/translator.rs:534-549 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"core/translate/expr/binary.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1be3378486aed5032355e0343b753aca15c7990a04df08e2185996a416fb2dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/expr/binary.rs:782-797 | core/translate/expr/binary.rs:1088-1103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/binary.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/translate/expr/binary.rs:1104\u0060 calls \u0060eval_result\u0060 and \u0060core/translate/expr/binary.rs:798\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":"core/translate/expr/binary.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9d219d82b248da3b586fdc53acec52db5beddf4b1d946e20469e68d4c52f64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/group_by.rs:810-825 | core/translate/group_by.rs:868-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 \u0060core/translate/group_by.rs:810\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/group_by.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc18b7dd5b20cbd179a530d47e59eb4b635449421cae55096af1dc20848a942f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/index.rs:1547-1562 | core/translate/schema.rs:3571-3586 \u2014 before extracting anything, compare \u0060core/translate/index.rs\u0060 and \u0060core/translate/schema.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/index.rs:1547\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":"core/translate/index.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"834dc78af25d0cb982fdf3f2f2fdf3c147e3b6fbe379a3fd08c6f47d7ead2129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/insert.rs:1473-1488 | core/translate/insert.rs:3675-3690 \u2014 both copies are in the same file, so extract the block 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, \u0060core/translate/insert.rs:1489\u0060 calls \u0060alloc_register\u0060 and \u0060core/translate/insert.rs:3691\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":"core/translate/insert.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb0d7daf454c6a8254b23f012ece4b32c81ee0b4e83a5d089aa85af4544ca68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/main_loop/in_seek.rs:51-66 | core/translate/main_loop/multi_index.rs:276-291 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"core/translate/main_loop/in_seek.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f9436eb5f4088050703a483558700a7986734e905d8a009e30a465a14489a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/optimizer/mod.rs:4775-4790 | core/translate/optimizer/mod.rs:4896-4911 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/mod.rs:4775\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":4775}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b948f186ffa2aad832c54e386ec1bc8200d74e2972d03477516f6fb1b867000"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): core/translate/schema.rs:2267-2282 | core/translate/schema.rs:2650-2663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/schema.rs:2267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"45887684e3ab570b9c0e90feae66e4576df4ce524af1c58417d6c61749ac5b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/view.rs:76-92 | core/translate/view.rs:393-409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"core/translate/view.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae17ddf5b67c2adfe650b2a5db837eac8110a6a212470b921b30ee064007cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/translate/view.rs:229-244 | core/translate/view.rs:465-480 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/view.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":"core/translate/view.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"66efffd167fc9ac780a304d250929d87d223f01efb646f44f7cca05eae2fe989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201316 lines \u00D7 2): core/translate/window.rs:2233-2241 | core/translate/window.rs:3309-3324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/window.rs:2233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":2233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa244559fab40281beae4c888e2d3d4e95f7b75fe0bf15b732f2f95cec87a5f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/types.rs:2967-2982 | core/types.rs:3062-3077 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/types.rs"},"region":{"startLine":2967}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bb4569e48806e675f6d1fe05b0229f60d81e5888267dc5c7baab3448e1f59e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): core/util.rs:3621-3636 | core/util.rs:3648-3663 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/util.rs:3621\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"f982b6c0e63702258ecdba5eaecd93354b97aa521f53a09ac8c85de4aa83f8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): core/vdbe/hash_table.rs:2318-2332 | core/vdbe/hash_table.rs:2357-2372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:2318\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":2318}}}],"partialFingerprints":{"codehealthFindingId/v1":"635c92bfca9a256893ac4feed249f5cab60635694c0d549330abdbfb272221ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): postgres/cli/main.rs:187-202 | postgres/cli/main.rs:557-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 \u0060postgres/cli/main.rs:187\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/cli/main.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff5187a10f3d0a2aeafc4e4a4900bcb50e290f72d61ea042f728585dfac9e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): sync/engine/src/server_proto.rs:387-402 | sync/engine/src/server_proto.rs:510-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 \u0060sync/engine/src/server_proto.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":"sync/engine/src/server_proto.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c9717532f650a3d687d456bd5cc96ded4f2f905cb74148f6b600b0de94333a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/concurrent-simulator/properties.rs:660-675 | testing/concurrent-simulator/properties.rs:699-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/concurrent-simulator/properties.rs:660\u0060 it does not close everything it opens, so those exact 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, \u0060testing/concurrent-simulator/properties.rs:678\u0060 calls \u0060is_ok\u0060 and \u0060testing/concurrent-simulator/properties.rs:717\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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":660}}}],"partialFingerprints":{"codehealthFindingId/v1":"96c4510f11588136039214b096a5413662326be8afb96720cb242658a8b1a613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/concurrent-simulator/properties.rs:805-820 | testing/concurrent-simulator/properties.rs:860-875 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/concurrent-simulator/properties.rs:805\u0060 it begins part-way through the construct above it, so those exact 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, \u0060testing/concurrent-simulator/properties.rs:877\u0060 calls \u0060export\u0060 and \u0060testing/concurrent-simulator/properties.rs:822\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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c19bc17f8abc0798d1e43546eebd549eb7b6488b32fbf3d7e529aba8a4aaba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/differential-oracle/sql_gen/src/generate/expr.rs:350-365 | testing/differential-oracle/sql_gen/src/generate/expr.rs:483-498 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen/src/generate/expr.rs:350\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/expr.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9174fb127158444e3b9197c8b834c6118feae1fee0585ee482d9a1e31729a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/expression.rs:1397-1412 | testing/differential-oracle/sql_gen_prop/expression.rs:1446-1461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen_prop/expression.rs:1397\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen_prop/expression.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"538f8c477836954f2333b1e19544d03a45a41128aa11477d59baeae71bbd562d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/simulator/generation/property.rs:147-162 | testing/simulator/generation/property.rs:215-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 \u0060testing/simulator/generation/property.rs:147\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2590eeb6283a8720591f95da93a8285c82a319245eaea24ab65280b2dc1c3c7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/sqltest/src/backends/cli.rs:374-389 | testing/sqltest/src/backends/js.rs:226-241 \u2014 before extracting anything, compare \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/js.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"20927b0bea16b0e7c3609e3570202730eb0cef46b94fe9836c4bd9ef2e4c86d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/sqltest/src/backends/cli.rs:392-407 | testing/sqltest/src/backends/js.rs:244-259 \u2014 before extracting anything, compare \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/js.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e10fcc8a888a702fd418f22b56a8b7c62cc8c7eb7786536eef2dc0d84b2f04a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/sqltest/src/runner/mod.rs:1034-1049 | testing/sqltest/src/runner/mod.rs:1115-1130 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"6737439af98dd878e69eb88f13a28f2d58126700ba4d8b95e56e96aaff91d34b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 6): cli/read_state_machine.rs:150-164 | cli/read_state_machine.rs:175-189 | postgres/cli/read_state_machine.rs:185-199 | postgres/cli/read_state_machine.rs:210-224 | testing/sqltest/src/parser/sql_complete.rs:144-158 | testing/sqltest/src/parser/sql_complete.rs:169-183 \u2014 before extracting anything, compare \u0060cli/read_state_machine.rs\u0060 and \u0060postgres/cli/read_state_machine.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/read_state_machine.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ce7f0e94e47505344d9a4a6af0e50f4141c55cc9b848709cb6031c3a557f19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): core/incremental/vdbe_maintenance/aggregate.rs:396-410 | core/incremental/vdbe_maintenance/aggregate.rs:767-781 | core/incremental/vdbe_maintenance/aggregate.rs:1093-1107 | core/incremental/vdbe_maintenance/arrangement.rs:315-329 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.rs:396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/incremental/vdbe_maintenance/arrangement.rs:331\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/aggregate.rs:411\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4e67f15542e3f1bcf64f9b605720982ca5a507cf1144bd89f9fca39b8e05df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/incremental/vdbe_maintenance/set_op.rs:761-775 | core/incremental/vdbe_maintenance/set_op.rs:889-903 | core/incremental/vdbe_maintenance/set_op.rs:987-1001 \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 \u0060core/incremental/vdbe_maintenance/set_op.rs:761\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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a66ffd98accc9f77bdc89e2d99227ae6d9f1708dd3b467440e3d7497dfa6f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): core/translate/insert.rs:1562-1576 | core/translate/insert.rs:3310-3324 | core/translate/insert.rs:3466-3480 \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":"core/translate/insert.rs"},"region":{"startLine":1562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3067e110ed00a28ac99a617b81c326c02a2ab83c0ad13441e9328f47cb26e4d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): core/translate/pragma.rs:1266-1280 | core/translate/pragma.rs:1432-1445 | core/translate/pragma.rs:1497-1510 \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 \u0060core/translate/pragma.rs:1266\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, \u0060core/translate/pragma.rs:1447\u0060 calls \u0060normalize_table_pragma_lookup_name\u0060 and \u0060core/translate/pragma.rs:1281\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":"core/translate/pragma.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8073bae16026d0d9632dc6b289e5f32993d4a1a59ad148b2c141a6ac437e3add"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): core/connection.rs:1410-1424 | core/connection.rs:1466-1478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":1410}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6f880e4484a7529e4cbef2e197694ae016cb77b54fcf3130bce30c05237984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:361-375 | core/incremental/vdbe_maintenance/set_op.rs:519-532 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 10 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/incremental/vdbe_maintenance/aggregate.rs:376\u0060 calls \u0060emit_int\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs:533\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"725a2a8aabc73d157bb16deacc184440f7bfbf03a500b98f35e04da0df2f2288"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:737-751 | core/incremental/vdbe_maintenance/set_op.rs:707-720 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 10 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 \u0060core/incremental/vdbe_maintenance/aggregate.rs:737\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed0442fbbb526b5ded47e5e649e0c7a26131b10940f1910c5d67bca2dc09f1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/incremental/vdbe_maintenance/set_op.rs:545-559 | core/incremental/vdbe_maintenance/set_op.rs:736-750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/set_op.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/incremental/vdbe_maintenance/set_op.rs:751\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs:561\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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e975f0df5ce9703eb6d24affe0e27e71ea276eedd276df7629f9fe1a99662f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/incremental/vdbe_maintenance/stream.rs:267-281 | core/incremental/vdbe_maintenance/stream.rs:341-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 \u0060core/incremental/vdbe_maintenance/stream.rs:267\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/stream.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"400e01c9b536d5df4370119cd812b06fe11b88d3043932221d19a8e5132ff982"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): core/io/win_iocp.rs:1009-1023 | core/io/win_iocp.rs:1084-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 \u0060core/io/win_iocp.rs:1009\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/win_iocp.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"36117fbf2eb185589df72396f5e19dab866911b0b0114f16ee79067efa3385e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/json/jsonb.rs:1726-1740 | core/json/jsonb.rs:1790-1804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:1726\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f2fc1ccb41581dcc458063243e391b6532be497057f3d3e5bcfba0224eb3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/mvcc/database/checkpoint_state_machine.rs:3168-3182 | core/mvcc/database/checkpoint_state_machine.rs:3192-3206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/checkpoint_state_machine.rs:3168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":3168}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb34f09e8119e1a4f13871f87fd6e97b3bdcd8a3bebc443627ffbef6b09e1de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): core/schema.rs:9015-9027 | core/translate/index.rs:1289-1303 \u2014 before extracting anything, compare \u0060core/schema.rs\u0060 and \u0060core/translate/index.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:9015\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":9015}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c94282326b92b58fd0801091039175d5c739bb57b5954ab740dfbeebaf7499"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): core/storage/wal.rs:1070-1084 | core/storage/wal.rs:2133-2145 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/wal.rs:1070\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcc0952985097ab38ed36fa8aad2dc076935509ea0eaf328ec45484bdf905f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/storage/wal.rs:2231-2245 | core/storage/wal.rs:2261-2275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/wal.rs:2261\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060core/storage/wal.rs:2228\u0060 calls \u0060Ok\u0060 and \u0060core/storage/wal.rs:2260\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":"core/storage/wal.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"75cf53df033a7886db04345d62cf55948ca18957142a2890468a114e3733e786"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): core/translate/analyze.rs:659-673 | core/translate/sequence.rs:882-894 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/analyze.rs:659\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":"core/translate/analyze.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"e266142bed8d48947fbeeaf688fde20a5e6c71511bbf889f338139919daa5241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/translate/display.rs:686-700 | core/translate/display.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":"core/translate/display.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba2d3c95b7c8f2f845cfba573df4069780c1b8a458e0ca673be53ad50797fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/translate/emitter/delete.rs:607-621 | core/translate/emitter/delete.rs:785-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d640d14d12739f15a5707916627c63671e207c30409437a62e6ba51791b4184b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/translate/expr/binding.rs:809-823 | core/translate/expr/binding.rs:861-875 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binding.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"2575b99e2f118fdc15e7441c17307fad0657b966575cdd3bc11f9b10ad8a0c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/translate/index.rs:1617-1631 | core/translate/schema.rs:2344-2358 \u2014 before extracting anything, compare \u0060core/translate/index.rs\u0060 and \u0060core/translate/schema.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/index.rs:1617\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":"core/translate/index.rs"},"region":{"startLine":1617}}}],"partialFingerprints":{"codehealthFindingId/v1":"d474b7f3cfcab31434813e4942e7976a74704c3693d976e738481200d8455351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): core/translate/insert.rs:2538-2552 | core/translate/sequence.rs:891-903 \u2014 before extracting anything, compare \u0060core/translate/insert.rs\u0060 and \u0060core/translate/sequence.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 \u0060core/translate/insert.rs:2538\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5335fed583ae5a292ff93160e3c939e775fd3f0fe927fc909964ab3e43bc477"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/translate/insert.rs:3397-3411 | core/translate/insert.rs:3445-3459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":3397}}}],"partialFingerprints":{"codehealthFindingId/v1":"476d340fd8bb3c60fa4b9edbff646554d07a4c9b05f63968be7df921f5a0b0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/translate/optimizer/access_method.rs:2124-2138 | core/translate/optimizer/access_method.rs:2142-2156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/access_method.rs:2124\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/access_method.rs"},"region":{"startLine":2124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6bb4f7916b7a98d28aeb7eb825c0eda2b623e8df03a9b6dff9729932d80047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/translate/optimizer/mod.rs:4684-4698 | core/translate/optimizer/mod.rs:4739-4753 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/mod.rs:4684\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":4684}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c74a4d041553f8783878cb3e4c04d60487c3c35b4ca48801bcbdc60bd616a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/vdbe/execute.rs:2846-2860 | core/vdbe/execute.rs:3176-3190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:2846\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":"core/vdbe/execute.rs"},"region":{"startLine":2846}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd13396eda5c48f0cd352b026566fef0fec1ddcd90b4f604ef89d8b4009b7745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/vector/operations/distance_cos.rs:98-112 | core/vector/operations/distance_cos.rs:143-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. 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 \u0060v1\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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"8606ad8dbe69056265a3faadcc697a839ad03b2f5c88ea54b02b16f8861d12c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): serverless/rust/differential/lib.rs:353-367 | serverless/rust/differential/lib.rs:572-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/rust/differential/lib.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdbae43244bd9c585c7ec3a7488d304de43eb42128a87a2a9ebdeca2c6e68c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sqlite/parser/src/ast/fmt.rs:422-436 | sqlite/parser/src/ast/fmt.rs:445-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 \u0060sqlite/parser/src/ast/fmt.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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"384ff80bb92459ef5d98918c8faad1ab3b4cb01e90eb62139517d84a6fabdeb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sqlite/parser/src/parser.rs:1534-1548 | sqlite/parser/src/parser.rs:1560-1574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"50be4fc7b558466f0ea7f219efc640c065e67760d9b191f5c88572d5eef8bf6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sync/engine/src/types.rs:373-387 | sync/engine/src/types.rs:416-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 \u0060sync/engine/src/types.rs:373\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/types.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61440b13cea62a4ea36616fc98ce12b209dbc69a3a3b67967c2f09de1ae893d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): sync/sdk-kit/src/rsapi.rs:302-316 | sync/sdk-kit/src/rsapi.rs:357-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 \u0060sync/sdk-kit/src/rsapi.rs:302\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/sdk-kit/src/rsapi.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"441908e4c1a1b5e0296d3de5099cc11ca801cfec1e52d8bc920a39d4a289ca9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): testing/simulator/generation/property.rs:786-800 | testing/simulator/generation/property.rs:1011-1025 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.rs:786\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d3260decf4edb7241f22441d968bc04be27e47c860eb3a348db6ea04d6b66b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): testing/sqltest/src/generator/mod.rs:553-567 | testing/sqltest/src/generator/mod.rs:1038-1052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f2d30f40f46b83115b9e86005344a2d549222d431d06695d76a07bd875d787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): testing/sqltest/src/parser/mod.rs:893-905 | testing/sqltest/src/parser/mod.rs:910-924 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/parser/mod.rs:893\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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b644f0d855377dbea226e6303d70479b7950e52c29a5cc501377b51392729c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 6): core/translate/emitter/mod.rs:1517-1530 | core/translate/emitter/mod.rs:1645-1658 | core/translate/emitter/mod.rs:1728-1741 | core/translate/schema.rs:1821-1832 | core/translate/schema.rs:1902-1914 | core/translate/schema.rs:3016-3027 \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 \u0060core/translate/emitter/mod.rs:1517\u0060 it does not close everything it opens, so those exact lines 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, \u0060core/translate/schema.rs:3014\u0060 calls \u0060emit_string8_new_reg\u0060, \u0060clone\u0060 and \u0060core/translate/emitter/mod.rs:1515\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":"core/translate/emitter/mod.rs"},"region":{"startLine":1517}}}],"partialFingerprints":{"codehealthFindingId/v1":"595a9fd10bb2fdbe9ad2d3d51aa258c90e4fdef53551e5ecd97948e0b64cb208"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): core/translate/emitter/delete.rs:605-617 | core/translate/emitter/delete.rs:783-795 | core/translate/emitter/update.rs:736-749 | core/translate/emitter/update.rs:2335-2347 \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":"core/translate/emitter/delete.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1b603876a194cf29d10d5315c663ed50cfdacb2052960e9b48d207ca6933c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 4): testing/simulator/runner/env.rs:1674-1687 | testing/simulator/runner/env.rs:1692-1702 | testing/simulator/runner/env.rs:1846-1859 | testing/simulator/runner/env.rs:1864-1874 \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":"testing/simulator/runner/env.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab9dbd17e92b3228925e42248989b80d0d6af7632924eb8c36da04e400195f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/incremental/vdbe_maintenance/aggregate.rs:706-719 | core/incremental/vdbe_maintenance/aggregate.rs:903-916 | core/incremental/vdbe_maintenance/join.rs:1196-1209 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.rs:706\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6b81a01a660c325f95c6bed113ca07a9b7810e6e9a09352b1591b175d97a4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): core/incremental/vdbe_maintenance/arrangement.rs:182-195 | core/incremental/vdbe_maintenance/set_op.rs:524-537 | core/incremental/vdbe_maintenance/set_op.rs:863-875 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/arrangement.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/incremental/vdbe_maintenance/set_op.rs:539\u0060 calls \u0060emit_int\u0060 and \u0060core/incremental/vdbe_maintenance/arrangement.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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"910c3483d557e42df80e8603cf75f486ddc13b75924a6ecd1b754881168c7cc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/json/jsonb.rs:2756-2769 | core/json/jsonb.rs:2924-2937 | core/json/jsonb.rs:3093-3106 \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 \u0060core/json/jsonb.rs:2756\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6952289b2d2d9f5d2a5445c3fae6ae8456f219772b46a9c0f8a532d68e76683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): core/time/mod.rs:712-724 | core/time/mod.rs:737-749 | core/time/mod.rs:881-894 \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 \u0060core/time/mod.rs:712\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/time/mod.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bc57c5536d61fd6c4a5ffd7c6db4667fa43dec13ca187740a02a599912c31c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): core/translate/alter.rs:255-268 | core/translate/analyze.rs:656-669 | core/translate/sequence.rs:879-891 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060core/translate/alter.rs:254\u0060 calls \u0060emit_column_or_rowid\u0060 and \u0060core/translate/sequence.rs:878\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":"core/translate/alter.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"765f4429fb7e543b724a03958701a2cf6357597beddd7a790fc0753041d93c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): core/translate/group_by.rs:785-798 | core/translate/group_by.rs:839-852 | core/translate/main_loop/body.rs:283-296 \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 \u0060core/translate/group_by.rs:785\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/group_by.rs"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"7823427026c8f69602f405bb028592bef7a0ffe73b7e185cd45c8891405c07e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): macros/src/assert.rs:121-134 | macros/src/assert.rs:177-190 | macros/src/assert.rs:303-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":"macros/src/assert.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"250b36067925b7f35d70f90dc5d5294fae123ce53352d3310c2cf446c474b232"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): testing/concurrent-simulator/properties.rs:704-718 | testing/concurrent-simulator/properties.rs:781-794 | testing/concurrent-simulator/properties.rs:833-848 \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 \u0060testing/concurrent-simulator/properties.rs:704\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"9595a12146f600ff30b0220053f1bc105174d2f9539537dd19b9259241301178"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): testing/simulator/generation/property.rs:114-127 | testing/simulator/generation/property.rs:150-163 | testing/simulator/generation/property.rs:218-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.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":"testing/simulator/generation/property.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b9cf4c905bceaf029eacc3f558a6c7e4d0a52f2b23cf5f7a073a6884d50c60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): bindings/c/src/lib.rs:1759-1769 | bindings/c/src/lib.rs:3307-3320 \u2014 both copies are in the same file, so extract the block 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":"bindings/c/src/lib.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afb227c8b83eadb4551cdc5de2d6fcc4f6e76e44535f17b69e2a25b31677e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:665-678 | core/incremental/vdbe_maintenance/aggregate.rs:680-693 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b4ff9cd5b1af81d69acc247487a98d3b1746d102534e095983fa110b3c48a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/incremental/vdbe_maintenance/set_op.rs:567-580 | core/incremental/vdbe_maintenance/set_op.rs:918-931 \u2014 both copies are in the same file, so extract the block 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, \u0060core/incremental/vdbe_maintenance/set_op.rs:583\u0060 calls \u0060is_some\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs:932\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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4078b842ac7c12ab1b0f0a625358b7d91001aac1191f9ba02f703eaaf80cd46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/incremental/vdbe_maintenance/sink.rs:189-202 | core/translate/sequence.rs:532-545 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/incremental/vdbe_maintenance/sink.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6739e633ff21216bed3220775af7f705008a4125b6fc11eb4a0d63e230a943e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:705-718 | core/index_method/toy_vector_sparse_ivf.rs:978-991 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:705\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, \u0060core/index_method/toy_vector_sparse_ivf.rs:719\u0060 calls \u0060as_f32_sparse\u0060 and \u0060core/index_method/toy_vector_sparse_ivf.rs:992\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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"37588647339033d5a2e2a119947dc215ba42e05a41a904ea6b940d65f256e97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:1388-1401 | core/index_method/toy_vector_sparse_ivf.rs:1446-1459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:1388\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f14a5957c87577664f04d3d5b64c9e3457b891e854c395c6da1734fedad343e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/io/io_uring.rs:702-715 | core/io/unix.rs:279-292 \u2014 before extracting anything, compare \u0060core/io/io_uring.rs\u0060 and \u0060core/io/unix.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 \u0060core/io/io_uring.rs:702\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/io_uring.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceee0e495a78fdb9c414240a1a75a9b7a3ffe8f9b79f79ca00cb9b1d5f5efa0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/json/jsonb.rs:1133-1146 | core/json/jsonb.rs:1197-1210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:1133\u0060 it does not close everything it opens, so those exact 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, \u0060core/json/jsonb.rs:1147\u0060 calls \u0060read_header\u0060, \u0060JsonbHeader\u0060 and \u0060core/json/jsonb.rs:1211\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":"core/json/jsonb.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f446cc519ac957d63f914d4f7b729cc940d0bc771817f705b3daab151d3775e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): core/json/jsonb.rs:2770-2783 | core/json/jsonb.rs:2827-2838 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:2827\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"core/json/jsonb.rs"},"region":{"startLine":2770}}}],"partialFingerprints":{"codehealthFindingId/v1":"be44f8cad8996c4896be988bb653238a0e35ae1993d558d4e41cbe409ec6d419"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): core/mvcc/cursor.rs:1340-1352 | core/mvcc/cursor.rs:2313-2326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/cursor.rs:1340\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"376fda5a6ba60df329bfd557523583ee4a86b58436d1680f9404438b8478d3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/percentile.rs:80-93 | core/percentile.rs:142-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":"core/percentile.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"630eb68ca8042cfa71d849559d4ed982edefe2ffae791040798aafa9e32b05b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/schema.rs:856-869 | core/schema.rs:890-903 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:856\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":"core/schema.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b4186bccebfb03b871a3b6d584abd02de64b470e8d6da7f3be975dcd54610c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): core/storage/btree.rs:2029-2042 | core/storage/btree.rs:7901-7910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:2029\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef53171fa7c981f5fcfee6eb6cd328461a7ccc99f6a76e2d97b4b8d697f04e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/storage/btree.rs:2184-2197 | core/storage/btree.rs:2479-2492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:2184\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2184}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5ef48e66e8b1ed0ac37262b23f5be840aca6191148406d1187e2e84aeb56d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): core/storage/btree.rs:3802-3815 | core/storage/btree.rs:3937-3949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:3802\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":3802}}}],"partialFingerprints":{"codehealthFindingId/v1":"65273b07ec9c2863a348ba91ca9662f12fd8c60f6ace56bff18e574b29079801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/storage/btree.rs:4224-4239 | core/storage/btree.rs:4259-4272 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":4224}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6d67cb61805adf22808ceba3a143a380991e594273c7ee86c4b2320f06f788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/storage/btree.rs:8685-8698 | core/storage/btree.rs:8769-8782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":8685}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4cedcf28b792a01d18cf1a3c36c2a1144a6940e1828b1e3ef37c191e0bd6df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/storage/sqlite3_ondisk.rs:1080-1093 | core/storage/sqlite3_ondisk.rs:1200-1213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/sqlite3_ondisk.rs:1080\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f588f452350c703c607ee509078e19d8ed86f053a551d5e7089947e675dcb0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/storage/sqlite3_ondisk.rs:1126-1139 | core/storage/sqlite3_ondisk.rs:1253-1266 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/sqlite3_ondisk.rs:1126\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d90bd50cc1028cbfffc67849daa653e429095476abfd89395e18b534824709"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201314 lines \u00D7 2): core/translate/emitter/select.rs:501-509 | core/translate/window.rs:1145-1158 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/translate/emitter/select.rs:501\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":"core/translate/emitter/select.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"3066a26fa31ef7246667d0d83aedec1d424f03a47e1e46cd17de4611a68ad238"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/emitter/select.rs:739-752 | core/translate/emitter/select.rs:761-774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/select.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bff08c54b027c2213f9936565a6220fe1421189c59f9f997b491e796d729d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/emitter/update.rs:1734-1747 | core/translate/emitter/update.rs:2206-2219 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"739ac23bdf5b2948525d8489c8647879be6d498fa8776f8cfce6d31bfc7ec9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/expr/condition.rs:472-485 | core/translate/expr/condition.rs:624-637 \u2014 both copies are in the same file, so extract the block 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":"core/translate/expr/condition.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eb3a54e5048a103bc30643f42671ff4c5fb51d42ae6cbfd18fb52660392e91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/expr/condition.rs:489-502 | core/translate/expr/condition.rs:609-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/condition.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"97e2163014b8c8026fa95ef04ca8ef8503d27176c4144c88486379090d4259f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/expr/translator.rs:1860-1873 | core/translate/expr/translator.rs:1875-1888 \u2014 both copies are in the same file, so extract the block 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":"core/translate/expr/translator.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca54352ada83d5331da81dfa55a48981f3e70eb5fc3bda1353cb822c9b6ec13e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/main_loop/in_seek.rs:22-35 | core/translate/main_loop/multi_index.rs:252-265 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/main_loop/in_seek.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, \u0060core/translate/main_loop/multi_index.rs:267\u0060 calls \u0060as_ref\u0060 and \u0060core/translate/main_loop/in_seek.rs:36\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":"core/translate/main_loop/in_seek.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b6542002c6e1641532790d8978028ef03c2239946991375081c487feda2001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/optimizer/constraints.rs:957-970 | core/translate/optimizer/constraints.rs:1063-1076 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/constraints.rs:957\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e0e8ad5de0faf4d6a935531277f528ee97fb2b6d4be49d0d9c8abb2ff671bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/optimizer/constraints.rs:1118-1131 | core/translate/optimizer/constraints.rs:1221-1234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/constraints.rs:1118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":1118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d504825051f795f8ce08cc1d0d8849c52ea2c9e5a0a1a3954b8b6837aabf2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): core/translate/schema.rs:2341-2354 | core/translate/schema.rs:2455-2467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7d9d01a1a507a8ebaba42819f21a258e76cd8951ee1c07c76be57ed73cacd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/trigger.rs:262-275 | core/translate/view.rs:464-477 \u2014 before extracting anything, compare \u0060core/translate/trigger.rs\u0060 and \u0060core/translate/view.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/trigger.rs:262\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/trigger.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd41d761d2e59fc583350bf16f5331ff1639e9032343980f712b8642f0ad02ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/upsert.rs:1856-1869 | core/translate/upsert.rs:1897-1910 \u2014 both copies are in the same file, so extract the block 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, \u0060core/translate/upsert.rs:1871\u0060 calls \u0060alloc_register\u0060 and \u0060core/translate/upsert.rs:1911\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":"core/translate/upsert.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"84227f3ff6ccbad2919b5e63f73ccd5bb0020c27b84002609ad257c7fe46a93f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): core/vdbe/execute.rs:18348-18361 | core/vdbe/execute.rs:18407-18418 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:18348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":18348}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd485386f046a2ba91279a490bf05b52806552dd8719e30fb88360c13eab653e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/vdbe/hash_table.rs:1646-1659 | core/vdbe/hash_table.rs:1810-1823 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:1646\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":1646}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d9c29a3280f18c1439a7258b28973e9772d4c1b022d8ca491a3eb5913fa737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/vdbe/hash_table.rs:2072-2085 | core/vdbe/hash_table.rs:2108-2121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:2072\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":"core/vdbe/hash_table.rs"},"region":{"startLine":2072}}}],"partialFingerprints":{"codehealthFindingId/v1":"647212d71591dadd548336dddd0d3bf99f8adbaac8e71e655c186b4020c4e17d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): postgres/client/lib.rs:303-316 | postgres/regress/main.rs:1387-1400 \u2014 before extracting anything, compare \u0060postgres/client/lib.rs\u0060 and \u0060postgres/regress/main.rs\u0060 as WHOLE FILES: this scan already matched 7 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/client/lib.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b8cea9485b9126f47b9fefddb849833b20088265a2117514a5a4c2dd586393"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): postgres/frontend/classes.rs:1760-1773 | postgres/frontend/classes.rs:1814-1827 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/classes.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"135b5b9f2842dd84aee9775461f761ebb73f14162a97b0a21d64239a3c0a2ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): sql_generation/model/query/select.rs:333-346 | sql_generation/model/query/select.rs:364-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 \u0060sql_generation/model/query/select.rs:333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/model/query/select.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a6f6fb6b18d27e8b4af469fb76b73ba0fdff5282dc6384f8b9afc2d67b87c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/create_index.rs:227-236 | testing/differential-oracle/sql_gen_prop/create_index.rs:321-334 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen_prop/create_index.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. 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":"testing/differential-oracle/sql_gen_prop/create_index.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8c9b451ab60f1df7d2a7a75f799b6710b8ceca19512da6204c8fa88aa82ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/cte.rs:507-520 | testing/differential-oracle/sql_gen_prop/cte.rs:526-539 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen_prop/cte.rs:507\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen_prop/cte.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea755c9dd1fc0f9d4d57183c44e2f5871e0e4185f23d71a0d6e995b7eba3dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): testing/simulator/generation/property.rs:2196-2209 | testing/simulator/generation/property.rs:2224-2236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f309897aad0eab7540496448625f77e4d3838093e445193d4dbe02793f60f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/simulator/model/mod.rs:412-427 | testing/simulator/model/mod.rs:448-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/model/mod.rs:412\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/model/mod.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d998fcc325fc875555e1bcb2fe6eed6f3201f7e94a5156514ac456b54f953fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): testing/simulator/runner/execution.rs:283-296 | testing/simulator/runner/execution.rs:483-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 \u0060testing/simulator/runner/execution.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":"testing/simulator/runner/execution.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4c3cfb2064e33a65b203fe036ac59f35bea59d64598ac67be1d243ef640455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 8): core/json/mod.rs:357-368 | core/json/mod.rs:400-412 | core/json/ops.rs:79-91 | core/json/ops.rs:114-126 | core/json/ops.rs:147-159 | core/json/ops.rs:189-201 | core/json/ops.rs:231-243 | core/json/ops.rs:274-286 \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":"core/json/mod.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"070ea299245da481ab89bb4532c11ce2785f5fe2a676c125f01f9df5f464ec7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 7): core/incremental/vdbe_maintenance/aggregate.rs:999-1011 | core/incremental/vdbe_maintenance/arrangement.rs:237-249 | core/incremental/vdbe_maintenance/set_op.rs:944-956 | core/translate/sequence.rs:1176-1188 | core/translate/view.rs:736-748 | core/translate/view.rs:824-836 | core/translate/view.rs:854-866 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.rs:999\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, \u0060core/translate/view.rs:852\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/arrangement.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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db048b272abc0b92450c9bba6ba483fa72a4cb892e354783da77e69b597a2a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 5): core/incremental/vdbe_maintenance/aggregate.rs:196-208 | core/incremental/vdbe_maintenance/arrangement.rs:84-95 | core/incremental/vdbe_maintenance/members.rs:74-85 | core/incremental/vdbe_maintenance/set_op.rs:381-392 | core/incremental/vdbe_maintenance/set_op.rs:395-406 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d87c5c0868a039793adbe5f2fdaba0084e4cfaa54047ca73c48158f9d79476a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): core/incremental/vdbe_maintenance/aggregate.rs:705-717 | core/incremental/vdbe_maintenance/aggregate.rs:902-914 | core/incremental/vdbe_maintenance/arrangement.rs:292-304 | core/incremental/vdbe_maintenance/join.rs:1195-1207 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.rs:705\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b594c4afdd3e27bc7c76f615af3442cbbcf10cb73aac311b72cad28726ea08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 4): core/translate/insert.rs:1286-1296 | core/translate/sequence.rs:138-150 | core/translate/sequence.rs:288-298 | core/translate/sequence.rs:567-577 \u2014 before extracting anything, compare \u0060core/translate/insert.rs\u0060 and \u0060core/translate/sequence.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 \u0060core/translate/insert.rs:1286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccfff3f1b3fbc4b2c41471ecc5d510514e8b70c02774bde6c44c69b7d38303e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): sync/engine/src/database_sync_operations.rs:1946-1958 | sync/engine/src/database_sync_operations.rs:2110-2122 | sync/engine/src/database_sync_operations.rs:2235-2247 | sync/engine/src/database_sync_operations.rs:3426-3438 \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 \u0060sync/engine/src/database_sync_operations.rs:1946\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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9443579f484f27968779f050c3c942d70a1515471988ba5621720bea1d1f9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): sync/engine/src/database_sync_operations.rs:1959-1971 | sync/engine/src/database_sync_operations.rs:2123-2134 | sync/engine/src/database_sync_operations.rs:2248-2259 | sync/engine/src/database_sync_operations.rs:3440-3451 \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 \u0060sync/engine/src/database_sync_operations.rs:1959\u0060 it does not close everything it opens, so those exact 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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"0314e43ad35e07dd6270d2c596e9bccf8db0dd511cbb4ccca09d9892c4c65a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): testing/concurrent-simulator/properties.rs:664-677 | testing/concurrent-simulator/properties.rs:703-716 | testing/concurrent-simulator/properties.rs:780-792 | testing/concurrent-simulator/properties.rs:832-845 \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 \u0060testing/concurrent-simulator/properties.rs:664\u0060 it does not close everything it opens, so those exact 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, \u0060testing/concurrent-simulator/properties.rs:678\u0060 calls \u0060is_ok\u0060 and \u0060testing/concurrent-simulator/properties.rs:717\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":"testing/concurrent-simulator/properties.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de39416cc97b1814b40eb3f5fa18555908f08424bee1f645654604674c05045"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 4): testing/sqltest/src/generator/mod.rs:437-449 | testing/sqltest/src/generator/mod.rs:550-560 | testing/sqltest/src/generator/mod.rs:613-623 | testing/sqltest/src/generator/mod.rs:1035-1045 \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 \u0060testing/sqltest/src/generator/mod.rs:437\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5731ab05bed850e39d65467b8453409bc715ef569e390d3f472dd50cb012a5ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): cli/read_state_machine.rs:79-91 | postgres/cli/read_state_machine.rs:79-91 | testing/sqltest/src/parser/sql_complete.rs:81-93 \u2014 before extracting anything, compare \u0060cli/read_state_machine.rs\u0060 and \u0060postgres/cli/read_state_machine.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/read_state_machine.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":"cli/read_state_machine.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29a4c648a47a399856ee04d5d2785a244b655cb232a481ba1eeacb2eb6770bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/incremental/vdbe_maintenance/linear.rs:111-123 | core/incremental/vdbe_maintenance/linear.rs:190-202 | core/incremental/vdbe_maintenance/set_op.rs:188-200 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/linear.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/incremental/vdbe_maintenance/linear.rs:124\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/linear.rs:203\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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f5847ade16310becf3c48143cdd555c172fb463b0f095b07be08cd2aacbe19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/translate/alter.rs:1145-1157 | core/translate/alter.rs:1584-1596 | core/translate/alter.rs:2160-2172 \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 \u0060core/translate/alter.rs:1145\u0060 it does not close everything it opens, so those exact 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":"core/translate/alter.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"716b61fce1ed6948c533eea2b06b180d3c25bb13d8068efd6cd216df8bf5e90c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 3): core/translate/emitter/delete.rs:430-442 | core/translate/fkeys.rs:1409-1420 | core/translate/insert.rs:4148-4158 \u2014 before extracting anything, compare \u0060core/translate/emitter/delete.rs\u0060 and \u0060core/translate/fkeys.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"core/translate/emitter/delete.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c43f26c19a278873ed509b5ec522191b32eb92a798294b7f119f5e9b4b0883f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/translate/group_by.rs:815-827 | core/translate/group_by.rs:873-885 | core/translate/main_loop/body.rs:311-323 \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 \u0060core/translate/group_by.rs:815\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/group_by.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8cb13e9ceb6dd7c82b920736103f452424cb15a0431ec72163793f0156a0a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): sync/engine/src/database_sync_operations.rs:2029-2040 | sync/engine/src/database_sync_operations.rs:2173-2185 | sync/engine/src/database_sync_operations.rs:2349-2361 \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":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":2029}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafffed40da28a6d3afab9fe301a0da44cda9aefbb5aa7aacff975eb52999926"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): testing/simulator/runner/differential.rs:118-130 | testing/simulator/runner/doublecheck.rs:143-155 | testing/simulator/runner/execution.rs:152-164 \u2014 before extracting anything, compare \u0060testing/simulator/runner/differential.rs\u0060 and \u0060testing/simulator/runner/doublecheck.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"testing/simulator/runner/differential.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8299b4582aa10c688ea93dfdbb3ed30fdc49842ee813dfde03f64f888b058b38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): cli/sync_server.rs:387-399 | cli/sync_server.rs:551-563 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/sync_server.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bc6f6572bc35b1be8bae92b29814d1d9d8cf3186624f48d4158039517449cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/connection.rs:2058-2071 | core/connection.rs:2108-2121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":2058}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4b8d6592f18112a5e8411cff417622417ed694cd866f3463be7709c32fd4cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): core/database.rs:2349-2361 | core/database.rs:2493-2502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/database.rs:2349\u0060 it does not close everything it opens, so those exact lines 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":"core/database.rs"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d38d8ac1c77aa80d98df252262f26b79161bf7cb59aa10b13341f5a6b45dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/incremental/vdbe_maintenance/linear.rs:44-56 | core/incremental/vdbe_maintenance/linear.rs:392-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.rs:44\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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"abecebdad71fe3b3e41cb23816cd9a28bfe2c74440bef65f39d289dfb165cf0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:745-757 | core/index_method/toy_vector_sparse_ivf.rs:1017-1029 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:745\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e555968cbfbded9ba4fc5c1b6dc888b9b75b661869044032471bd76a430a125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/mvcc/persistent_storage/logical_log.rs:2246-2258 | core/mvcc/persistent_storage/logical_log.rs:2381-2393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/persistent_storage/logical_log.rs:2246\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde287276da99ebbcf868e1e608fd8d6b83c0f3a16fad0f1abedda2044863d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): core/mvcc/persistent_storage/logical_log.rs:3295-3306 | core/mvcc/persistent_storage/logical_log.rs:3314-3326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/persistent_storage/logical_log.rs:3295\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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3295}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d95b169947779912c7bc167da359248a1d923edbd7a90820a420ed650b6a1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/schema.rs:8900-8912 | core/schema.rs:8954-8966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:8900\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":8900}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f3e48125daae8df5db67bafec5c00039d1226670d9323b2a43ddffb933ca15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/storage/pager.rs:5924-5936 | core/storage/pager.rs:5958-5970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/pager.rs:5924\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":5924}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf299dec3ed78bbcf16ceb86b934bae9a7dfdd74ddbe6a800313dfcb435e2e97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/storage/shared_wal_coordination.rs:2031-2043 | core/storage/shared_wal_coordination.rs:2060-2072 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/shared_wal_coordination.rs:2060\u0060 it begins part-way through the construct above it, so those exact 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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":2031}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1fe7b5558c3e1d5b7b428e965bb61b09b2bcd576faebafa39e378f36b5f8c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/emitter/mod.rs:476-488 | core/translate/emitter/mod.rs:496-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 \u0060core/translate/emitter/mod.rs:476\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9739b543ce28c8332a71356915544f0690fe0a024986cd01a3bbf73f8b60d12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/emitter/mod.rs:1796-1808 | core/translate/emitter/mod.rs:1851-1863 \u2014 both copies are in the same file, so extract the block 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, \u0060core/translate/emitter/mod.rs:1868\u0060 calls \u0060allocate_label\u0060 and \u0060core/translate/emitter/mod.rs:1809\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":"core/translate/emitter/mod.rs"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd30f257dad8e8fe3908a449288715accef8a5f2691aee035402fc0a3475248b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): core/translate/emitter/update.rs:1958-1969 | core/translate/upsert.rs:1859-1871 \u2014 before extracting anything, compare \u0060core/translate/emitter/update.rs\u0060 and \u0060core/translate/upsert.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"268cfcd1afe155a7ebd998d2e3de65f24e6fad303e217b746fcc16f41be9fd9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/insert.rs:751-763 | core/translate/insert.rs:1636-1648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc2dcf81e1b688caf812a92ec8b7ef25f956fd85e5658220aca5960b62a7c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/pragma.rs:1173-1185 | core/translate/pragma.rs:1310-1322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/pragma.rs:1173\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/pragma.rs"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ef3f48866b2bc6b507aff7f7ff572d1615816d85afcf524e49cbf8a58653ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/pragma.rs:1868-1880 | core/turso_types_vtab.rs:93-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":"core/translate/pragma.rs"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87141aedd3b3da5e6efa1e2a3dbda24c226712471fee9776ed98dd258384248"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/result_row.rs:305-317 | core/translate/values.rs:349-361 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/result_row.rs:305\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060core/translate/result_row.rs:304\u0060 calls \u0060alloc_register\u0060 and \u0060core/translate/values.rs:348\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":"core/translate/result_row.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e8f3dd600552e651571fbdb9ac8760933628953646ecce39db60124f4c7a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/sequence.rs:801-813 | core/translate/trigger.rs:653-667 \u2014 before extracting anything, compare \u0060core/translate/sequence.rs\u0060 and \u0060core/translate/trigger.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060core/translate/sequence.rs:801\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/sequence.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a48ee80fb68315e98b2dd9e34e0d2fcde5d1c1fcd61e9ee6fe444b6de3b73e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): core/translate/sequence.rs:1141-1152 | core/translate/view.rs:688-700 \u2014 before extracting anything, compare \u0060core/translate/sequence.rs\u0060 and \u0060core/translate/view.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/sequence.rs:1141\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, \u0060core/translate/view.rs:701\u0060 calls \u0060alloc_register\u0060 and \u0060core/translate/sequence.rs:1153\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":"core/translate/sequence.rs"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3ec5a5fea2b03ce8c9638fb54edb81fc5bbfcf278731eb351e2ae1d54e51ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/subquery.rs:2056-2068 | core/translate/subquery.rs:2186-2198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/subquery.rs:2056\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/subquery.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"654024de0f91ff1414ecd82f44e6a12a184c40a232cb4df94eed008d7f2ec7e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): core/translate/upsert.rs:942-954 | core/translate/upsert.rs:1650-1661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/upsert.rs:942\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/upsert.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6eb273da4c520922237cc626d1bbc38ff2e6c92c7bca925dc5cabb8d12daf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/upsert.rs:1264-1276 | core/translate/upsert.rs:1392-1404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/upsert.rs:1264\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/upsert.rs"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d090684eb91707f60408c90758eebf2c47d75bc6bc61dc492adcb9c0c25b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vdbe/execute.rs:4009-4021 | core/vdbe/execute.rs:4055-4067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:4009\u0060 it does not close everything it opens, so those exact 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":"core/vdbe/execute.rs"},"region":{"startLine":4009}}}],"partialFingerprints":{"codehealthFindingId/v1":"6879a948ad4a12a8cc83b841c1248e48266facbaccc44a33654a40b67ecf1a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vdbe/execute.rs:4736-4748 | core/vdbe/execute.rs:4824-4836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":4736}}}],"partialFingerprints":{"codehealthFindingId/v1":"955da36f320c419d96bc8713ae2074e9d25f4c3ed2cebb5a1ec5304217a8a6f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vdbe/execute.rs:7635-7647 | core/vdbe/execute.rs:9110-9122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:7635\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":7635}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d496cc6f01720a674d9d50a516dec05f54028330123e4b47444db7dbdb011b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): core/vdbe/execute.rs:12812-12823 | core/vdbe/execute.rs:12837-12849 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:12837\u0060 it begins part-way through the construct above it, so those exact 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. 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":"core/vdbe/execute.rs"},"region":{"startLine":12812}}}],"partialFingerprints":{"codehealthFindingId/v1":"448e822672c60dcfb130138a35bb534cfcd1c4d11cbca56984c5aad4599f6bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vdbe/execute.rs:17187-17199 | core/vdbe/execute.rs:17208-17220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":17187}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a519efbec86d021247e9526a0914ca806a062fca94127b886c91fa54838320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vdbe/hash_table.rs:1789-1801 | core/vdbe/hash_table.rs:1805-1817 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"b482aafd6d08e6059ceab6c710c46f16851b43911de051fb320959eda59372dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vdbe/value.rs:757-769 | core/vdbe/value.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. 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":"core/vdbe/value.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd83bcaaa778906b963c461be4d160d53dd57b8b0d8994da82939e56ea1e6a9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vector/operations/text.rs:183-195 | core/vector/operations/text.rs:207-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vector/operations/text.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c809bc254310b83be20064be534943ec1df75730b1f446fda1ff1ad7beeffb26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): macros/src/ext/match_ignore_ascii_case.rs:21-33 | macros/src/ext/match_ignore_ascii_case.rs:40-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macros/src/ext/match_ignore_ascii_case.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1be656c76470354428b7dd4ab7bee630b9c1b08bf5c5a0a63cac6b22798f956"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): postgres/parser/lexer.rs:606-618 | postgres/parser/lexer.rs:631-643 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/lexer.rs:606\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/lexer.rs"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b70ac840cf021d7f52b000f74daadba89fa8276c0ba4d6d3526baf6148bd0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sdk-kit/src/capi.rs:173-185 | sdk-kit/src/capi.rs:231-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 \u0060sdk-kit/src/capi.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":"sdk-kit/src/capi.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb8670958c62be39c1a15cc945b987a36bcdafffd17a6762da460e664fefb25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): serverless/rust/differential/lib.rs:406-418 | serverless/rust/differential/lib.rs:607-619 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060serverless/rust/differential/lib.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":"serverless/rust/differential/lib.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8ea80eb8a3776b89521f162bd627d736757af195eebb0e1bd99ac726377963e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sql_generation/generation/predicate/binary.rs:50-62 | sql_generation/generation/predicate/binary.rs:162-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/generation/predicate/binary.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f8582d0f524c40e977967d6aa624e5235e5b1a28d34865dfba1bf14ee11ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sql_generation/model/query/insert.rs:79-91 | sql_generation/model/query/insert.rs:110-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060sql_generation/model/query/insert.rs:92\u0060 calls \u0060Some\u0060 and \u0060sql_generation/model/query/insert.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":"sql_generation/model/query/insert.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"59370bd9bc099a8621d677d51f8a3feffc91079eaa6057b31d9d62c0fd9951a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): sqlite/parser/src/parser.rs:526-538 | sqlite/parser/src/parser.rs:550-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 \u0060sqlite/parser/src/parser.rs:550\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":"sqlite/parser/src/parser.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"616342d872ccfb8f675665c064c87f279023a2ab1c85d9feedc2d71997766b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): sync/engine/src/database_sync_engine.rs:2040-2052 | sync/engine/src/database_sync_engine.rs:2734-2746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"4619de2f8fb213ba237bdc304dc1093fee7d2e3ba5c10479cd10a550ab121487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): testing/simulator/model/mod.rs:862-874 | testing/simulator/model/mod.rs:896-908 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/model/mod.rs:862\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/model/mod.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"d01cc4d72e6aaeeb54b327e4d5f636e982ab51567b67770d01e46f29de800a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): testing/simulator/profiles/mod.rs:107-119 | testing/simulator/profiles/mod.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 \u0060testing/simulator/profiles/mod.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060testing/simulator/profiles/mod.rs:156\u0060 calls \u0060default\u0060 and \u0060testing/simulator/profiles/mod.rs:106\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":"testing/simulator/profiles/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe99cd5c83224b706f6d883b65fcded43dd0b6cff4922e21c16a204e412886a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): testing/simulator/runner/differential.rs:29-41 | testing/simulator/runner/doublecheck.rs:25-37 \u2014 before extracting anything, compare \u0060testing/simulator/runner/differential.rs\u0060 and \u0060testing/simulator/runner/doublecheck.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/runner/differential.rs:29\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":"testing/simulator/runner/differential.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0a8435a8c71ca7544e0e6471c9b68c019430f1862f3384e06d141b4adf5fe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): testing/sqltest/src/backends/cli.rs:355-367 | testing/sqltest/src/backends/js.rs:208-220 \u2014 before extracting anything, compare \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/js.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/backends/cli.rs:355\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eacc750c35e993042c1766bb8d965a47af9552767a5b22ebdc534796d9c5cb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): testing/sqltest/src/generator/mod.rs:1502-1513 | testing/sqltest/src/generator/mod.rs:1522-1534 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/generator/mod.rs:1502\u0060 it begins part-way through the construct above it, so those exact lines 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":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"a30c94761318addd05fc48e1237709df1c97e20bdb8e07eb8bdea6dfba9d58f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 7): core/translate/expr/translator.rs:1234-1245 | core/translate/expr/translator.rs:1474-1484 | core/translate/expr/translator.rs:1723-1734 | core/translate/expr/translator.rs:1777-1788 | core/translate/expr/translator.rs:1791-1802 | core/translate/expr/translator.rs:1848-1858 | core/translate/expr/translator.rs:1983-1994 \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 \u0060core/translate/expr/translator.rs:1234\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8e00e9e8b3e9586d8f56d92e4a1ac53f61f89a00a860b5628b472c6097ec43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 5): core/incremental/vdbe_maintenance/linear.rs:112-123 | core/incremental/vdbe_maintenance/linear.rs:191-202 | core/incremental/vdbe_maintenance/set_op.rs:189-200 | core/incremental/vdbe_maintenance/stream.rs:269-280 | core/incremental/vdbe_maintenance/stream.rs:343-354 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/linear.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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, \u0060core/incremental/vdbe_maintenance/linear.rs:124\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/linear.rs:203\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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac9d040e617b08bf77a2906c3b9ae4d345568e3bb0edcdfbc2286ea1d619e1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): core/incremental/vdbe_maintenance.rs:250-261 | core/incremental/vdbe_maintenance/join.rs:535-546 | core/incremental/vdbe_maintenance/linear.rs:41-52 | core/incremental/vdbe_maintenance/linear.rs:389-400 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/join.rs\u0060 and \u0060core/incremental/vdbe_maintenance/linear.rs\u0060 as WHOLE FILES: this scan already matched 3 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance.rs:250\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d22fa11dfa9b8bcd17efd6767517ab10cd3ee99feb31b56ed2ce835b3f0eb6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): core/mvcc/persistent_storage/logical_log.rs:2792-2803 | core/mvcc/persistent_storage/logical_log.rs:2907-2918 | core/mvcc/persistent_storage/logical_log.rs:3210-3221 | core/mvcc/persistent_storage/logical_log.rs:3344-3355 \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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2792}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb116b17c0c5a283e272a0fd8d45c6400a7cac884e59518fbc34106264ad1ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): core/storage/encryption.rs:466-477 | core/storage/encryption.rs:481-492 | core/storage/encryption.rs:496-507 | core/storage/encryption.rs:516-527 \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":"core/storage/encryption.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bda1c27b7c21f2a37edaac8a4caaaa136d618864ee137a86ca8045e5f7bde5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): core/translate/fkeys.rs:1425-1436 | core/translate/fkeys.rs:1492-1503 | core/translate/insert.rs:4163-4174 | core/translate/insert.rs:4278-4289 \u2014 before extracting anything, compare \u0060core/translate/fkeys.rs\u0060 and \u0060core/translate/insert.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/fkeys.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"622a92f6bb64248064875fef55e809ea26777e69aeb3948397f55c0c2e0a214e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/incremental/vdbe_maintenance/arrangement.rs:231-242 | core/incremental/vdbe_maintenance/members.rs:241-252 | core/incremental/vdbe_maintenance/set_op.rs:938-949 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 and \u0060core/incremental/vdbe_maintenance/members.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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ceb805ddfac0f01862b0dd4d6eccf8e6327d8cfc08a2a299349f3bd1f9a702e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/incremental/vdbe_maintenance/members.rs:277-288 | core/incremental/vdbe_maintenance/set_op.rs:967-978 | core/incremental/vdbe_maintenance/sink.rs:208-219 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/members.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.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 \u0060core/incremental/vdbe_maintenance/members.rs:277\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":"core/incremental/vdbe_maintenance/members.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"4883d91c2cdace3d823a30ac5f5afa74e0931adda1b0b5f162d9a9d2850ff1e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/incremental/vdbe_maintenance/set_op.rs:876-887 | core/incremental/vdbe_maintenance/set_op.rs:974-985 | core/translate/alter.rs:345-356 \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 \u0060core/incremental/vdbe_maintenance/set_op.rs:876\u0060 it does not close everything it opens, so those exact 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, \u0060core/incremental/vdbe_maintenance/set_op.rs:973\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs:875\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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"6841f95c6b1da9900381ca955f22ac7140db3cfaa370f74f8eed8b367a8334ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/index_method/toy_vector_sparse_ivf.rs:520-531 | core/index_method/toy_vector_sparse_ivf.rs:783-794 | core/index_method/toy_vector_sparse_ivf.rs:1566-1577 \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 \u0060core/index_method/toy_vector_sparse_ivf.rs:520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"12694fdccff0187c0fdb4c32b75f077b1bfa19a07630084e46061296811862b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): core/translate/display.rs:163-174 | core/translate/display.rs:285-295 | core/translate/display.rs:405-415 \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 \u0060core/translate/display.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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060f\u0060 to \u0060\u0026mut Formatter\u0060 in one and \u0060\u0026mut fmt::Formatter\u003C\u0027_\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":"core/translate/display.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3f39fb34f5a34a744c70806d889d9e76d2c9066c896e768282d500a35f878b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): core/translate/expr/translator.rs:1668-1679 | core/translate/expr/translator.rs:1683-1693 | core/translate/expr/translator.rs:2314-2324 \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":"core/translate/expr/translator.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba051260d1bbab98a251654d9f75e6799f08c54d66b324a91a0896010ad59ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 3): core/translate/schema.rs:3566-3577 | core/translate/sequence.rs:768-778 | core/translate/sequence.rs:841-849 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/translate/schema.rs:3579\u0060 calls \u0060allocate_label\u0060 and \u0060core/translate/sequence.rs:779\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":"core/translate/schema.rs"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b80a7e4c63d28558845f1623f8ef089f3f4a831d7bc356312d9b6966a07ebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/vdbe/execute.rs:8436-8447 | core/vdbe/execute.rs:8484-8495 | core/vdbe/execute.rs:8518-8529 \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 \u0060core/vdbe/execute.rs:8436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8436}}}],"partialFingerprints":{"codehealthFindingId/v1":"db442ac31f3aba0f1a827807e38418918648ad57ded2aab8fd1d145d72784e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): postgres/parser/parser.rs:127-138 | postgres/parser/parser.rs:277-288 | postgres/parser/parser.rs:645-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac4b51e18ebd90a2f81ffabfbb0113595e253674188f2524a3f0948382fb78b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): testing/concurrent-simulator/worker.rs:97-108 | testing/concurrent-simulator/worker.rs:137-148 | testing/concurrent-simulator/worker.rs:160-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/concurrent-simulator/worker.rs:97\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":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e5c1573ee4ac1b57b16cf55dd3117d1519f8e1ad6eef32db7061a517379809"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:673-684 | bindings/dotnet/src/Turso.Data/TursoDataReader.cs:192-202 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:673\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f40b448ea3a01e351e2b5a98f230961583746d02cb748cb409180b048db47c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): cli/app.rs:1580-1590 | cli/app.rs:1747-1758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cli/app.rs:1580\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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":"cli/app.rs"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb41cfbaa4c9deb8771a0164eac79cccb02147b638738d544ea4b7034bb728b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): core/functions/datetime.rs:806-816 | core/functions/datetime.rs:827-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 \u0060core/functions/datetime.rs:827\u0060 it begins part-way through the construct above it, so those exact 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. 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":"core/functions/datetime.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"b717928d3718e4c49c8679abba059fe84d76694c7ba7e8b70e0ab35bb30d1688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:321-330 | core/translate/trigger.rs:595-606 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/translate/trigger.rs:612\u0060 calls \u0060alloc_register\u0060 and \u0060core/incremental/vdbe_maintenance/aggregate.rs:333\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"85be1bec516b528826331b07bd292fe37f60305044aa1b9526641df0dd286087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:751-762 | core/incremental/vdbe_maintenance/set_op.rs:725-736 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 10 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 \u0060core/incremental/vdbe_maintenance/aggregate.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca532389062378b81e469b10cfff0130a969d53e1f8cd141594a79a7a4e99219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:1020-1031 | core/incremental/vdbe_maintenance/set_op.rs:961-973 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 10 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 \u0060core/incremental/vdbe_maintenance/aggregate.rs:1020\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, \u0060core/incremental/vdbe_maintenance/aggregate.rs:1034\u0060 calls \u0060emit_row_tail\u0060, \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs:974\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":1020}}}],"partialFingerprints":{"codehealthFindingId/v1":"db51cf30e600a850b6106ad336cf92b9ae8fd04c4abc08f676c2cee3c3cbf9ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:1016-1027 | core/incremental/vdbe_maintenance/set_op.rs:648-659 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 10 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 \u0060core/incremental/vdbe_maintenance/aggregate.rs:1016\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/incremental/vdbe_maintenance/set_op.rs:660\u0060 calls \u0060emit_int\u0060 and \u0060core/incremental/vdbe_maintenance/aggregate.rs:1028\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9e4fc83f8e8ff91018d463213ba2f6a95f33aa76f9c1176af41f6a61b64f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): core/incremental/vdbe_maintenance/consolidate.rs:87-96 | core/incremental/vdbe_maintenance/set_op.rs:1025-1036 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/incremental/vdbe_maintenance/consolidate.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":"core/incremental/vdbe_maintenance/consolidate.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b08703e85c6daa3b679653f334083ac06e911a497cbec355ebfc8fe7982738"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/incremental/vdbe_maintenance/join.rs:1006-1017 | core/translate/schema.rs:2657-2668 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"173567e30aa9f1c8cf7df689c7edbae1bdd0c4ccdc066495e437f979b5b8d109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/incremental/vdbe_maintenance/set_op.rs:643-654 | core/incremental/vdbe_maintenance/set_op.rs:720-731 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/set_op.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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9c09b1eadf341eb8ec99fb51289dfe519804eaf0b2b5cad6332320f9144758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:548-559 | core/index_method/toy_vector_sparse_ivf.rs:811-822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:548\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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"4201a940a50d25ae83c03f7252eb8e7e9e4ade404543b30d6b8b8a80000a6eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): core/mvcc/database/checkpoint_state_machine.rs:3010-3020 | core/mvcc/database/checkpoint_state_machine.rs:3162-3173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/checkpoint_state_machine.rs:3010\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":3010}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0af130549c65d6276343c8d2d0bcfaa0bf04a0051a4c809d86a34e7a59fa39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): core/mvcc/database/checkpoint_state_machine.rs:3033-3043 | core/mvcc/database/checkpoint_state_machine.rs:3186-3197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/checkpoint_state_machine.rs:3033\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":3033}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33c077cd3fa631044184c3ee0ef276c573ca758ac5333ea4be3246d1af5e977"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): core/mvcc/persistent_storage/logical_log.rs:2980-2991 | core/mvcc/persistent_storage/logical_log.rs:3280-3290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/persistent_storage/logical_log.rs:2980\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2980}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e7c213c22841815c0f8eaa93a9a0e73060aec1abd05de1d0b89b42f36cedf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/percentile.rs:95-106 | core/percentile.rs:157-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/percentile.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":"core/percentile.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bec71f9c7c6fae479c891a337ee30e2ff2ba16ee26567c43c497e99489a181d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/time/mod.rs:167-178 | core/time/mod.rs:413-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 \u0060core/time/mod.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/time/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"7029f771b276084f97d242d702dacf2caee9013f69055c5b6fab8eb1473820ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/compound_select.rs:613-624 | core/translate/compound_select.rs:816-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 \u0060core/translate/compound_select.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":"core/translate/compound_select.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaae83f3cc653d293ac9a996738fa9fe13fb4608f3661264b33df2f03a97e2e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/display.rs:128-139 | core/translate/display.rs:251-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 \u0060core/translate/display.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":"core/translate/display.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e59be4dda19d3507493ab26c75d65caa379e8e6e1813fbf45564678657e6e09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/emitter/mod.rs:1499-1510 | core/translate/emitter/mod.rs:1634-1645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfce2b6be3eed10d1760b9c3448958f59704c4098342bad76eddcdfb5ee1d09d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/expr/translator.rs:1695-1706 | core/translate/expr/translator.rs:1709-1720 \u2014 both copies are in the same file, so extract the block 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":"core/translate/expr/translator.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cb8321dd7c064401142148e15b7cd88428f2a93b844b1acd77cbfa35f1cf64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/expr/translator.rs:2883-2894 | core/translate/expr/translator.rs:2922-2933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/translator.rs:2883\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060core/translate/expr/translator.rs:2921\u0060 calls \u0060resolve_cursor_id\u0060, \u0060index\u0060, \u0060clone\u0060 and \u0060core/translate/expr/translator.rs:2882\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":"core/translate/expr/translator.rs"},"region":{"startLine":2883}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ffd40e9d4ca2795f17625d395aeb83ce3ed21794a4535eb60cb410bc89fc0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/fkeys.rs:332-343 | core/translate/insert.rs:4426-4437 \u2014 before extracting anything, compare \u0060core/translate/fkeys.rs\u0060 and \u0060core/translate/insert.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/fkeys.rs:332\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e07b851b394ddb56b6c0eb35c90284277f6e95fdd0c02e697ecb1fa296243b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/fkeys.rs:470-481 | core/translate/fkeys.rs:619-630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/fkeys.rs:470\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8d9dffb96bc42e88312f75f6c21e114412a2e1a85317b03753a5d3f654dd1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): core/translate/fkeys.rs:1266-1277 | core/translate/fkeys.rs:1442-1452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/fkeys.rs:1266\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a89f00383ff52373a0f8735ccfb21e2a888452432a30fbf40edf6095192b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/fkeys.rs:1314-1325 | core/translate/insert.rs:4095-4106 \u2014 before extracting anything, compare \u0060core/translate/fkeys.rs\u0060 and \u0060core/translate/insert.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 150 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"core/translate/fkeys.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bbe3224e8fbb1b7c1d140212a22bdd17f99fe285b11fc17fb2e69848a31866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/optimizer/mod.rs:4805-4816 | core/translate/optimizer/mod.rs:4860-4871 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/mod.rs:4805\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":"core/translate/optimizer/mod.rs"},"region":{"startLine":4805}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bb41e28138435c544d50c97cc596060fa9e9b4035183f5d3d54efbebb4cdbdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/translate/planner.rs:2337-2348 | core/translate/planner.rs:2365-2376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/planner.rs:2337\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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":"core/translate/planner.rs"},"region":{"startLine":2337}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2b731ae0157ca39b70798f72070a42a4693182c9e496e12f90469cf5d9caf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): core/translate/schema.rs:254-265 | core/translate/schema.rs:267-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec40ab1dd922d860735600d1332a578e6b1c3449baf27b357bf3a8951327f63c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): core/translate/schema.rs:2306-2316 | core/translate/schema.rs:2424-2435 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":2306}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18468a0d8106a367f65ed6d40a010acbddd6ebe15e6b922d6e422194b29e2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201312 lines \u00D7 2): core/translate/window.rs:3331-3342 | core/translate/window.rs:3483-3489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/window.rs:3331\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":"core/translate/window.rs"},"region":{"startLine":3331}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f5d8110df39331a31ebedbfa233a4704909f76a53e7225f8d9aebabd27e2169"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): core/vdbe/execute.rs:3613-3623 | core/vdbe/execute.rs:3699-3710 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:3613\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":3613}}}],"partialFingerprints":{"codehealthFindingId/v1":"126319de38b1146c5afd3e17c076a0428b3ff3c087650f6ffee071127993a9ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/vdbe/execute.rs:10613-10624 | core/vdbe/execute.rs:10928-10939 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:10613\u0060 it does not close everything it opens, so those exact 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":"core/vdbe/execute.rs"},"region":{"startLine":10613}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6411e50d6c9b7436e155565a80f257b6cd8836d896cb7a211f97e5c570db2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): core/vdbe/execute.rs:14503-14514 | core/vdbe/execute.rs:14546-14553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:14503\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":14503}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fc414e6cfbf45833fe7dc3ced1999aa1fd9558493e2a14f831205b41c5a2d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): macros/src/ext/vtab_derive.rs:244-255 | macros/src/ext/vtab_derive.rs:259-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 \u0060macros/src/ext/vtab_derive.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macros/src/ext/vtab_derive.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"328187dca54c90a19db462f101fff39a84c5e95741e27314d1474b3cc648660f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): macros/src/lib.rs:1245-1256 | macros/src/lib.rs:1367-1378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060macros/src/lib.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":"macros/src/lib.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bac1fb942e3f3e2f3182f3e925e6e810956937267e8d09b0304705247a44ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): postgres/frontend/classes.rs:1120-1131 | postgres/frontend/roles.rs:251-262 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"postgres/frontend/classes.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"583ddc18d8dba57528cc884b3abbea31db260b4cddc0b89c7974b9d93325a2fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): postgres/frontend/options.rs:55-66 | postgres/frontend/unnest.rs:51-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060postgres/frontend/options.rs:55\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/options.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1814cdf50b56470839995f626064b2b08ae5e816601911e306cdfb420eac8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): serverless/rust/differential/lib.rs:384-395 | serverless/rust/differential/lib.rs:587-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/rust/differential/lib.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43ace2a312ea46c3c4ed122bad3cca92b0391f0f35af253cad60207d58cad6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): sql_generation/generation/predicate/binary.rs:251-261 | sql_generation/generation/predicate/binary.rs:318-329 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sql_generation/generation/predicate/binary.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":"sql_generation/generation/predicate/binary.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"3968654acf66d775c243cbe05f650438a3eb34cdc77a24af3273c9adff1e96fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sqlite/parser/src/ast/fmt.rs:500-511 | sqlite/parser/src/ast/fmt.rs:671-682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/ast/fmt.rs:500\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18d4b5b0946c18c19e30434f766a5faf4edaf0efaa0d2c34a0b7fcb095c8ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): sync/engine/src/database_sync_operations.rs:398-409 | sync/engine/src/database_sync_operations.rs:413-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 \u0060sync/engine/src/database_sync_operations.rs:398\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4370c3e6f1199e1264552fc23ffb1b1d3bd8e69cfeee32383bf8a26d7c9bc67f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): testing/concurrent-simulator/lib.rs:1133-1144 | testing/concurrent-simulator/lib.rs:1468-1478 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/concurrent-simulator/lib.rs:1133\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6005b301eab67d5f1e1a05cac59cf37532d9e566d3a3f97005e057cae4f134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/differential-oracle/sql_gen/src/trace.rs:491-502 | testing/differential-oracle/sql_gen/src/trace.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/trace.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18f27468507eb43fcaec855855fd15b6d765663318a1cd38e24ae375bc48ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/simulator/common/mod.rs:5-16 | testing/simulator/runner/differential.rs:175-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"testing/simulator/common/mod.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac4183eae18ded4f6366bbbd8770b2bff77ba887aed41458779b6de79e67e71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/simulator/generation/property.rs:403-414 | testing/simulator/generation/property.rs:539-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 \u0060testing/simulator/generation/property.rs:403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd262d03f503b5e4e9ae302bb53fb306f4c20c639b58a63559a5f6a1e2fb7dc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/simulator/runner/env.rs:1707-1718 | testing/simulator/runner/env.rs:1943-1954 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/runner/env.rs:1707\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/env.rs"},"region":{"startLine":1707}}}],"partialFingerprints":{"codehealthFindingId/v1":"72cefedb288721024ae643810c4102774fd5754a187fcd01bd207245402e9306"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/sqltest/src/backends/cli.rs:279-290 | testing/sqltest/src/backends/js.rs:144-155 \u2014 before extracting anything, compare \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/js.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02d8553855672fca867f5f347c9926e82a2a2b4cedfd1be5cfdb69b39e03a73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/sqltest/src/tcl_converter/parser.rs:530-541 | testing/sqltest/src/tcl_converter/parser.rs:560-571 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/tcl_converter/parser.rs:530\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/tcl_converter/parser.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"944df1cd8a3e5014f14f49aca91023fbef8ccaa046aff6e696ff085d91b6d0cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): core/incremental/vdbe_maintenance/aggregate.rs:172-182 | core/incremental/vdbe_maintenance/join.rs:532-542 | core/incremental/vdbe_maintenance/join.rs:784-794 | core/incremental/vdbe_maintenance/linear.rs:38-48 | core/incremental/vdbe_maintenance/linear.rs:386-396 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"826ead87f86be91aa6749d9b81be64e8ea6460fc6a491d100966ebe10189ae46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): core/incremental/vdbe_maintenance/join.rs:1307-1317 | core/incremental/vdbe_maintenance/set_op.rs:886-896 | core/incremental/vdbe_maintenance/set_op.rs:984-994 | core/translate/insert.rs:1287-1297 \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 \u0060core/incremental/vdbe_maintenance/join.rs:1307\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b30a56f405135ba30b6a39ddc0438bfaebf30c601128c1d1ceae71d06f29cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): core/vector/operations/distance_cos.rs:15-25 | core/vector/operations/distance_dot.rs:15-25 | core/vector/operations/distance_l2.rs:15-25 | core/vector/operations/jaccard.rs:7-17 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vector/operations/distance_cos.rs:15\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vector/operations/distance_cos.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0d54147ceacf6e79f5d5a80d77c35c78ff1236c8ef09dfba8ae391e7b7bdfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): testing/sqltest/src/main.rs:378-388 | testing/sqltest/src/main.rs:391-401 | testing/sqltest/src/main.rs:448-458 | testing/sqltest/src/main.rs:469-479 \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 \u0060testing/sqltest/src/main.rs:378\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/main.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e41e9894b9d80ed5358358aead9a443cbd3427f643b2271dc9ee8978eb6edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:537-555 | bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs:1024-1042 | bindings/dotnet/src/Turso.Data/TursoDataReader.cs:342-360 \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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b777d3f97a964b8e531a153b5a8a6c0c4fc1aefe4d983f9a8d033a4d29d1ede5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/incremental/vdbe_maintenance/linear.rs:455-465 | core/incremental/vdbe_maintenance/source.rs:177-187 | core/incremental/vdbe_maintenance/stream.rs:260-270 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/linear.rs\u0060 and \u0060core/incremental/vdbe_maintenance/source.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"59ce3102ba880eac529cc97feb010e60cb20cce0e973cac36f15dada58800ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/time/mod.rs:455-465 | core/time/mod.rs:476-486 | core/time/mod.rs:497-507 \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":"core/time/mod.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e3bea502ce510f3a1664cf476fd4daa02bd37a5a71797bf46d5f9736806b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): core/translate/alter.rs:1655-1665 | core/translate/alter.rs:2297-2307 | core/translate/alter.rs:3197-3206 \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 \u0060core/translate/alter.rs:1655\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/translate/alter.rs:3208\u0060 calls \u0060emit_string8_new_reg\u0060, \u0060to_string\u0060, \u0060mark_last_insn_constant\u0060 and \u0060core/translate/alter.rs:1667\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":"core/translate/alter.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa3cdc90983e57b369891e368c08f7c7e8c657b4812179be4638bf76498446b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): core/translate/display.rs:192-202 | core/translate/display.rs:307-316 | core/translate/display.rs:427-436 \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 \u0060core/translate/display.rs:192\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, \u0060core/translate/display.rs:203\u0060 calls \u0060utilizes_covering_index\u0060 and \u0060core/translate/display.rs:317\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":"core/translate/display.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4ff3bba5232a5e5d1d30552f3cd76c7c3f4d8ed97e0707489d922ac98d15b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): core/translate/schema.rs:1345-1355 | core/translate/schema.rs:1458-1467 | core/translate/view.rs:461-470 \u2014 before extracting anything, compare \u0060core/translate/schema.rs\u0060 and \u0060core/translate/view.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"276153dc45b5e5a51d7021ab79d124675356fd83b71e01a979cff0a789f29f5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 3): core/translate/subquery.rs:1926-1963 | core/translate/subquery.rs:2025-2062 | core/translate/subquery.rs:2155-2192 \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 \u0060core/translate/subquery.rs:1926\u0060 it does not close everything it opens, so those exact lines 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":"core/translate/subquery.rs"},"region":{"startLine":1926}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d22a49cf94fcc6ddb4f2d0f626b81754ebeec55bdb15e904bc5e93c18ba7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): testing/differential-oracle/sql_gen/src/generate/stmt.rs:241-251 | testing/differential-oracle/sql_gen/src/generate/stmt.rs:376-386 | testing/differential-oracle/sql_gen/src/generate/stmt.rs:712-722 \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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91c5bd597d4f6a30483b491f2ed180740a4ae3778af9ba168e3d808fc600646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): testing/sqltest/src/runner/mod.rs:118-128 | testing/sqltest/src/runner/mod.rs:187-197 | testing/sqltest/src/runner/mod.rs:306-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19c652f8b220a65fce08fc6e41c69c3e936eec90f2872ec59a946a822c06193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): bindings/c/src/lib.rs:2046-2056 | bindings/c/src/lib.rs:2117-2127 \u2014 both copies are in the same file, so extract the block 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":"bindings/c/src/lib.rs"},"region":{"startLine":2046}}}],"partialFingerprints":{"codehealthFindingId/v1":"4401ff5301b3895f207fa3a0b633e13b134ed100f8b5e19562cbfbe362e2bcf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): bindings/javascript/sync/src/js_protocol_io.rs:259-269 | sync/sdk-kit/src/sync_engine_io.rs:331-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 \u0060bindings/javascript/sync/src/js_protocol_io.rs:259\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":"bindings/javascript/sync/src/js_protocol_io.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4365c3b1e083d6c38fff61afc464dcbfcda3d896c2f4585f226277ee34b5725f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): bindings/rust/src/transaction.rs:202-212 | serverless/rust/transaction.rs:193-203 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060bindings/rust/src/transaction.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":"bindings/rust/src/transaction.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6c82ff37de90b608e0a99146a1fe48191c3dec9c188e845f0bec06a794099c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/app.rs:2238-2248 | cli/app.rs:2251-2261 \u2014 both copies are in the same file, so extract the block 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":"cli/app.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"22cb338600a2f7a6c220611d32e59935ecb8d8bc1244c8c5a6a7512778848940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/connection.rs:834-844 | core/connection.rs:885-895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4bb5d733b8573812f75260120dfeba96bf56e9c78c04488d9bd02a942bea654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:1039-1049 | core/incremental/vdbe_maintenance/arrangement.rs:413-423 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.rs:1039\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fadbe38165f09d2977da95b98c1f34ab77e8a0d90cabeb0f1e0f745fb2deb1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:406-416 | core/incremental/vdbe_maintenance/linear.rs:120-130 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/arrangement.rs:406\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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea5757b3c21f0c740c3d2986a0dff83d92914aa7d5e90b3d24e9da3cd3a7d418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): core/incremental_blob.rs:493-503 | core/incremental_blob.rs:510-520 | core/incremental_blob.rs:523-532 \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 \u0060core/incremental_blob.rs:493\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":"core/incremental_blob.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5ec7a91d5f29e81c093475aa40ef82576897457c2a1e9f6ebd558211b6587f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/io/memory.rs:60-70 | core/io/memory_yield.rs:65-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/io/memory.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":"core/io/memory.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39f4522ce74682cb0c41ac09522abdf91249862abf686bec471eaf97cf7aff3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/io/win_iocp.rs:781-791 | core/io/win_iocp.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 \u0060core/io/win_iocp.rs:781\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/win_iocp.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"121842c352186f77fa9bf83c52186f250ebcd243c880bab0158947958737ca95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/json/jsonb.rs:2006-2016 | core/json/jsonb.rs:2080-2090 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:2006\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":"core/json/jsonb.rs"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd31278e7d64ab3d2a3e1fb3da4a717b5be73827d77a18820544a5eec91c7657"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): core/json/jsonb.rs:4111-4120 | core/json/jsonb.rs:4127-4137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:4111\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":4111}}}],"partialFingerprints":{"codehealthFindingId/v1":"df48b115e44f02d3e1248313cfc2d0afd67313c629dffefec043453dadd9aee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): core/json/mod.rs:515-524 | core/json/mod.rs:542-552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/mod.rs:515\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/json/mod.rs:513\u0060 calls \u0060as_value_ref\u0060 and \u0060core/json/mod.rs:540\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":"core/json/mod.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0670aa773c775404290a90220cc234af9bb8f80d79f7cfaf2fdfb397425aa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/mvcc/database/mod.rs:10270-10280 | core/mvcc/database/mod.rs:10414-10424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":10270}}}],"partialFingerprints":{"codehealthFindingId/v1":"8482e40438c61b587aeaf6265416faeb8309198021e4e2ecbbbc0572d3a22948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/mvcc/persistent_storage/logical_log.rs:1178-1188 | sync/engine/src/database_sync_operations.rs:1025-1035 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/mvcc/persistent_storage/logical_log.rs:1178\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b5e928ca3efca88da86a7b5b253400d8941a4d7dd968b9862c5831f28bafe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/storage/btree.rs:5223-5233 | core/storage/btree.rs:5303-5313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:5223\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":"core/storage/btree.rs"},"region":{"startLine":5223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b9a0a2a7a8d57d83dc87babce37f3055578a408cb91413099dc213215bf6b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/storage/shared_wal_coordination.rs:2482-2492 | core/storage/shared_wal_coordination.rs:2539-2549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/shared_wal_coordination.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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":2482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a151d270488de3d723b29e549c067dc382b1ecacd359f2697afd9e30a04c71d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/time/mod.rs:819-829 | core/time/mod.rs:833-843 \u2014 both copies are in the same file, so extract the block 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":"core/time/mod.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"073bf51596951d5c02e39685549db17f962fcafd26b8fc7490d3f8ab4131c300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): core/translate/compound_select.rs:68-77 | core/translate/compound_select.rs:105-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 \u0060core/translate/compound_select.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/translate/compound_select.rs:78\u0060 calls \u0060add_comment\u0060, \u0060offset\u0060 and \u0060core/translate/compound_select.rs:116\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":"core/translate/compound_select.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"109111720a0dfe8e99bc3acd1390d901cf7fc2a6f6edeae8a068fb75f6479d63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): core/translate/delete.rs:63-73 | core/translate/insert.rs:99-107 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/delete.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":"core/translate/delete.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"872a76b95ef2f3727ba2e7bd88b959e96d4bc0f11c217a3ce27aebcb4c151e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/emitter/mod.rs:1577-1587 | core/translate/emitter/mod.rs:1699-1709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"7285050c9e22260058a3082b7e95f856e6625e37c8220cd6aa36d92a60e18872"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/expr/binding.rs:143-153 | core/translate/expr/binding.rs:215-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 \u0060core/translate/expr/binding.rs:143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binding.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ace9ce214796dbe429b391609531d9fc1638e848621bdf58221aa31fa1e5be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/index.rs:1503-1513 | core/translate/view.rs:674-684 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"core/translate/index.rs"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12cfa44c8f7bd11874469c7c82febd2c03e4736333f1e0014eddae061b2e8d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/index.rs:1570-1581 | core/translate/schema.rs:2618-2628 \u2014 before extracting anything, compare \u0060core/translate/index.rs\u0060 and \u0060core/translate/schema.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other 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, \u0060core/translate/index.rs:1583\u0060 calls \u0060allocate_label\u0060 and \u0060core/translate/schema.rs:2629\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":"core/translate/index.rs"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79f038414ab47a5f1648a5991ddd026db9d4da752f471bb5e25909bb924bc78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/insert.rs:90-101 | core/translate/update.rs:306-316 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/insert.rs:90\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7829a3da6429c336cdb0e01021029d1ec8cb7cf5e6693ba62e12e3ed46cc6c4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/insert.rs:3851-3861 | core/translate/sequence.rs:873-883 \u2014 before extracting anything, compare \u0060core/translate/insert.rs\u0060 and \u0060core/translate/sequence.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":"core/translate/insert.rs"},"region":{"startLine":3851}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c0dbdefc6d7d5e41298a88978d3fca272d31d84dae175fa3203bb3111ce5cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/optimizer/mod.rs:4693-4703 | core/translate/optimizer/mod.rs:4869-4879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/mod.rs:4693\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":"core/translate/optimizer/mod.rs"},"region":{"startLine":4693}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98af4c237169061e646a2fd465298ebcb67fd3f9cd73b3452063847424070d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/optimizer/unnest.rs:1096-1106 | core/translate/optimizer/unnest.rs:1110-1120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/unnest.rs:1096\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/unnest.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5dd1602e2bff9a283e768b1dac091730c16bcbd30050f22c73f37399f820eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/planner.rs:651-661 | core/translate/planner.rs:749-759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/planner.rs:651\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"8348552ba31065bdd94978299c741347d1ea68864f04d7268a236636dc8c1be7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/schema.rs:3341-3351 | core/translate/schema.rs:3358-3368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/schema.rs:3341\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":3341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3eff59b2a9061117701f5f714196be6d8f7bcf8407f7b5d14e74e1631a766f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/upsert.rs:1244-1254 | core/translate/upsert.rs:1372-1382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/upsert.rs:1244\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":"core/translate/upsert.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7f8035b5d2574dc264aba2fe07fadfeb6495c3c22913a2f767c45fee158284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/types.rs:2259-2269 | core/types.rs:2275-2285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/types.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"293800a42304daf69e8725d3472827ca0133bf05bc60b9807382259eda8cf1e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/vdbe/array.rs:582-592 | core/vdbe/array.rs:601-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/array.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"608f12717cb1bd141ea3aad26417bc955c3247ceaad9a14c162dc91c83972cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/vdbe/hash_table.rs:1671-1681 | core/vdbe/hash_table.rs:1847-1857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:1671\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f0f11de165e0d2ce163a731a238699891ee183b47eeeb641e0d800db656334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): core/vdbe/hash_table.rs:2163-2171 | core/vdbe/hash_table.rs:2175-2185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:2175\u0060 it begins part-way through the construct above it, so those exact lines 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":"core/vdbe/hash_table.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"218495facb5a636ef29e91dffa55229b0e536b1da9c76c1e0a8dd274751cd639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/vdbe/hash_table.rs:2291-2301 | core/vdbe/hash_table.rs:2392-2402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a815bd18cc46d9ee2dbe880ca0b5ce7d5054e8f0afd0aa1bf4c3530cc9a3f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): extensions/fuzzy/src/editdist.rs:98-108 | extensions/fuzzy/src/editdist.rs:115-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060extensions/fuzzy/src/editdist.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":"extensions/fuzzy/src/editdist.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"875acfb08412a1a5b89c6a8131272acedd5d2bafb93b6a20d1591fffb1643886"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): macros/src/ext/mod.rs:29-39 | macros/src/ext/mod.rs:63-73 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060macros/src/ext/mod.rs:29\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":"macros/src/ext/mod.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"500823a61e65de27bc7e9519aef1ea5a7c7b438f2473ff02f3a6e1656d7ab616"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): postgres/parser/parser.rs:869-879 | postgres/parser/parser.rs:887-897 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/parser.rs:869\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92ddffb5f20f6675c1eb6b6f5f45521b3ef261b98a39e7dc01955d2bb803814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sdk-kit/src/rsapi.rs:1352-1362 | sdk-kit/src/rsapi.rs:1410-1420 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk-kit/src/rsapi.rs:1352\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk-kit/src/rsapi.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8368145324ae36c577b11927619a7276638ac3d5881438dc70538109fd6ca4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sql_generation/generation/query.rs:440-450 | testing/simulator/generation/property.rs:1675-1685 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060sql_generation/generation/query.rs:440\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":"sql_generation/generation/query.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5592f4cada8359a428bca534a2a82718091a11c0bba8e3ef34d9a69f12d3931c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): sqlite/parser/src/lexer.rs:907-916 | sqlite/parser/src/lexer.rs:940-950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/lexer.rs:907\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/lexer.rs"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bbe789bd176dc9e75c5c84a218cd6e5a3a2d643d98e75e61a6ffe17c68a4685"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sqlite/parser/src/parser.rs:497-507 | sqlite/parser/src/parser.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 \u0060sqlite/parser/src/parser.rs:497\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":"sqlite/parser/src/parser.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28003a5c8dbb5482358de264487e7570548387329a8cb21d52f1bdcee7e1338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sqlite/parser/src/parser.rs:954-964 | sqlite/parser/src/parser.rs:3769-3779 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc65037a6cde6cbb6ab268c4e3f55ad2984b1bbf9e977c3c1074e6b69244236d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sqlite/parser/src/parser.rs:1520-1530 | sqlite/parser/src/parser.rs:2378-2388 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/parser.rs:1520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d8312b9e5a6b438c034caf9d6550c596f9a9c3966650daf0069752568e6a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sync/engine/src/database_sync_engine.rs:2068-2078 | sync/engine/src/database_sync_engine.rs:2838-2848 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"579094cee88f7d2107b2ec6ae0eed855b0045ee29c869bcc16070f10cb239927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/differential-oracle/sql_gen/src/generate/literal.rs:24-34 | testing/differential-oracle/sql_gen/src/generate/literal.rs:151-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen/src/generate/literal.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060testing/differential-oracle/sql_gen/src/generate/literal.rs:20\u0060 calls \u0060gen_bool_with_prob\u0060 and \u0060testing/differential-oracle/sql_gen/src/generate/literal.rs:150\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":"testing/differential-oracle/sql_gen/src/generate/literal.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5295caa7bd9edbf2d228236f9f329bba4ec64d22141dc9fd739fefa47d4ee6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/simulator/common/mod.rs:24-34 | testing/simulator/runner/differential.rs:188-198 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"testing/simulator/common/mod.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fdf34589a025d66f315c4f8795d9cded01d20d882f06e84d3511ee5b09014f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/simulator/generation/property.rs:1950-1960 | testing/simulator/generation/property.rs:1974-1984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.rs:1950\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f78ae040fd8bbf48e45a3bc008f3b184262fe66adef646f5b1a07d6ec482112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): testing/simulator/model/interactions.rs:617-627 | testing/simulator/model/interactions.rs:752-761 \u2014 both copies are in the same file, so extract the block 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 first that the copies are not typed on the same thing: the declarations holding them bind \u0060conn\u0060 to \u0060\u0026mut Arc\u003CConnection\u003E\u0060 in one and \u0060Arc\u003CConnection\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":"testing/simulator/model/interactions.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc2c510af0f3c556485bc9e4137be909a9fbf300dbd5ead369ca0aec344e665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/sqltest/src/main.rs:808-818 | testing/sqltest/src/main.rs:822-832 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/main.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c785429121365db41b62af9e8870d01521c0dbe117f1949c9148e481f08de66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): testing/sqltest/src/snapshot/mod.rs:508-518 | testing/sqltest/src/snapshot/mod.rs:534-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/snapshot/mod.rs:508\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaa222c00961f4628c4de83e14de14cca7f7472bf6d500a43abcc16a6fa0dac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): testing/stress/main.rs:373-383 | testing/stress/main.rs:398-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 \u0060testing/stress/main.rs:373\u0060 it does not close everything it opens, so those exact lines 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":"testing/stress/main.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"7abb3ab1a7eca9a42030891aaec90bca10dc64cdcee3d10f7ecdc9d8a6c6fe7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): extensions/fuzzy/src/lib.rs:19-28 | extensions/fuzzy/src/lib.rs:83-92 | extensions/fuzzy/src/lib.rs:178-187 | extensions/fuzzy/src/lib.rs:199-208 | extensions/fuzzy/src/lib.rs:232-241 | extensions/fuzzy/src/lib.rs:331-340 \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. 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":"extensions/fuzzy/src/lib.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7f0e933d1893d2bb75fd31df410d6f5b3820ed81baf5e59c58a995f750c928"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): core/functions/datetime.rs:746-755 | core/functions/datetime.rs:757-766 | core/functions/datetime.rs:768-777 | core/functions/datetime.rs:779-788 \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. 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":"core/functions/datetime.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9aa2b415a511ed92f14a23d11db001dbd511c1fe964c8cbd4268098b1a1c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): core/incremental/vdbe_maintenance/linear.rs:193-203 | core/incremental/vdbe_maintenance/linear.rs:467-476 | core/incremental/vdbe_maintenance/set_op.rs:191-201 | core/incremental/vdbe_maintenance/source.rs:189-198 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/linear.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 71 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.rs:193\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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"37124e512f19347f84075932050a3187a3288621a85357de9aba4702ac8160f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): core/index_method/toy_vector_sparse_ivf.rs:523-532 | core/index_method/toy_vector_sparse_ivf.rs:786-795 | core/index_method/toy_vector_sparse_ivf.rs:1065-1074 | core/index_method/toy_vector_sparse_ivf.rs:1569-1578 \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 \u0060core/index_method/toy_vector_sparse_ivf.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. 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e383f5ce85f2952b508de1e2ccfee22976f3e22058434fb776eb6c6bf00102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): core/vdbe/hash_table.rs:2290-2299 | core/vdbe/hash_table.rs:2317-2326 | core/vdbe/hash_table.rs:2356-2365 | core/vdbe/hash_table.rs:2391-2400 \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 \u0060core/vdbe/hash_table.rs:2290\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0744f9d04910c56be031a33ac6a2d1895b48bc41796ad1826bbc6d33e3fdba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): testing/concurrent-simulator/worker.rs:99-109 | testing/concurrent-simulator/worker.rs:123-132 | testing/concurrent-simulator/worker.rs:139-149 | testing/concurrent-simulator/worker.rs:162-172 \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 \u0060testing/concurrent-simulator/worker.rs:99\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b18f16508236c6979f6557888dea8f9ad93cc2dbcad9cdc38d8cd4638292ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): testing/sqltest/src/backends/cli.rs:122-132 | testing/sqltest/src/backends/js.rs:89-99 | testing/sqltest/src/backends/rust.rs:116-126 | testing/sqltest/src/backends/tursopg.rs:85-94 \u2014 before extracting anything, compare \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/js.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/backends/cli.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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7eae98383fc04f84ec47a8766caa85ce2f001abaccf4ace1e47982da0d287f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): bindings/java/rs_src/turso_statement.rs:164-173 | bindings/java/rs_src/turso_statement.rs:192-201 | bindings/java/rs_src/turso_statement.rs:220-229 \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 \u0060bindings/java/rs_src/turso_statement.rs:192\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"bindings/java/rs_src/turso_statement.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8adf5bac03ec40c1840bd2cb2362dd88bd28370fc37ff5dc47c5344244ca769"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/incremental/vdbe_maintenance/aggregate.rs:762-771 | core/incremental/vdbe_maintenance/set_op.rs:731-740 | core/incremental/vdbe_maintenance/sink.rs:151-162 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 10 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 \u0060core/incremental/vdbe_maintenance/aggregate.rs:762\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ce6cd11b9c5a5c6ed6123317768888a1b70aa2a192cf57acf026dfee7cce61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/time/internal.rs:146-155 | core/time/internal.rs:160-169 | core/time/internal.rs:174-183 \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 \u0060core/time/internal.rs:146\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/time/internal.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c38d1d52cb5d7d3e0c05431c1fb49418b10495534619d7b7cf73b8b0d655c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/translate/display.rs:126-135 | core/translate/display.rs:249-258 | core/translate/display.rs:364-373 \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 \u0060core/translate/display.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":"core/translate/display.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b9ced1679e274eb96a25cb6ab95d628e54e425124d162952cf56219a2feb9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/vdbe/execute.rs:11854-11864 | core/vdbe/execute.rs:11876-11886 | core/vdbe/execute.rs:12044-12054 \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":"core/vdbe/execute.rs"},"region":{"startLine":11854}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c7767a2f6098394fc9e22bdda587149966c8b51a3d095eefc704e811ae5e635"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): testing/simulator/generation/property.rs:783-791 | testing/simulator/generation/property.rs:928-936 | testing/simulator/generation/property.rs:1007-1016 \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":"testing/simulator/generation/property.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efc87d4ed155ddb5e8f56fba807c241e7b977cb1e7697efbf9737866494c72b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): testing/simulator/main.rs:500-509 | testing/simulator/runner/differential.rs:26-35 | testing/simulator/runner/doublecheck.rs:22-31 \u2014 before extracting anything, compare \u0060testing/simulator/runner/differential.rs\u0060 and \u0060testing/simulator/runner/doublecheck.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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, \u0060testing/simulator/runner/differential.rs:37\u0060 calls \u0060clone\u0060 and \u0060testing/simulator/main.rs:511\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":"testing/simulator/main.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2104a85a9e6868431906223b85c864e12ae2362805e2ae7a1ecb73c4ed957987"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cli/app.rs:1309-1319 | postgres/cli/main.rs:732-742 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060cli/app.rs:1309\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":"cli/app.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ad2c8a0467c445bae928b45b463c763bb0844acf13b48a3bbddc914c9b6c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/functions/printf.rs:1119-1128 | core/functions/printf.rs:1183-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 \u0060core/functions/printf.rs:1119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/printf.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"926a97f388800537b4028ec019782c2bb925489ba9fe35c655b264a53aa27a7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:141-150 | core/incremental/vdbe_maintenance/consolidate.rs:89-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 \u0060core/incremental/vdbe_maintenance/arrangement.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060core/incremental/vdbe_maintenance/arrangement.rs:138\u0060 calls \u0060emit_int\u0060 and \u0060core/incremental/vdbe_maintenance/consolidate.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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"26057743d17b0acb34bb17289d6eaf38252d7b4a66f4efa4decb701934be84d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:389-398 | core/incremental/vdbe_maintenance/set_op.rs:181-190 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/arrangement.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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2620a837e16c604f7b2dfaf4a9614d10542e986cf9232aec5bace64d6e353fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): core/incremental/vdbe_maintenance/linear.rs:65-74 | core/incremental/vdbe_maintenance/linear.rs:153-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/linear.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":"core/incremental/vdbe_maintenance/linear.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd811b57ae93dc62015be56eb17c82869c956b43e100d056beb1fc7657929381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:1334-1343 | core/index_method/toy_vector_sparse_ivf.rs:1352-1361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:1334\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":1334}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b62fe74e4dd1a6fbe96e87adabbffb8a1ff077881ad26cd300d5c8a5352b411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/io/io_uring.rs:859-868 | core/io/unix.rs:502-511 \u2014 before extracting anything, compare \u0060core/io/io_uring.rs\u0060 and \u0060core/io/unix.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 \u0060core/io/io_uring.rs:859\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/io_uring.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8d90925dde5a0dfa237d92e057a028fca5563c36a8917717ed583f5933d462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/json/jsonb.rs:1676-1685 | core/json/jsonb.rs:1774-1783 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:1676\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82d44cde7651b4ce1090dadb5b602d0bd45e7199dd9bca896d9f0830ba9873e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/json/mod.rs:288-297 | core/json/mod.rs:308-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/mod.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"741c87324e20819c5cf2f9e300ce09f633e527119a552e1a45188d260f03d984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/json/mod.rs:1108-1117 | core/translate/eqp.rs:621-630 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/json/mod.rs:1108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/mod.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1edeae90892f9c8864a8c33e4f657a7e1b2bd86c3ff986cf7b2b45483e4dfb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/mvcc/database/mod.rs:3832-3841 | core/mvcc/database/mod.rs:3924-3933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:3832\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":"core/mvcc/database/mod.rs"},"region":{"startLine":3832}}}],"partialFingerprints":{"codehealthFindingId/v1":"98832dc0b080bdccf4e1d1c247853560e67aa5e5c0e2b0c3f5eeb432aae879e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/mvcc/database/mod.rs:5655-5664 | core/mvcc/database/mod.rs:5841-5850 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:5655\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":5655}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce65ce5eab60f7d510efabebf3559886684f1525e0c90e5c9e4c296d7cfb9ba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/schema.rs:7377-7386 | core/schema.rs:8248-8257 \u2014 both copies are in the same file, so extract the block 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":"core/schema.rs"},"region":{"startLine":7377}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b498a3418c3a3f703766632be47171207ba3e24ceb98b7c5c2d9d929a626da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/statement.rs:883-893 | core/statement.rs:916-926 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/statement.rs:883\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"c89b9fca073673305808701b898f54a9afad2eb0f08e42055cdf6289d0a3746d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): core/storage/btree.rs:2205-2213 | core/storage/btree.rs:2476-2485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:2205\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4d6645d12b0b81a9e30dfb63bc8bb1a4f80054ee2214a05e3b759ef792c97f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/storage/btree.rs:2382-2391 | core/storage/btree.rs:3011-3020 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/btree.rs:2382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2382}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e55eef04b6ecae7dcebbb2aa2f382e539f21e92e608aad188379de43670ab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/storage/shared_wal_coordination.rs:982-991 | core/storage/shared_wal_coordination.rs:1048-1057 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"029163a6382b0c6e50a532c03a9a7adb786d05a357ce862ee3fe1c2d25653f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/storage/sqlite3_ondisk.rs:858-867 | core/storage/sqlite3_ondisk.rs:896-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead71ae489a1d52a74ecdf3d7b61abfaa225e90fa2bd64549ef4737c10e31e68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/aggregation.rs:769-778 | core/translate/aggregation.rs:797-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/aggregation.rs:769\u0060 it does not close everything it opens, so those exact 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, \u0060core/translate/aggregation.rs:796\u0060 calls \u0060expect\u0060 and \u0060core/translate/aggregation.rs:767\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":"core/translate/aggregation.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"51bb1be0829ccd9d21780627d1eed233928d9d12e0969207d3a9bc28b1460874"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/alter.rs:1199-1208 | core/translate/alter.rs:1415-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 \u0060core/translate/alter.rs:1199\u0060 it begins part-way through the construct above it, so those exact 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":"core/translate/alter.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ac0ab3dadbe688138821e316b337b0d188d1df7c3bf1d12da8bcd8225fe626"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/alter.rs:3299-3308 | core/translate/alter.rs:3377-3386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:3299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":3299}}}],"partialFingerprints":{"codehealthFindingId/v1":"20ed92930d80ae528c434223a74d190fc5d6f6b51ac7499ff0f05536cac5e78e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/alter.rs:4040-4049 | core/translate/alter.rs:4615-4624 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:4040\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/translate/alter.rs:4627\u0060 calls \u0060iter_mut\u0060 and \u0060core/translate/alter.rs:4050\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":"core/translate/alter.rs"},"region":{"startLine":4040}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a9571b22037f4d52b2eb83615d4f7d6abf6b26bd340b4c48bd0ae625ffe93e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/expr/translator.rs:1765-1774 | core/translate/expr/translator.rs:2066-2077 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/translator.rs:1765\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9f60d8343c42a9261e9948ce87fa2d257fd7cf3c576ccd81a78455b2691cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/expr/walk.rs:70-79 | core/translate/expr/walk.rs:429-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 \u0060core/translate/expr/walk.rs:70\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":"core/translate/expr/walk.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fbab22f30b2ff4f8e76050c78f51734a7803c483fdb609c4d808c1b3708bdd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/optimizer/mod.rs:1462-1471 | core/translate/stmt_journal.rs:252-261 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/translate/optimizer/mod.rs"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"5726359044cfa6ab1a8781cc15dd7a50617b711270c0752f66d437c413f83b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/plan.rs:2918-2927 | core/translate/plan.rs:2931-2940 \u2014 both copies are in the same file, so extract the block 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":"core/translate/plan.rs"},"region":{"startLine":2918}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03ebda0e4f9a7b1024a701421617be56dc0d1e9397c171a0d63672e2d3fa78e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/planner.rs:603-612 | core/translate/planner.rs:690-699 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/planner.rs:603\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f5b72f3f7905378b857f4e2b0c22534bb059347986fab848080feab5e75b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/planner.rs:2143-2152 | core/translate/planner.rs:2199-2208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/planner.rs:2143\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"d554e2bc6611f99de7a5e217e90648679f6becad99213f37fb6eb9f091063772"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/schema.rs:109-118 | core/translate/schema.rs:124-133 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/schema.rs:109\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f476e12f44f244f0dad030b192da408e784745de5186e905a5f09a4cfb3f33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/schema.rs:376-385 | core/translate/schema.rs:578-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 \u0060core/translate/schema.rs:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"2649a1c71724bdbf234248257a56917757eeb6b0c9d67f69817c302f848c3143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/schema.rs:1080-1092 | core/translate/values.rs:105-114 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/schema.rs:1080\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c998443b12517f9af7403e34cae6f496a8249172543fdc6b90cf47e02f98b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/view.rs:324-333 | core/translate/view.rs:504-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 \u0060core/translate/view.rs:324\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":"core/translate/view.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca0600293548d2124d5dfe857d198ec055faba7319a17379fb8af1c304c6b4bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/window.rs:369-379 | core/translate/window.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/window.rs:369\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/translate/window.rs:517\u0060 calls \u0060Ok\u0060 and \u0060core/translate/window.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":"core/translate/window.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fba8a5a56070010bfedc71a08a33c7c89134e458a9ceee440928df67fb17dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/util.rs:3800-3809 | core/util.rs:3811-3820 \u2014 both copies are in the same file, so extract the block 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":"core/util.rs"},"region":{"startLine":3800}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc619d51b3330658f5b153aa614ff058385a0556aab983e3337435b1a67915e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vdbe/execute.rs:1220-1229 | core/vdbe/execute.rs:13151-13160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad27eadd6f2c49f2203878696957b65f4d0ea98371a1abee81c4baaf2d8c1359"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vdbe/execute.rs:3917-3926 | core/vdbe/execute.rs:4150-4159 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:3917\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":3917}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1b0ca3aff54689f258ce8d9828760c1590117578a5e1314b59d14db7210ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vdbe/execute.rs:17548-17557 | core/vdbe/execute.rs:17656-17665 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:17548\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":17548}}}],"partialFingerprints":{"codehealthFindingId/v1":"304a9be93b017eb8ee7cd24f5ee01c2a24258a3336bd18fb8ef7003051887bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vdbe/hash_table.rs:1631-1640 | core/vdbe/hash_table.rs:1794-1803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:1631\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef74b588b9059eb2c075d13f30f12599a1aa769ebe811bceed7d51ee5cbb1374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vdbe/hash_table.rs:1629-1638 | core/vdbe/hash_table.rs:1644-1653 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.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":"core/vdbe/hash_table.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"719b26cd80e2debe6a6d754344fb2079c590f4b1970fd8bd70828659575de9e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vdbe/hash_table.rs:2553-2562 | core/vdbe/hash_table.rs:3297-3306 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:2553\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":"core/vdbe/hash_table.rs"},"region":{"startLine":2553}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c68525b7d518f1dc79eebbc6c99a740eb57e40aa9e0fa9211136aa6f7f2e631"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vector/operations/convert.rs:175-184 | core/vector/operations/text.rs:226-235 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vector/operations/convert.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":"core/vector/operations/convert.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"26532a7c103e21af1470f189ab4dfd52ba430149696467825b3388df772980e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vector/operations/distance_cos.rs:67-76 | core/vector/operations/distance_dot.rs:68-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vector/operations/distance_cos.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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4623bf93e31ff232a30f11ca4ea4303dc8ea59dc0bae0b7f7bb650364e71eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vector/operations/text.rs:109-118 | core/vector/operations/text.rs:131-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 \u0060core/vector/operations/text.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":"core/vector/operations/text.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cae2b1501518caa12fe393f97209d8425f4d54a0d9c69e5a30c58ebe2139e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): extensions/fuzzy/src/editdist.rs:155-164 | extensions/fuzzy/src/editdist.rs:171-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 \u0060extensions/fuzzy/src/editdist.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":"extensions/fuzzy/src/editdist.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"2857e1a2714d6fb8078c1aa21706deffff3fe69a192d5cc64561279bbcd57c15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): macros/src/ext/mod.rs:41-50 | macros/src/ext/mod.rs:52-61 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060macros/src/ext/mod.rs:41\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":"macros/src/ext/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b70edcd5d961e18e1b59438d084aa4579f268152e6cdc90afca7bfcb0d6b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): macros/src/ext/scalars.rs:53-60 | macros/src/ext/scalars.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060macros/src/ext/scalars.rs:53\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":"macros/src/ext/scalars.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5040d05d7e194cb711de8b36c93f16413e21cb7c10b6fdac03984ec2a3a17e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): postgres/client/lib.rs:287-296 | postgres/regress/main.rs:1249-1258 \u2014 before extracting anything, compare \u0060postgres/client/lib.rs\u0060 and \u0060postgres/regress/main.rs\u0060 as WHOLE FILES: this scan already matched 7 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/client/lib.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8ea9f869f9de2b5b4ba99ccf8555fb26b7ebda46c4565e06c286345c78275a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): postgres/client/lib.rs:320-329 | postgres/regress/main.rs:1449-1458 \u2014 before extracting anything, compare \u0060postgres/client/lib.rs\u0060 and \u0060postgres/regress/main.rs\u0060 as WHOLE FILES: this scan already matched 7 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/client/lib.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebfc645d79e692c50c8cb14ac6ce238b7816b024c67a0829a98de64d26af9122"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): postgres/parser/translator.rs:1690-1699 | postgres/parser/translator.rs:1800-1809 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:1690\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":1690}}}],"partialFingerprints":{"codehealthFindingId/v1":"59987d6fee639f1e5361ba2eb0a7990fadc4b603ff9384c6caa0f29c11499846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sqlite/parser/src/lexer.rs:410-419 | sqlite/parser/src/lexer.rs:447-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. 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, \u0060sqlite/parser/src/lexer.rs:408\u0060 calls \u0060eat_and_assert\u0060 and \u0060sqlite/parser/src/lexer.rs:446\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":"sqlite/parser/src/lexer.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac84913f2b74ff753b409d9b53babe076aa396a2d1d337a10a7801cadaa85c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sqlite/parser/src/parser.rs:3030-3039 | sqlite/parser/src/parser.rs:3122-3131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/parser.rs:3030\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":3030}}}],"partialFingerprints":{"codehealthFindingId/v1":"93858f8c6d9ca630c49befad6b763642a42ceedb715e13dc170c4ccc27ed1c2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sync/engine/src/database_tape.rs:776-785 | sync/engine/src/database_tape.rs:867-876 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/engine/src/database_tape.rs:776\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_tape.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"c736ebe1045dd2255deccfd788be02c5c38ea91986bf25dea4845359f8e142a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): testing/sqltest/src/snapshot/mod.rs:341-350 | testing/sqltest/src/snapshot/mod.rs:363-372 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/snapshot/mod.rs:341\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06b2374874d03457b546cc75dc1d6bec6ee625766c47341dd3dbd0c25befc1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): core/incremental/vdbe_maintenance.rs:250-258 | core/incremental/vdbe_maintenance/aggregate.rs:175-183 | core/incremental/vdbe_maintenance/join.rs:535-543 | core/incremental/vdbe_maintenance/join.rs:787-795 | core/incremental/vdbe_maintenance/linear.rs:41-49 | core/incremental/vdbe_maintenance/linear.rs:389-397 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"core/incremental/vdbe_maintenance.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7d3f1e40d8c47d801b82a87363ef207454cbc1110676d00dbf9b84dc015fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): core/translate/alter.rs:227-236 | core/translate/schema.rs:2615-2624 | core/translate/schema.rs:2828-2837 | core/translate/schema.rs:3577-3588 | core/translate/sequence.rs:1173-1181 | core/translate/view.rs:729-741 \u2014 before extracting anything, compare \u0060core/translate/schema.rs\u0060 and \u0060core/translate/view.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/translate/alter.rs:242\u0060 calls \u0060alloc_registers\u0060, \u0060emit_column_or_rowid\u0060 and \u0060core/translate/schema.rs:2625\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":"core/translate/alter.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb2b5ed267dfcdf9d237f81ade6e5367b5859948d74266f17f22fdeb2e88a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): core/incremental/vdbe_maintenance/set_op.rs:546-554 | core/incremental/vdbe_maintenance/set_op.rs:737-745 | core/translate/insert.rs:1563-1571 | core/translate/insert.rs:3311-3319 | core/translate/insert.rs:3467-3475 \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 \u0060core/incremental/vdbe_maintenance/set_op.rs:546\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060core/translate/insert.rs:1562\u0060 calls \u0060alloc_register\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs:545\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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9d63a4ecfa3aaeac9e74cf1b4ec6cb3d8ed58296cb472f28c1cc69498a6ded2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): core/translate/pragma.rs:1148-1157 | core/translate/pragma.rs:1187-1196 | core/translate/pragma.rs:1265-1274 | core/translate/pragma.rs:1431-1439 | core/translate/pragma.rs:1496-1504 \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 \u0060core/translate/pragma.rs:1148\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/pragma.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc644b59300b09469ea664e6d6d38490760ff39864f7cda0dd06ccce5423daa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): core/io/generic.rs:21-29 | core/io/io_uring.rs:462-470 | core/io/unix.rs:52-60 | sync/engine/src/sparse_io.rs:24-32 \u2014 before extracting anything, compare \u0060core/io/io_uring.rs\u0060 and \u0060core/io/unix.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/generic.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7830ff64ca77340a8f518955a89e279bb4562437b585e40626b7d6969292601c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): core/vector/operations/text.rs:106-114 | core/vector/operations/text.rs:152-160 | core/vector/operations/text.rs:184-192 | core/vector/operations/text.rs:208-216 \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 \u0060core/vector/operations/text.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. 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":"core/vector/operations/text.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e687bbfb0712fae89318f2e9114e8bf2cfb84ef7b7151bd7ede8489bb5f0469"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/translate/alter.rs:226-234 | core/translate/index.rs:1552-1562 | core/translate/schema.rs:3576-3586 \u2014 before extracting anything, compare \u0060core/translate/index.rs\u0060 and \u0060core/translate/schema.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:226\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"847fbeb1988739ac625e4814577f941be679b13c05c3e1079f121a5169e40c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): core/translate/insert.rs:2196-2203 | core/translate/insert.rs:2230-2238 | core/translate/insert.rs:2601-2608 \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 \u0060core/translate/insert.rs:2196\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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":"core/translate/insert.rs"},"region":{"startLine":2196}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f0ff73f672ece82cecd47d9316c503fab8684b32a8e095784c3c0600e8c5a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/translate/sequence.rs:1045-1053 | core/translate/trigger.rs:585-593 | core/translate/view.rs:226-234 \u2014 before extracting anything, compare \u0060core/translate/sequence.rs\u0060 and \u0060core/translate/trigger.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060core/translate/sequence.rs:1045\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":"core/translate/sequence.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ef69a3a08fe3a3c5afb286b7083efe29c47b857001155b57a49027e5579a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): core/vdbe/execute.rs:8375-8383 | core/vdbe/execute.rs:8413-8421 | core/vdbe/execute.rs:8552-8560 \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 \u0060core/vdbe/execute.rs:8375\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8375}}}],"partialFingerprints":{"codehealthFindingId/v1":"187547e4ffd24b34fd6a4b9adbe2f3b798262c0cf3a2aae9e65798e383539318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): macros/src/ext/vtab_derive.rs:234-242 | macros/src/ext/vtab_derive.rs:249-257 | macros/src/ext/vtab_derive.rs:264-272 \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 \u0060macros/src/ext/vtab_derive.rs:234\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macros/src/ext/vtab_derive.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf1652f1ccf621914e7d3a94d7dacdc1ea3f78580099970341a0582069bb4e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): testing/simulator/model/interactions.rs:616-624 | testing/simulator/model/interactions.rs:751-759 | testing/simulator/model/interactions.rs:815-823 \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 \u0060testing/simulator/model/interactions.rs:616\u0060 it does not close everything it opens, so those exact lines 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 \u0060conn\u0060 to \u0060\u0026mut Arc\u003CConnection\u003E\u0060 in one and \u0060Arc\u003CConnection\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":"testing/simulator/model/interactions.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdf57a75cce3745bbc7624d4e568c73506e781ea6d8d60190050007ac706ef3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/functions/datetime.rs:691-699 | core/functions/datetime.rs:798-806 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"8880f169e2acd9edc468564010733a035a830d7c210ab64df3e1cbc8ade789a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:401-410 | core/incremental/vdbe_maintenance/consolidate.rs:281-289 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/incremental/vdbe_maintenance/arrangement.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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"375ffc7457a408db9584d2fc44c77a8501aafe70a234035c99f39441724af2dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): core/incremental/vdbe_maintenance/members.rs:190-196 | core/translate/schema.rs:2600-2608 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060core/incremental/vdbe_maintenance/members.rs:197\u0060 calls \u0060allocate_label\u0060, \u0060emit_int\u0060 and \u0060core/translate/schema.rs:2609\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":"core/incremental/vdbe_maintenance/members.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82a0b4614d3d8297180cc190669a57ad01872ddeac38c7397ba5c78c46f4df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:593-601 | core/index_method/toy_vector_sparse_ivf.rs:864-871 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:593\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22914fc0abfe7e2b5d65699415bf336abcc8f1cd79da7782ed503b7b832c432"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:867-876 | core/index_method/toy_vector_sparse_ivf.rs:953-961 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:867\u0060 it begins part-way through the construct above it, so those exact lines 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fbabb18db6c08e1186f5f042f49f076814434283bee96466744ea89c4a22fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/io/io_uring.rs:728-736 | core/io/unix.rs:306-314 \u2014 before extracting anything, compare \u0060core/io/io_uring.rs\u0060 and \u0060core/io/unix.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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/io_uring.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b9b36d76901293a98ad06d7bc73c18cf555f5415cad1ca1ad29e5aa32258ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): core/json/jsonb.rs:3363-3371 | core/json/jsonb.rs:3421-3428 \u2014 both copies are in the same file, so extract the block 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 \u0060st\u0060 to \u0060\u0026ArrayIteratorState\u0060 in one and \u0060\u0026ObjectIteratorState\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, \u0060core/json/jsonb.rs:3429\u0060 calls \u0060from_raw_data\u0060 and \u0060core/json/jsonb.rs:3372\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":"core/json/jsonb.rs"},"region":{"startLine":3363}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5cd7adc57b85d3c8598582163a052bf2b80d35f1e09d4e67eb310f390b1a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/mvcc/database/mod.rs:2206-2214 | core/mvcc/database/mod.rs:2283-2296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58f72726653af0cc43060d1fb7a921d9de53ac6fd3d2bdb7489e062e3343a34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/mvcc/persistent_storage/logical_log.rs:3150-3159 | core/mvcc/persistent_storage/logical_log.rs:3341-3349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/persistent_storage/logical_log.rs:3150\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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2f8a6554281fb6d8b6803a9e97ebaf81f0f9688ff7df91da9d48de1db1c37b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/statement.rs:289-297 | core/statement.rs:1055-1063 \u2014 both copies are in the same file, so extract the block 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":"core/statement.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45962ac2b1aad9e2b1d7fa20829c916765592b224d223317e02550b57959726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): core/storage/database.rs:288-295 | core/storage/database.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 \u0060core/storage/database.rs:288\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/database.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10f23e71de792f7d5d9b63933bc1d1ca2acba810a4c3caec1caf9ffab36c7a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/storage/wal.rs:1591-1599 | core/storage/wal.rs:1886-1894 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"c520b71edddbf39fc347f66835c5949d0943aaec8297bc9456a8b466a47572fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/time/internal.rs:453-461 | core/time/internal.rs:462-470 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060core/time/internal.rs:460\u0060 calls \u0060nanosecond\u0060 and \u0060core/time/internal.rs:451\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":"core/time/internal.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4e22d8b11fcb69ad5037d64a5d84e4601d10fc4ad902022d1c14447f64dff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/aggregation.rs:615-624 | core/translate/aggregation.rs:635-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/aggregation.rs:615\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/aggregation.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda29e9cf2fd31814c9174847e57f335b79b1304b4293583c0731bc39ea09a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): core/translate/alter.rs:5140-5147 | core/translate/alter.rs:6027-6035 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:5140\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":"core/translate/alter.rs"},"region":{"startLine":5140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f939b2b51d0435325400369e701210a10ceadf28625cf82615e8deb9237d38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/translate/compound_select.rs:597-605 | core/translate/compound_select.rs:800-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 \u0060core/translate/compound_select.rs:597\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/compound_select.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"f684c3be850148194d5d41ba8eace779706cbc9c9a57445e1ba8ab8e23d2c0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/translate/emitter/update.rs:1847-1855 | core/translate/upsert.rs:870-878 \u2014 before extracting anything, compare \u0060core/translate/emitter/update.rs\u0060 and \u0060core/translate/upsert.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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/emitter/update.rs:1847\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b78e40758b16c4e1faf30e120896d850d64c775592846e51015d25e716518b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/translate/expr/walk.rs:121-129 | core/translate/expr/walk.rs:480-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/walk.rs:121\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/walk.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc359969d8c6b096b17dc4ddcb50302da56e50ae327d05f58ef899befd3e402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/translate/optimizer/mod.rs:1634-1642 | core/translate/schema.rs:2568-2576 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/translate/optimizer/mod.rs:1634\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":1634}}}],"partialFingerprints":{"codehealthFindingId/v1":"b847851ff1b3a855c22c831acb781c8f0f12cd24db4cfa0ca291028e8e719952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/translate/values.rs:57-65 | core/translate/values.rs:146-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":"core/translate/values.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba35ca0c72652b1b5036ef55e13819a843c475307b953cada02e0457a63a1955"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/translate/window.rs:3582-3590 | core/translate/window.rs:3719-3727 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/window.rs:3582\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":3582}}}],"partialFingerprints":{"codehealthFindingId/v1":"5331c2d6a59bc7e5e087d00b857b594e33332b4ee8134a4b6c02dd612e3f63d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/util.rs:3771-3779 | core/util.rs:3802-3811 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/util.rs:3771\u0060 it does not close everything it opens, so those exact lines 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":"core/util.rs"},"region":{"startLine":3771}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b97db33d3f862636575da28a9f436d542301d8dcfe2e7246121013d262dd83f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/util.rs:3769-3778 | core/util.rs:3780-3788 \u2014 both copies are in the same file, so extract the block 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":"core/util.rs"},"region":{"startLine":3769}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbdb753d8a9cc5c2d1ac5ca0a63ea0d259a44dccd59200f6f76415f546a00c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/util.rs:3828-3836 | core/util.rs:3838-3846 \u2014 both copies are in the same file, so extract the block 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":"core/util.rs"},"region":{"startLine":3828}}}],"partialFingerprints":{"codehealthFindingId/v1":"752882a9449eaf0cfeecc767514ab3aeec886ba0b26c7289116e2c477c1a69c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/vdbe/execute.rs:17382-17390 | core/vdbe/execute.rs:17394-17402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":17382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca4f6dee918a7280c9f5eb45a5c07e22a52f1d8d5b5ca46eaeb17179f8736dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/vdbe/hash_table.rs:2567-2575 | core/vdbe/hash_table.rs:3307-3315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:2567\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, \u0060core/vdbe/hash_table.rs:3316\u0060 calls \u0060mark_unlikely\u0060 and \u0060core/vdbe/hash_table.rs:2576\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":"core/vdbe/hash_table.rs"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad0427482d3acce0fa66494c6bb338852c1778c05829426d911c716ec76afdef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vdbe/value.rs:350-359 | core/vdbe/value.rs:960-969 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/value.rs:350\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":"core/vdbe/value.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0e9328f89fcb3e43464c5d4bd75bea60d3179ef509f7de79c54ccbacc2b302"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): macros/src/lib.rs:880-888 | macros/src/lib.rs:930-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060input\u0060 to \u0060BooleanGuidanceInput\u0060 in one and \u0060ComparisonAssertInput\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":"macros/src/lib.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff28458c126880ef6e95ee3d3d74316335b2b934ebaa43e8eeac267d6f1678a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): postgres/frontend/catalog.rs:97-105 | postgres/frontend/catalog.rs:120-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/frontend/catalog.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/catalog.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a950f2358f7970fa1b252b81e2e68e43e2830b434374cee3453f2833d1bd50a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): postgres/frontend/catalog.rs:2035-2043 | postgres/frontend/catalog.rs:2344-2352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/frontend/catalog.rs:2035\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/catalog.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"6591f813a5d5f91a46e538bfb21af18f25bf7eca44e6c1014fcc6a6728c076ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): postgres/frontend/classes.rs:1785-1793 | postgres/frontend/roles.rs:350-358 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060postgres/frontend/classes.rs:1785\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":"postgres/frontend/classes.rs"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"320cffa17ac19678e4156db105d3344a209ac5d6f8f286fb5a112a00cff6d8f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): postgres/frontend/functions.rs:1737-1745 | postgres/frontend/functions.rs:1751-1759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"postgres/frontend/functions.rs"},"region":{"startLine":1737}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ce2ac2605c203c32e0931f792b40eb5a3d16c69392430bde8d38e67b8f8552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): postgres/parser/parser.rs:1819-1827 | postgres/parser/parser.rs:1831-1839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/parser.rs"},"region":{"startLine":1819}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9110b3bb2f6e954eda240a8a0387a32843e0050f60a1c87eb19753023a639b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sdk-kit/src/rsapi.rs:1671-1679 | sdk-kit/src/rsapi.rs:1688-1696 \u2014 both copies are in the same file, so extract the block 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":"sdk-kit/src/rsapi.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0253688e274a71500d52db6170afcbb628cc1d6cd436ed6b548b2ade03b0655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): sqlite/parser/src/lexer.rs:707-714 | sqlite/parser/src/lexer.rs:823-831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/lexer.rs:707\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":"sqlite/parser/src/lexer.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21464b78cf24558b5f312de9c017113c730527aa20715297df966c6f200e6d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): sqlite/parser/src/lexer.rs:749-756 | sqlite/parser/src/lexer.rs:788-796 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/lexer.rs:749\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":"sqlite/parser/src/lexer.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"28297558e4bdb5f341680a92a7aec4648bb8476dc9434973ddaa6b5fe5ba8faa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sync/engine/src/database_replay_generator.rs:428-436 | sync/engine/src/database_tape.rs:831-839 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"409d1b91ec8441879445cbe363ac584922bc57c704c41942e25fba26630fe8dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sync/engine/src/database_sync_engine.rs:672-680 | sync/engine/src/database_sync_operations.rs:2770-2778 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"27062cad32984237daf83a46be5a481dcc8e2ca92a4b21c2f756a10678ae85d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): sync/engine/src/database_sync_operations.rs:2392-2400 | sync/engine/src/database_sync_operations.rs:3689-3696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/engine/src/database_sync_operations.rs:2392\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd6bae61d3a5e49bc723dbb2d49cbc733ba490cf324941e068ceededd99734"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:843-851 | testing/differential-oracle/sql_gen/src/ast.rs:1105-1113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen/src/ast.rs:843\u0060 it begins part-way through the construct above it, so those exact 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, \u0060testing/differential-oracle/sql_gen/src/ast.rs:1104\u0060 calls \u0060not_indexed\u0060 and \u0060testing/differential-oracle/sql_gen/src/ast.rs:842\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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6cfda00e59bee1f958015b231f89adaf944eeec572837376cb68b0f87af521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:870-878 | testing/differential-oracle/sql_gen/src/ast.rs:2053-2061 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b28b2a7c42e9f9b8b69ac2177d528143ed8a3c4b2d23022e71f9a8427568d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/result.rs:35-43 | testing/differential-oracle/sql_gen_prop/result.rs:72-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":"testing/differential-oracle/sql_gen_prop/result.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f68a29627bb0ea8f8f55ba2cdf6211fa26ebf40dbf7c6dd63ec49c437b9a12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/simulator/generation/property.rs:138-146 | testing/simulator/generation/property.rs:180-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 \u0060testing/simulator/generation/property.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":"testing/simulator/generation/property.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e651c24b6878e2e549bfeb0b4af78e513da2d27cdb44978922aae708d43a8948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/simulator/runner/differential.rs:160-168 | testing/simulator/runner/doublecheck.rs:185-193 \u2014 before extracting anything, compare \u0060testing/simulator/runner/differential.rs\u0060 and \u0060testing/simulator/runner/doublecheck.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/runner/differential.rs:160\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/differential.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b962e1903727af86c82afa78dfee737c144f4b0e4648e04c1b14572e892a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/simulator/runner/doublecheck.rs:206-214 | testing/simulator/runner/doublecheck.rs:258-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 \u0060testing/simulator/runner/doublecheck.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":"testing/simulator/runner/doublecheck.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b2ed74c4098e6bd6a3620f230b2bd313cf1b0548bad0ae16e9df76507b7e1c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/simulator/runner/file.rs:101-109 | testing/simulator/runner/memory/file.rs:158-166 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"testing/simulator/runner/file.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c826fafaca63783aaa9987c116c7a7480d454a3afab3383bc7c42bd63522bed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): sdk-kit/src/capi.rs:180-187 | sdk-kit/src/capi.rs:238-245 | sdk-kit/src/capi.rs:270-277 | sdk-kit/src/capi.rs:308-315 | sdk-kit/src/capi.rs:328-335 | sdk-kit/src/capi.rs:365-372 | sdk-kit/src/capi.rs:388-395 | sdk-kit/src/capi.rs:415-422 \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":"sdk-kit/src/capi.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca8b24c8d4491652c696ef4aab0e024f8c018901af3be21312d0813c7ac73af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): postgres/cli/main.rs:298-305 | postgres/cli/main.rs:359-366 | postgres/cli/main.rs:390-397 | postgres/cli/main.rs:422-429 | postgres/cli/main.rs:458-465 | postgres/cli/main.rs:554-561 \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 \u0060postgres/cli/main.rs:298\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, \u0060postgres/cli/main.rs:457\u0060 calls \u0060get_value\u0060, \u0060to_string\u0060 and \u0060postgres/cli/main.rs:297\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/cli/main.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e681b12409e4e5763567cc24ad095054565f62e7636bf309d0f8ae54b80026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/ext/mod.rs:159-166 | core/ext/mod.rs:196-203 | core/ext/mod.rs:228-235 \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":"core/ext/mod.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"70414df79a4330fb777f9fe89080da99b825aed740c5d6cbf87c203b0974ecfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/vdbe/vacuum.rs:800-807 | core/vdbe/vacuum.rs:1088-1095 | core/vdbe/vacuum.rs:1134-1141 \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 \u0060core/vdbe/vacuum.rs:800\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":"core/vdbe/vacuum.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d10df5046c866da22ff927b35858251910f102b4c0c53bf9dbb5193bd21be13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): testing/simulator/generation/property.rs:309-316 | testing/simulator/generation/property.rs:385-392 | testing/simulator/generation/property.rs:521-528 \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 \u0060testing/simulator/generation/property.rs:309\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36cf1b6e9c8271e6304f80b3c6f222b7b8d8add40a429104dfd8469ab7227f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): testing/sqltest/src/runner/mod.rs:1061-1068 | testing/sqltest/src/runner/mod.rs:1135-1142 | testing/sqltest/src/runner/mod.rs:1194-1201 \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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c43948a99616fbd0adaeab08e3261162b4c0490706af9b049363c8fcb3cc74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bindings/rust/src/value.rs:371-378 | serverless/rust/value.rs:335-342 \u2014 before extracting anything, compare \u0060bindings/rust/src/value.rs\u0060 and \u0060serverless/rust/value.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/rust/src/value.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09b0decb0da05fcd3ef374523620557f6d6898615dd69392657663de567530d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/incremental/vdbe_maintenance/aggregate.rs:247-257 | core/translate/schema.rs:2595-2602 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/incremental/vdbe_maintenance/aggregate.rs:247\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"229d9a4d27b3800fea1c1b1b6b946e9133a43cedb16262804dfeeb884291146f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:126-133 | core/incremental/vdbe_maintenance/join.rs:994-1001 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 and \u0060core/incremental/vdbe_maintenance/join.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb6010325b2912f01393a30227f34bd7114ddcc4abdac6b237c768ae342fe09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/json/jsonb.rs:1269-1276 | postgres/frontend/functions.rs:1008-1015 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/json/jsonb.rs:1269\u0060 it does not close everything it opens, so those exact lines 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":"core/json/jsonb.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40abb39ef86b800337b297f6e9b7fedeb0fd5324f36771df686b6672fe33963"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): core/json/mod.rs:443-450 | core/json/mod.rs:471-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 \u0060core/json/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":"core/json/mod.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1a0fdc0ce6bfa18c4d2d1aba48df41d09463ee869d8f2ad762de170f9210d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/mvcc/database/mod.rs:7551-7558 | core/mvcc/database/mod.rs:7590-7597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:7551\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":7551}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dd92da03cfc906e3b2b94e086161dc28cc753f3f36737609aa0c17bf7acef4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/mvcc/database/mod.rs:10336-10343 | core/mvcc/database/mod.rs:10355-10362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:10336\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":10336}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd526b75f56854c46c73c3ea2a7038248cf55b4f4d18feab9c3bee135f29f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/storage/btree.rs:5511-5518 | core/storage/btree.rs:5549-5556 \u2014 both copies are in the same file, so extract the block 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":"core/storage/btree.rs"},"region":{"startLine":5511}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f379403e06d964e127f64298f393914e6f88edc633d7a917dac138e62910797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/storage/encryption.rs:951-964 | core/storage/encryption.rs:976-989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/encryption.rs:951\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/encryption.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e190d9ad253ba8bb5eedd9fb708ec2d5ef752cd58fb7244c02f0c8fbe2dab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/emitter/delete.rs:444-451 | core/translate/fkeys.rs:1265-1275 \u2014 before extracting anything, compare \u0060core/translate/emitter/delete.rs\u0060 and \u0060core/translate/fkeys.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060core/translate/emitter/delete.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. 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":"core/translate/emitter/delete.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14fad396454547a6296e528479aac5bb82e636ce70ed1ecd191bbc80b9b8390"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/eqp.rs:616-623 | core/vdbe/array.rs:252-259 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/eqp.rs:616\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/eqp.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83afc2e3d7c44b0bd61dca0ee4f1d56f90c29c91b792d722273c26c5f546e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): core/translate/expr/translator.rs:1845-1851 | core/translate/expr/translator.rs:2347-2354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/translator.rs:1845\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7dda3389c88f6c5475ce3e33f31a1fcb5ca1b2dbb0a6d256f40c4797de7ad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/expr/translator.rs:3147-3154 | core/translate/expr/translator.rs:3203-3210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/expr/translator.rs:3147\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":3147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffcaf16e5a22ab3fbae5aa04af5b8aff2b943213b8662d05280ec0d0dc42899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/optimizer/lift_common_subexpressions.rs:319-326 | core/translate/optimizer/lift_common_subexpressions.rs:334-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 \u0060core/translate/optimizer/lift_common_subexpressions.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/lift_common_subexpressions.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"a916dee7dbe35d40a8eccdc89c9f82dc2670541077a7248e49032468e44fc397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/schema.rs:2117-2124 | core/translate/view.rs:458-468 \u2014 before extracting anything, compare \u0060core/translate/schema.rs\u0060 and \u0060core/translate/view.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 \u0060core/translate/schema.rs:2117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":2117}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fed30647684663710654b992161788dbd7be30659fc8cd5773b6e69513c593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/subquery.rs:2101-2108 | core/translate/window.rs:1147-1158 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/subquery.rs:2101\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":"core/translate/subquery.rs"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb122af9ee9ede15056a8d3448bff8bac0a4ff77a9999a647d4b9fcdaddfd6b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/trigger_exec.rs:402-409 | core/translate/trigger_exec.rs:1357-1364 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/trigger_exec.rs:402\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/trigger_exec.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce37a685da07713743de2da4be43ca8c7a3c95bfabc572ebf75e8eddde8e27b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/trigger_exec.rs:1374-1381 | core/translate/trigger_exec.rs:1402-1409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/trigger_exec.rs:1374\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/trigger_exec.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba5fac141b43d220a408ca77dada010625dc436c0ea1a0a27a4fb77d113419b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/execute.rs:14797-14804 | core/vdbe/execute.rs:15065-15072 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:14797\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":14797}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbc7e49472ad9e009858b3543a13787fdd27f8dfb27c721d09ac0aab959009e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/explain.rs:1203-1212 | core/vdbe/explain.rs:1230-1237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/explain.rs:1230\u0060 it begins part-way through the construct above it, so those exact lines 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":"core/vdbe/explain.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c58c790579fb653e607ce2384b21527c4f3585a60cf5d02b756caa3482487f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/hash_table.rs:370-377 | core/vdbe/hash_table.rs:383-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 \u0060core/vdbe/hash_table.rs:370\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50a779ab11352ea8a0ea9bfa879d2ed7114048da03f6d1314e5d820594c9f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/mod.rs:3208-3219 | core/vdbe/mod.rs:3225-3232 \u2014 both copies are in the same file, so extract the block 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, \u0060core/vdbe/mod.rs:3220\u0060 calls \u0060end_read_tx\u0060 and \u0060core/vdbe/mod.rs:3233\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":"core/vdbe/mod.rs"},"region":{"startLine":3208}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cce7a1748b0116976a10312447599a48cfa9df251c479c62a311d8ed0e2c856"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vector/operations/jaccard.rs:68-75 | core/vector/operations/jaccard.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. 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 \u0060v1\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":"core/vector/operations/jaccard.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cba56801b1a5122fed792157b18d01ad3b1a5f79536566bf8431d4daf0ded3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): macros/src/ext/vfs_derive.rs:118-126 | macros/src/ext/vfs_derive.rs:191-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 \u0060macros/src/ext/vfs_derive.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macros/src/ext/vfs_derive.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdba01f44a8cd4cfe7bbabb15ca72ee15ba174f0624cd24eb735d418033df789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): macros/src/trace_stack.rs:68-75 | macros/src/trace_stack.rs:78-85 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"macros/src/trace_stack.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc61b2f29aad00de1832035bdc675fbbddaf685b700555da400f0e9b1a3e39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): postgres/cli/main.rs:184-191 | postgres/cli/main.rs:325-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/cli/main.rs:184\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/cli/main.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b217f1deca9cce4e8cd65d17f75437cc6424aca1b5e105453d6250f08d74882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): postgres/frontend/classes.rs:1403-1410 | postgres/frontend/classes.rs:1439-1446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/frontend/classes.rs:1403\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":"postgres/frontend/classes.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"b883cabab942b647852b8559d8d20b597a97ac335858daa667bc1425030c68c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): postgres/parser/translator.rs:685-692 | postgres/parser/translator.rs:1377-1384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:685\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93f6ac2bd68eb0fc02a913b364c72d692457dd61fcad8f9eb5a484d1efc6543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): postgres/parser/translator.rs:3132-3139 | postgres/parser/translator.rs:3160-3167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:3132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":3132}}}],"partialFingerprints":{"codehealthFindingId/v1":"784ad9441af6178eb8c5743d55b50fcf51fde38014c7c98e99177345665614e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): postgres/regress/describe.rs:267-274 | postgres/regress/describe.rs:474-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/regress/describe.rs:267\u0060 it begins part-way through the construct above it, so those exact lines 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":"postgres/regress/describe.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff464dc0a5e0227bea38cb93c5c4bd487ffb9d44af17352814470cc1b42bda55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sqlite/parser/src/parser.rs:4718-4725 | sqlite/parser/src/parser.rs:5452-5459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":4718}}}],"partialFingerprints":{"codehealthFindingId/v1":"f991e0e056686a639845c03220b0759fc12553d03c06335baf8ca00c29331af0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): sync/engine/src/database_sync_lazy_storage.rs:611-617 | sync/engine/src/database_sync_lazy_storage.rs:653-660 \u2014 both copies are in the same file, so extract the block 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":"sync/engine/src/database_sync_lazy_storage.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5909b8bbe8394defd0c18c962010b925aa6bbb0cd4b4b606dcbc94b0d0341a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sync/engine/src/database_sync_lazy_storage.rs:629-636 | sync/engine/src/database_sync_lazy_storage.rs:667-674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_lazy_storage.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a582cc853afaf2c747811c3024279ff20999f5e4192036666ac988205cb9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): sync/engine/src/database_sync_operations.rs:2628-2635 | sync/engine/src/database_sync_operations.rs:2655-2662 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/engine/src/database_sync_operations.rs:2628\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":2628}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a22ef29d1813681296cb364c5113a98a0daee576607893e89ad6f18f053afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/concurrent-simulator/chaotic_elle.rs:254-261 | testing/concurrent-simulator/chaotic_elle.rs:298-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":"testing/concurrent-simulator/chaotic_elle.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee730eb4d06e8b238f9911965b31e92ddc0d5d5cc104c4d09d719b828c5ad1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/concurrent-simulator/lib.rs:1323-1330 | testing/concurrent-simulator/multiprocess.rs:1057-1064 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060testing/concurrent-simulator/lib.rs:1323\u0060 it does not close everything it opens, so those exact 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, \u0060testing/concurrent-simulator/lib.rs:1319\u0060 calls \u0060is_empty\u0060 and \u0060testing/concurrent-simulator/multiprocess.rs:1056\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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"824a5a7cf8660a0062044c65c8f296e12e8c029660bd9e6ed11e482824eeb07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:835-842 | testing/differential-oracle/sql_gen/src/ast.rs:1096-1103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen/src/ast.rs:835\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"00de17f48438436c87ba3d0f162b935a2aca59006c1a2ed12dcc1d01dc5bd63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:1179-1186 | testing/differential-oracle/sql_gen_prop/create_table.rs:398-406 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"59410ea918361f6bb0250178a03e7ac6e9e27bb86f1050c43a85938b2baec050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/simulator/model/mod.rs:845-852 | testing/simulator/model/mod.rs:877-885 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/model/mod.rs:845\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":"testing/simulator/model/mod.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"c194d46fe68c5f7e24007788011a9f0139e7cd753cb9b563f6a79f43d3708165"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): testing/simulator/runner/file.rs:170-176 | testing/simulator/runner/file.rs:228-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 \u0060testing/simulator/runner/file.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/file.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f85a92c7221b766bfe59c413c888f7825900957f8f45ae6e86c6563431a64292"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): core/translate/aggregation.rs:538-544 | core/translate/aggregation.rs:570-576 | core/translate/aggregation.rs:676-682 | core/translate/aggregation.rs:714-720 | core/translate/aggregation.rs:731-737 | core/translate/aggregation.rs:749-755 \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 \u0060core/translate/aggregation.rs:538\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/aggregation.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e27ac907aee00dae5901f5bbd68a26c707f4a40f6bcc6a949904f1a56e0b81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): core/translate/expr/translator.rs:1272-1278 | core/translate/expr/translator.rs:1280-1286 | core/translate/expr/translator.rs:1288-1294 | core/translate/expr/translator.rs:1296-1302 | core/translate/expr/translator.rs:1304-1310 | core/translate/expr/translator.rs:1312-1318 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"0892e921dcf271579f7fb13ac56728d222dbfada54d95c95a25542966485fe7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): core/mvcc/database/mod.rs:5444-5450 | core/mvcc/database/mod.rs:5477-5483 | core/mvcc/database/mod.rs:5525-5531 | core/mvcc/database/mod.rs:5550-5556 \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 \u0060core/mvcc/database/mod.rs:5444\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":5444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fe570177c5d8369b2bb0cf725948e3539aa4118f47f0dd4baa0b616fc31f0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): core/vector/mod.rs:126-132 | core/vector/mod.rs:141-147 | core/vector/mod.rs:156-162 | core/vector/mod.rs:171-177 \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 \u0060core/vector/mod.rs:126\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vector/mod.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9d7e4d76d6e0fe97e77bd080602d58d8f8065717480ba6c420e588f00c02ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): postgres/frontend/classes.rs:1355-1361 | postgres/frontend/classes.rs:1433-1439 | postgres/frontend/classes.rs:1466-1472 | postgres/frontend/classes.rs:1508-1514 \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 \u0060postgres/frontend/classes.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060postgres/frontend/classes.rs:1440\u0060 calls \u0060Register\u0060 and \u0060postgres/frontend/classes.rs:1362\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":"postgres/frontend/classes.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c6259d932e2b73b074951c5bfca82981336f9f10533d5281f23a8f80edc7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/mvcc/database/mod.rs:10337-10343 | core/mvcc/database/mod.rs:10356-10362 | core/mvcc/database/mod.rs:10457-10463 \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 \u0060core/mvcc/database/mod.rs:10337\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":10337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cbda5a06712a7f3c85dc5a88aba84c40ab8c9fa8e7b048af468c8550bb1c08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): postgres/frontend/catalog.rs:2059-2065 | postgres/frontend/catalog.rs:2122-2128 | postgres/frontend/catalog.rs:2200-2206 \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 \u0060postgres/frontend/catalog.rs:2059\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":"postgres/frontend/catalog.rs"},"region":{"startLine":2059}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b235d7711cb0a1b91ea9a060c79da81366113f249865bd7f80ff90cf6280e8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/database.rs:928-934 | core/database.rs:941-947 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae19077e6abe2e6092daadb6fbcec5bcaf542e230d505f89fae7af1be0602ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/incremental/vdbe_maintenance/members.rs:188-194 | core/incremental/vdbe_maintenance/sink.rs:75-81 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/members.rs\u0060 and \u0060core/incremental/vdbe_maintenance/sink.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 after the matched lines, \u0060core/incremental/vdbe_maintenance/sink.rs:82\u0060 calls \u0060emit_int\u0060, \u0060alloc_register\u0060 and \u0060core/incremental/vdbe_maintenance/members.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":"core/incremental/vdbe_maintenance/members.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9b95e1dce0993b6727a0cae73f3e0217f73c8f069da8b4f6e828a01ce8799a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/incremental_blob.rs:489-495 | core/incremental_blob.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental_blob.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3d8ddf578329a44d0c497e3e33611d4c04136ac31f8a7266c42a95ed8fce6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/index_method/fts/mod.rs:3122-3128 | core/index_method/fts/mod.rs:3177-3183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/fts/mod.rs:3122\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/index_method/fts/mod.rs:3172\u0060 calls \u0060ensure_snapshot_loaded\u0060 and \u0060core/index_method/fts/mod.rs:3117\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":"core/index_method/fts/mod.rs"},"region":{"startLine":3122}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0a451698058c1040d6829a298adc57d10e7873a410d5be31debb3a9187b82d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/mvcc/cursor.rs:1016-1022 | core/mvcc/cursor.rs:1104-1110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"e766ae29d99d9c22095bff78416e2bbdb62d9122297477e488a7f7ddb9ce3aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): core/mvcc/persistent_storage/logical_log.rs:2509-2514 | core/mvcc/persistent_storage/logical_log.rs:2526-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 \u0060core/mvcc/persistent_storage/logical_log.rs:2526\u0060 it does not close everything it opens, so those exact lines 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":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":2509}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31146a934b485e85661ad4996aac6aa4e2402bf2c38facc6a8a5e3613efdda2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/schema.rs:6155-6161 | core/schema.rs:6299-6305 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":6155}}}],"partialFingerprints":{"codehealthFindingId/v1":"502dc3f9700b3ba2732c0517c94ad7e70f794e8ed8cfb725742836ed61ed4ee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/storage/wal.rs:5598-5605 | core/storage/wal.rs:5686-5692 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/wal.rs:5598\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":5598}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cefe024956343af5809abaa2c3b91f24b38ffbf235de08aa879fdf165fb3dba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/storage/wal.rs:5927-5934 | core/storage/wal.rs:6006-6012 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/wal.rs:5927\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":5927}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91fcf1fcb3a37351acc28fca0e521452a04a487e96413faed19c38d3663a673"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/translate/emitter/delete.rs:406-413 | core/translate/fkeys.rs:1367-1373 \u2014 before extracting anything, compare \u0060core/translate/emitter/delete.rs\u0060 and \u0060core/translate/fkeys.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060core/translate/emitter/delete.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"59edc9955d8634d11a79a0d46ae0900fb81ebca5eb03aec0a1abb42e3338c7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/translate/emitter/delete.rs:500-506 | core/translate/emitter/delete.rs:937-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"core/translate/emitter/delete.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3d400e448753fbc64abc2bc0c9b98a26276b75f23682a6884c44a43cfafcde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/emitter/mod.rs:2530-2537 | core/translate/emitter/mod.rs:2541-2548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/emitter/mod.rs:2530\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/mod.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bea92f1dc2ac983c20ff9f6fcfc826af42f6fc52e43c4911a0ac78400b2cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/translate/expr/emission.rs:155-162 | core/translate/select.rs:562-569 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/translate/expr/emission.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd485a95c8bd9df993865d305b1e88cf07e1f919337f511e3ef8d97ddcd5a048"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/translate/optimizer/multi_index.rs:239-245 | core/translate/optimizer/multi_index.rs:282-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/multi_index.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":"core/translate/optimizer/multi_index.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0116109de91fbd0c64c1750ade83753b4ddefbe56d762f53c6ec303f7218e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/translate/roles.rs:71-77 | core/translate/roles.rs:198-204 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/roles.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":"core/translate/roles.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d894424fde456bc15ff14e825e2bbaea330a92869447833c8a67917cb5ced6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/vdbe/execute.rs:16281-16287 | core/vdbe/execute.rs:16364-16370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":16281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6547f6692e23c479539ebb27bf66a6c81c0275d276bd2bf407345a619656dfc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): extensions/ipaddr/src/lib.rs:59-65 | extensions/ipaddr/src/lib.rs:72-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"extensions/ipaddr/src/lib.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01116da191734209041ca114bdfe406ed4cc98241a9eaa85c94d7812fe48db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): macros/src/ext/vfs_derive.rs:133-143 | macros/src/ext/vfs_derive.rs:160-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 \u0060macros/src/ext/vfs_derive.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":"macros/src/ext/vfs_derive.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"104dba6d0b256d62aa5e3dca76a6f2513214114bf0928248de4bab580333b622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): postgres/client/lib.rs:276-282 | postgres/regress/main.rs:1601-1607 \u2014 before extracting anything, compare \u0060postgres/client/lib.rs\u0060 and \u0060postgres/regress/main.rs\u0060 as WHOLE FILES: this scan already matched 7 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/client/lib.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"015311220567dcefc216c61c25790d56d58cdc8c20428102fce1447fb338b521"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): postgres/parser/translator.rs:4112-4118 | postgres/parser/translator.rs:4178-4184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":4112}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab160522ae4e70680899fcb574cc825d0287b7046bcbac98bd47d71a776bab9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): postgres/parser/translator.rs:4584-4590 | postgres/parser/translator.rs:4607-4613 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:4584\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":4584}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b768a967fc8bfc4da90c56d3ace24696a1775b307875c928fc9e994f5fc519e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): postgres/parser/translator.rs:5335-5341 | postgres/parser/translator.rs:5350-5356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:5335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":5335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cf404439fa410038ab5e27d965a383cb3448eb322058c12cc57eb700fa9dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): sql_generation/generation/generated_expr.rs:50-55 | sql_generation/generation/generated_expr.rs:98-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 \u0060sql_generation/generation/generated_expr.rs:50\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":"sql_generation/generation/generated_expr.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c181a7d5e8476d335c21851d1a4dfc20107ddf89fc3f75bb2a8cdcb374c47a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): sql_generation/generation/query.rs:271-277 | sql_generation/generation/query.rs:341-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/generation/query.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"410be003ff50d7f19fdb1decddee5acc39b978f5baded31ffd5ea67e68646386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): testing/simulator/generation/property.rs:313-318 | testing/simulator/generation/property.rs:678-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":"testing/simulator/generation/property.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee89fc2d1896230e428ead1c259ea01537c96f04fa686e994aa593f8734c23c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): testing/simulator/generation/property.rs:729-735 | testing/simulator/generation/property.rs:931-936 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.rs:729\u0060 it does not close everything it opens, so those exact lines 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":"testing/simulator/generation/property.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1edf644dfa5f40d35dd9765cb253a144134f9324b2c674934dc9c7b7773fa48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/sqltest/src/runner/mod.rs:333-339 | testing/sqltest/src/runner/mod.rs:426-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/runner/mod.rs:333\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"901a1e5fc815db7ef1b9144a7f36b7849d0c37cdf91e3b00aad0fd45ff9a8c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): core/time/mod.rs:253-259 | core/time/mod.rs:572-578 | core/time/mod.rs:589-595 | core/time/mod.rs:606-612 | core/time/mod.rs:629-635 | core/time/mod.rs:804-809 \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":"core/time/mod.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f352c446055635880d4039c8f43d2668f5715aab5f5092dedac1e8d9e78a4ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): postgres/frontend/classes.rs:1301-1306 | postgres/frontend/classes.rs:1396-1401 | postgres/frontend/classes.rs:1432-1437 | postgres/frontend/classes.rs:1465-1470 | postgres/frontend/classes.rs:1507-1512 \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 \u0060postgres/frontend/classes.rs:1301\u0060 it does not close everything it opens, so those exact 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, \u0060postgres/frontend/classes.rs:1308\u0060 calls \u0060LiteralInt\u0060 and \u0060postgres/frontend/classes.rs:1472\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":"postgres/frontend/classes.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef9fc7c920b6711c66258d976aad94a999ff144fbdec8386f1edc53162e8846"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): testing/simulator/generation/property.rs:728-734 | testing/simulator/generation/property.rs:786-791 | testing/simulator/generation/property.rs:931-936 | testing/simulator/generation/property.rs:1011-1016 \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 \u0060testing/simulator/generation/property.rs:728\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f331a5f5849dad60e764ad1550e0fb07f2c6091b5eb5d65c2342f361f13b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): core/mvcc/database/mod.rs:9468-9474 | core/mvcc/database/mod.rs:9555-9560 | core/mvcc/database/mod.rs:10598-10603 \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 \u0060core/mvcc/database/mod.rs:9468\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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":"core/mvcc/database/mod.rs"},"region":{"startLine":9468}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0fb90debb2d53888b58e01f76644726c206aea3aeb7a8e630b55074047bdab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): core/time/internal.rs:446-451 | core/time/internal.rs:454-459 | core/time/internal.rs:463-468 \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, \u0060core/time/internal.rs:460\u0060 calls \u0060nanosecond\u0060 and \u0060core/time/internal.rs:452\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":"core/time/internal.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"749461be209b9bae0edee0ef1e7c865bea4cbc7e63f71b32917e34159e58bbd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): core/translate/expr/translator.rs:1473-1478 | core/translate/expr/translator.rs:1847-1852 | core/translate/expr/translator.rs:2349-2355 \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 \u0060core/translate/expr/translator.rs:1473\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1473}}}],"partialFingerprints":{"codehealthFindingId/v1":"039c9c338163f75c9fe624b231eb886c1be5323e75674d15d7910597ea0976e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 4): macros/src/ext/vfs_derive.rs:140-145 | macros/src/ext/vfs_derive.rs:167-172 | macros/src/ext/vfs_derive.rs:210-215 | macros/src/ext/vfs_derive.rs:228-230 \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, \u0060macros/src/ext/vfs_derive.rs:228\u0060 calls \u0060__get_cb\u0060 and \u0060macros/src/ext/vfs_derive.rs:140\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":"macros/src/ext/vfs_derive.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d5fb471242a1d1a188744022894faddcc72b1e5f05a80924a36bc85f67fcc1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): testing/simulator/runner/file.rs:145-150 | testing/simulator/runner/file.rs:171-176 | testing/simulator/runner/file.rs:229-235 \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 \u0060testing/simulator/runner/file.rs:145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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":"testing/simulator/runner/file.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a887a63f6fc9b3402525d64eeaa50223b4c52f401135d99a8d426c306d579c57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): bindings/c/src/lib.rs:2085-2091 | bindings/c/src/lib.rs:2093-2099 \u2014 both copies are in the same file, so extract the block 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":"bindings/c/src/lib.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c4146f0e5f5e97de889a9ccabf282b1a318a67b36737bc3a85d6d8f5bae529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/functions/datetime.rs:529-534 | core/functions/datetime.rs:572-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"252f65570ec14ba2971078faabc2d805385807b0e6f64d1ee1fd9f698f3c01fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/io/vfs.rs:172-177 | core/io/vfs.rs:196-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/vfs.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f0cef48d1a0538b9b1aca308ff9717ec617f0f1364856f8f28cf2697179471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/percentile.rs:57-62 | core/percentile.rs:119-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 \u0060core/percentile.rs:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/percentile.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a33aecde94b6c037aed2a9c7d6a12a0f5d328c75eef1dcbef3c708b1afd78cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/schema.rs:7207-7212 | core/schema.rs:7242-7247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:7207\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":7207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3043cfe014766e1f03a40581728336ab4e79a26b8d1612945830c4268af47f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/storage/wal.rs:5849-5854 | core/storage/wal.rs:5982-5987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/wal.rs:5849\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":5849}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0bdfc8a2a704fc744810f4edab5354dc5104e91ef1ea9cea507d5355725834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/translate/fkeys.rs:2618-2623 | core/translate/fkeys.rs:2824-2829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":2618}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad157967d290eefed4261249f987dd357824f572a23a3bb782d34e0dd77c153"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/translate/planner.rs:233-238 | core/translate/planner.rs:294-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68a6c126e7a558bf32781d02cacb219ae2259c975cea6d917e3194bcc00d7bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/translate/schema.rs:65-71 | core/translate/schema.rs:76-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/schema.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":"core/translate/schema.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6094c5aea2b5a3924c65494400a57da49b58b50ee66fb5f3a5dda7391d3b82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/translate/update.rs:608-613 | core/translate/upsert.rs:1796-1801 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"core/translate/update.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad93dc2ebdce41405049e32b4ed35b5081475b0d789e293fa4cc256ab267ecb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/array.rs:443-450 | core/vdbe/array.rs:511-518 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/array.rs:443\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":"core/vdbe/array.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"f495d2dc59c6a6441240b59c119ca01936d244b33ab88c57b08262b9524e614f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/vdbe/execute.rs:3521-3526 | core/vdbe/execute.rs:3580-3585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":3521}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb98767db84abc3f598bc5bc1cc0a799a3e0dcb97dccc6e228b70bfd8b53cd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/vdbe/execute.rs:9072-9077 | core/vdbe/execute.rs:9097-9102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":9072}}}],"partialFingerprints":{"codehealthFindingId/v1":"813e8fac5ad34a1efbfe340c1af770673aaf4470f6bd2daa2f3bfadd59cb707a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/vector/operations/distance_cos.rs:45-50 | core/vector/operations/distance_dot.rs:47-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vector/operations/distance_cos.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf416d47abec227645c0b95223043d22e59fe8b87a13c7d84081ab015cde94f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): postgres/cli/main.rs:289-294 | postgres/cli/main.rs:545-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 \u0060postgres/cli/main.rs:289\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/cli/main.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d45951f590334089d1be99ce53c7eaf60c94122c99c406b6d69621f9f8ad0c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): postgres/parser/translator.rs:756-765 | postgres/parser/translator.rs:1360-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3657503f53e7e4b1a22188f8d35d7d8677409fba940a162974352a77e4cf1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): postgres/parser/translator.rs:3498-3503 | postgres/parser/translator.rs:3522-3527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:3498\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":3498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6409efe7caa6ca58075e18174671cbe9133aa2251eff3685e8e002b7358f6c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sql_generation/generation/predicate/binary.rs:415-420 | sql_generation/generation/predicate/binary.rs:441-446 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sql_generation/generation/predicate/binary.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/generation/predicate/binary.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"d421a0f61443a3c22398c9df6a47535c498d648e31df9148539c98d02bf68dc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sync/engine/src/database_sync_operations.rs:2530-2535 | sync/engine/src/database_sync_operations.rs:2575-2580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_operations.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f24fea1158d9ee3935dfb9dd18c1d5d4a0356ef4176a5c451626b50ce7f5dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/differential-oracle/sql_gen/src/generate/stmt.rs:1588-1593 | testing/differential-oracle/sql_gen/src/generate/stmt.rs:1646-1651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen/src/generate/stmt.rs:1588\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, \u0060testing/differential-oracle/sql_gen/src/generate/stmt.rs:1645\u0060 calls \u0060function_call\u0060, \u0060to_string\u0060 and \u0060testing/differential-oracle/sql_gen/src/generate/stmt.rs:1587\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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e77a9a6622431ad142c89a9261ac67fc01538ce01e235b32c4cb21c395baab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/differential-oracle/sql_gen/src/schema.rs:42-47 | testing/differential-oracle/sql_gen_prop/schema.rs:26-31 \u2014 before extracting anything, compare \u0060testing/differential-oracle/sql_gen/src/schema.rs\u0060 and \u0060testing/differential-oracle/sql_gen_prop/schema.rs\u0060 as WHOLE FILES: this scan already matched 6 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 \u0060testing/differential-oracle/sql_gen/src/schema.rs:42\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/schema.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bad6eef77ccb396f1579b8381f29cc531031670ba48b7c32adaa39f4cb05e39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/simulator/generation/property.rs:2421-2426 | testing/simulator/generation/property.rs:2443-2448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":2421}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c477a8c0f3d0550a102b3f821a1e83e450cf06cc5ebc514a3c9689b83d6d263"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/simulator/runner/env.rs:670-675 | testing/simulator/runner/env.rs:689-694 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/runner/env.rs:670\u0060 it begins part-way through the construct above it, so those exact 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":"testing/simulator/runner/env.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ec3e5de8b91b88e75fb8204b9d38af1cea3e8832c8672ea1979d72ca9c49e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/sqltest/src/backends/rust.rs:109-114 | testing/sqltest/src/backends/tursopg.rs:78-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/backends/rust.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca526766e30fbecf48a41301b129693d6a281c1997ad4ff09fd9ef5f7cb03b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): core/translate/expr/translator.rs:1323-1327 | core/translate/expr/translator.rs:1332-1336 | core/translate/expr/translator.rs:1341-1345 | core/translate/expr/translator.rs:1350-1354 | core/translate/expr/translator.rs:1359-1363 | core/translate/expr/translator.rs:1364-1368 \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 \u0060core/translate/expr/translator.rs:1323\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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":"core/translate/expr/translator.rs"},"region":{"startLine":1323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0c095e2b29f9812399e340408f43262a23dd7d3097852546db41dec9da7ebb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): core/time/internal.rs:439-443 | core/time/internal.rs:446-450 | core/time/internal.rs:454-458 | core/time/internal.rs:463-467 \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, \u0060core/time/internal.rs:443\u0060 calls \u0060minute\u0060 and \u0060core/time/internal.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":"core/time/internal.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b3eb74aeec15249ff165526fb39485e172c1e382427d818e3f985471d55811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): core/vdbe/execute.rs:13149-13153 | core/vdbe/execute.rs:13427-13433 | core/vdbe/execute.rs:13461-13465 | core/vdbe/execute.rs:13493-13497 \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 \u0060core/vdbe/execute.rs:13149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":13149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca75e9f4ccd46b9b53d986516599e4d8dd397e3cde21b78611cc709bda32d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): testing/simulator/generation/property.rs:312-316 | testing/simulator/generation/property.rs:388-392 | testing/simulator/generation/property.rs:524-528 | testing/simulator/generation/property.rs:677-681 \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 \u0060testing/simulator/generation/property.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":"testing/simulator/generation/property.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e24f95cb5f0b02cacd891371ecc639a3c9e2edcd828b54565781131c8d6db8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/functions/printf.rs:1119-1128 | core/functions/printf.rs:1141-1150 | core/functions/printf.rs:1183-1192 \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 \u0060core/functions/printf.rs:1119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/printf.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15e58db80f88359325cea9a1d897beee7ade728ae244045c6ced9b524184543"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): core/storage/sqlite3_ondisk.rs:1555-1559 | core/storage/wal.rs:5927-5931 | core/storage/wal.rs:6006-6010 \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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1555}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a1c75484fe63f9bfd32089a518f388dfc18f0a96e45fd781f0ad0972dfc061"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): postgres/cli/main.rs:179-188 | postgres/cli/main.rs:259-268 | postgres/cli/main.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/cli/main.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 after the matched lines, \u0060postgres/cli/main.rs:189\u0060 calls \u0060is_empty\u0060 and \u0060postgres/cli/main.rs:269\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":"postgres/cli/main.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7ee161e7f37af5c7561b507baaac13c41e4884b50ebf3f033ff1900434b9be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): sync/sdk-kit/src/rsapi.rs:422-427 | sync/sdk-kit/src/rsapi.rs:454-459 | sync/sdk-kit/src/rsapi.rs:497-502 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/sdk-kit/src/rsapi.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/sdk-kit/src/rsapi.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"23efa4f2b060a43fcb75eff5ab9d0e0756ff6afec7bc9f116d3b2a2bc1ca01fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): testing/simulator/generation/property.rs:676-681 | testing/simulator/generation/property.rs:874-879 | testing/simulator/generation/property.rs:1030-1035 \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 \u0060testing/simulator/generation/property.rs:676\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"b605b5f0b3cf0e9ecfb6a9236e5a28602da87786aa63e3c2ae29dc81709d2e1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bindings/c/src/lib.rs:2782-2786 | bindings/c/src/lib.rs:2852-2856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/c/src/lib.rs:2782\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":"bindings/c/src/lib.rs"},"region":{"startLine":2782}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27f852cc23c8183dec2fc36b9ea5ff8d73b87761db997bf0f64157ff4098995"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bindings/rust/src/value.rs:347-354 | serverless/rust/value.rs:311-318 \u2014 before extracting anything, compare \u0060bindings/rust/src/value.rs\u0060 and \u0060serverless/rust/value.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/rust/src/value.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc495831ad8b3f78af277cfbadada78cea13dec9dea9ede1984ad80edc59b8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/connection.rs:1957-1962 | core/connection.rs:1997-2002 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/connection.rs:1957\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"34c009058ace0fa4c04aa0c29aa25d4cfed3b0db94d333bb68472f63d1e2c950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/connection.rs:2078-2084 | core/connection.rs:2132-2138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/connection.rs:2078\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, \u0060core/connection.rs:2131\u0060 calls \u0060clone\u0060 and \u0060core/connection.rs:2077\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":"core/connection.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"5785975d15bedaffb9e9176c6f41946f1fdea570b1290912e95c24decff87f3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/io/vfs.rs:23-27 | core/io/vfs.rs:36-40 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/vfs.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ecdaa93828d654d2b058808f5e82d3b0eb320acf1adf86b52c9b3fb8f3bfca5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/json/jsonb.rs:4090-4094 | postgres/frontend/copy.rs:241-245 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:4090\u0060 it does not close everything it opens, so those exact lines 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":"core/json/jsonb.rs"},"region":{"startLine":4090}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f66838e72e82a2a183dfaba69f46d38b8e10a043c4745f85d065efd87618188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): core/percentile.rs:154-160 | core/vdbe/execute.rs:8302-8307 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/percentile.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":"core/percentile.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"66db75581bf41ffe43080bbff60fb682d4f0b67302917d24eab4e3b077015cd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/storage/btree.rs:2270-2274 | core/storage/btree.rs:2841-2845 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdf69b337418ba4f6ed8eff99c059da4b8244fa74233ff5580ed3202d9a04cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/storage/shared_wal_coordination.rs:1340-1344 | core/storage/shared_wal_coordination.rs:1953-1957 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6ffe0f76f1527ea40371295b14f76ef7586935a396240b6491d0ce50163e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/storage/shared_wal_coordination.rs:1501-1509 | core/storage/shared_wal_coordination.rs:1546-1554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/shared_wal_coordination.rs:1501\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"783608ab208381a9c0a881ca5efd0d5aea18c51aca9e03688aa68364492909ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/storage/shared_wal_coordination.rs:1683-1687 | core/storage/shared_wal_coordination.rs:1704-1708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/shared_wal_coordination.rs:1683\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"4927de16ac947b7e0bb72e97e563d092eefdd5151ec036de2941316abb0c6d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/translate/expr/condition.rs:470-474 | core/translate/expr/condition.rs:487-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 \u0060core/translate/expr/condition.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":"core/translate/expr/condition.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b3ff4474c889de5bd80af9518e04d0e277a5c2042de0139c74a0a48d1ecc71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/translate/optimizer/mod.rs:4504-4508 | core/translate/optimizer/mod.rs:4569-4573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/optimizer/mod.rs:4504\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/mod.rs"},"region":{"startLine":4504}}}],"partialFingerprints":{"codehealthFindingId/v1":"be591fc93533bbdfcd1af5429fdfc64d6518f3e7cb85f5eeefcf9afb863dc5b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/translate/update.rs:622-627 | core/translate/upsert.rs:1818-1822 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/update.rs:622\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/update.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54744966cdbd2da46f83fe407fd635e44dd303b406acaf300be619fbfb56f10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/vdbe/execute.rs:396-400 | core/vdbe/execute.rs:443-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 \u0060core/vdbe/execute.rs:396\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfad07cbe859b5c14746a902f71055f11089084a3ce03651b6f9df7d7f0b45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/vdbe/execute.rs:3383-3389 | core/vdbe/execute.rs:3452-3458 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:3452\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":3383}}}],"partialFingerprints":{"codehealthFindingId/v1":"73fd7a34d22d49eaf3fa5ed36f206557cefb64100268c55762b3f6a550828bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/vdbe/execute.rs:7754-7759 | core/vdbe/execute.rs:7766-7771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:7754\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":7754}}}],"partialFingerprints":{"codehealthFindingId/v1":"f771d07f6652b4738fad9c0570b19eef543ad901d22f5ccd313838d7fe0b5bcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/vdbe/execute.rs:15501-15509 | core/vdbe/value.rs:1564-1572 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"core/vdbe/execute.rs"},"region":{"startLine":15501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4bb420d67152cd82afb366ffe4cef36eb81ad906c98f71fb58b09fd2ddfdfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): macros/src/ext/vfs_derive.rs:182-186 | macros/src/ext/vfs_derive.rs:196-200 | macros/src/ext/vfs_derive.rs:243-244 \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":"macros/src/ext/vfs_derive.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"31435336a242e24c3f24e5b5020e11c7dfce8356e6084bb4efcb380e99e45421"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): postgres/parser/lexer.rs:469-474 | postgres/parser/lexer.rs:525-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/lexer.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":"postgres/parser/lexer.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22d32a28a90a6996c300b132ba5f25a953ff27afd2f201496c10a96b2edb580"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): postgres/parser/translator.rs:4577-4582 | postgres/parser/translator.rs:4600-4605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":4577}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce51283a50f8a82e24391ae7b9798ddd84856e2622b1c2ce3454960705e95a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sql_generation/model/query/predicate.rs:39-43 | sql_generation/model/query/predicate.rs:54-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sql_generation/model/query/predicate.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sql_generation/model/query/predicate.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2103674fa2969db29c111f8898cb0a9a48777fb3ae90ad0f92d822381c1fae8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sqlite/parser/src/lexer.rs:567-571 | sqlite/parser/src/lexer.rs:587-591 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/lexer.rs:567\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/lexer.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"2910e1344dc17c84a85279149657f4f2cbf05f38fc4afd040f3736d889f36fef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sqlite/parser/src/parser.rs:5410-5414 | sqlite/parser/src/parser.rs:5423-5427 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/parser.rs:5410\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":5410}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2b54fd588059fb1044b28140b49aa8e4b095b66e0939835fb77f2e0514f1fdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): testing/concurrent-simulator/lib.rs:829-834 | testing/concurrent-simulator/multiprocess.rs:320-324 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59a7f86016ca2726a52fc4399631278fd0a2da4ff627c527eea06e699d2cd16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:434-441 | bindings/dotnet/src/Turso.Data/TursoBatch.cs:338-345 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd960751cbf1368598c7dccd1aeb3f151351c12c9cba67c17b2e97863ebc039b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:447-457 | bindings/dotnet/src/Turso.Data/TursoBatch.cs:351-361 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f28701858c45fc29f6f48709af21e95354ba77e285608b10bf1ceecf329651"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:540-544 | bindings/dotnet/src/Turso.Data/TursoBatchCommandCollection.cs:29-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4597e09e04f6e9098a65c2e3dcc7b7fb068e225ffa21f076380365919a54285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bindings/dotnet/src/Turso.Data.Sqlite/SqliteParameterCollection.cs:77-81 | bindings/dotnet/src/Turso.Data/TursoParameterCollection.cs:52-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteParameterCollection.cs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6f6e8c5a06093a40ed15ba41f55bf6a5a59abbd487c37ccb990cf409375f0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bindings/dotnet/src/Turso.Data/TursoBatch.cs:51-59 | bindings/dotnet/src/Turso.Data/TursoCommand.cs:89-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoBatch.cs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f50a6a3d4f780b50eb3ae5f822980c80273c1e6abb00b05a334a2c6925cea2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): bindings/python/src/turso_sync.rs:78-84 | bindings/rust/src/sync.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":"bindings/python/src/turso_sync.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9278ccd7610a3d0bcbc8e1bbff29d31e63ad15856d945e86ed9c69b33bf1b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bindings/rust/src/sync.rs:231-238 | serverless/rust/lib.rs:104-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":"bindings/rust/src/sync.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"0946b75805738610c0432fda15db0c99f178ca5efc7e74638ca50becab41e37c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bindings/rust/src/transaction.rs:26-33 | serverless/rust/transaction.rs:26-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/rust/src/transaction.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"412c7fb7f79b42a4dfbb5d6c6fa0a68c49d0a0d4f1c8cedb4a8bf12e9bd5383a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bindings/rust/src/transaction.rs:66-74 | serverless/rust/transaction.rs:66-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":"bindings/rust/src/transaction.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ddfdb89c570c687ec2989f4f0083c185e8e166e3fb381cea3be7d3c2b23e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): bindings/rust/src/value.rs:27-36 | serverless/rust/value.rs:28-37 \u2014 before extracting anything, compare \u0060bindings/rust/src/value.rs\u0060 and \u0060serverless/rust/value.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/rust/src/value.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4022c868bb3e168195e96049ba8a4973cdaa086362142ac6dd232ad31e87a54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bindings/rust/src/value.rs:186-194 | serverless/rust/value.rs:144-152 \u2014 before extracting anything, compare \u0060bindings/rust/src/value.rs\u0060 and \u0060serverless/rust/value.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/rust/src/value.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1d8b1a7e2a41a2664e6a11bac661cdf55e7e424999a6e99f6a23e4ecc2a0ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bindings/rust/src/value.rs:262-270 | serverless/rust/value.rs:226-234 \u2014 before extracting anything, compare \u0060bindings/rust/src/value.rs\u0060 and \u0060serverless/rust/value.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/rust/src/value.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c74cf024d4722570a5f33d4cc4ede3649494b778094b2b2abd7cd0358f0133"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): cli/read_state_machine.rs:201-205 | postgres/cli/read_state_machine.rs:236-240 \u2014 before extracting anything, compare \u0060cli/read_state_machine.rs\u0060 and \u0060postgres/cli/read_state_machine.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/read_state_machine.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"777c7764bb44bdd5fa3b920d43139b5901a08b4617f0798b8423bb9512614afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/io/generic.rs:36-40 | core/io/windows.rs:198-202 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"core/io/generic.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdce4ce2dd2aecbf4cb5ba51a15dec652712b1199b07f4bc8cac1c99a28e5117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/io/io_uring.rs:840-846 | core/io/unix.rs:492-498 \u2014 before extracting anything, compare \u0060core/io/io_uring.rs\u0060 and \u0060core/io/unix.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/io_uring.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"4816165104ebd2a33d453de6ba092fccb13a7174cb072f4635df3923d1c7a60c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/io/windows.rs:100-112 | core/io/windows_lock.rs:61-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/io/windows.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced22f48b9a3f2b14749c18ebbb31feb56860432180c03b6116e46d54b6f2e9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): postgres/client/lib.rs:213-217 | postgres/regress/main.rs:1594-1598 \u2014 before extracting anything, compare \u0060postgres/client/lib.rs\u0060 and \u0060postgres/regress/main.rs\u0060 as WHOLE FILES: this scan already matched 7 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/client/lib.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecd34fdeb05749cfe8f80ce051ae0960b2b64fb2d253452106d699119b84eca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): sdk-kit/src/rsapi.rs:1120-1126 | sdk-kit/src/rsapi.rs:1498-1504 | sync/sdk-kit/src/rsapi.rs:159-165 | sync/sdk-kit/src/rsapi.rs:538-544 | sync/sdk-kit/src/sync_engine_io.rs:250-256 | sync/sdk-kit/src/turso_async_operation.rs:152-158 \u2014 there are 6 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sdk-kit/src/rsapi.rs:1120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sdk-kit/src/rsapi.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"50429991c1163ba2613df4ef1543c450b84b4e4fefaedaf1c042133941f8f7bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:614-620 | testing/differential-oracle/sql_gen_prop/cte.rs:48-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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c697a12f15befd802e6dcb382c49ff4ea4afb6537f3094bbfc8d35104c3d55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:918-924 | testing/differential-oracle/sql_gen_prop/select.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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb761d0fdd1dae586edeb16f5acc216a859450d7072556947535ed51dbc26765"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:935-940 | testing/differential-oracle/sql_gen_prop/select.rs:36-41 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"575d9f84e2dbe4852e1904ae6351bcb9ed82a908f1429ed43cc6de9f5936b230"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:951-956 | testing/differential-oracle/sql_gen_prop/select.rs:52-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d9085aac66ecd0505f29b9274f7b2a1f2bc362d0fa72c41605e116a90488a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:1213-1218 | testing/differential-oracle/sql_gen_prop/create_table.rs:456-461 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b9a8bbc1c2369d508feec28a722a974b3c45131a699ad4fe0374d921974b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): testing/differential-oracle/sql_gen/src/functions.rs:437-449 | testing/differential-oracle/sql_gen_prop/function.rs:636-648 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"testing/differential-oracle/sql_gen/src/functions.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23f709156d8e76568293cadc5764e81876b8e72dba591d20226898293909305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): testing/differential-oracle/sql_gen/src/schema.rs:163-168 | testing/differential-oracle/sql_gen/src/schema.rs:238-243 | testing/differential-oracle/sql_gen/src/schema.rs:269-274 | testing/differential-oracle/sql_gen_prop/schema.rs:148-153 | testing/differential-oracle/sql_gen_prop/schema.rs:214-219 | testing/differential-oracle/sql_gen_prop/schema.rs:261-266 \u2014 before extracting anything, compare \u0060testing/differential-oracle/sql_gen/src/schema.rs\u0060 and \u0060testing/differential-oracle/sql_gen_prop/schema.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"testing/differential-oracle/sql_gen/src/schema.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd79c064587cff81624c0b0c3dfe207d97ec8028d5ffd4d3977ace22a940105e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/differential-oracle/sql_gen/src/schema.rs:218-226 | testing/differential-oracle/sql_gen_prop/schema.rs:194-202 \u2014 before extracting anything, compare \u0060testing/differential-oracle/sql_gen/src/schema.rs\u0060 and \u0060testing/differential-oracle/sql_gen_prop/schema.rs\u0060 as WHOLE FILES: this scan already matched 6 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 \u0060testing/differential-oracle/sql_gen/src/schema.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":"testing/differential-oracle/sql_gen/src/schema.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de9914374aa24fd094ad29c1db0059472a75da9ef8056e0a24a063c69b07a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen/src/schema.rs:344-350 | testing/differential-oracle/sql_gen_prop/schema.rs:350-356 \u2014 before extracting anything, compare \u0060testing/differential-oracle/sql_gen/src/schema.rs\u0060 and \u0060testing/differential-oracle/sql_gen_prop/schema.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"testing/differential-oracle/sql_gen/src/schema.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d0ac4cea99b10c13a2dd9320034dc440b19a42c077345200c70ec376987af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen/src/schema.rs:358-364 | testing/differential-oracle/sql_gen_prop/schema.rs:363-369 \u2014 before extracting anything, compare \u0060testing/differential-oracle/sql_gen/src/schema.rs\u0060 and \u0060testing/differential-oracle/sql_gen_prop/schema.rs\u0060 as WHOLE FILES: this scan already matched 6 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":"testing/differential-oracle/sql_gen/src/schema.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"294fa48ecb611ef7e4eb408fc58961fdc49c8137090a0c2768c230848d74624c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): testing/sqltest/src/backends/cli.rs:409-414 | testing/sqltest/src/backends/js.rs:261-266 | testing/sqltest/src/backends/rust.rs:446-452 \u2014 before extracting anything, compare \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/js.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 118 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3eb20c1353ac5247d21c725063d50eb82fe8e1dbe051023102dff8c6674643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): bindings/java/rs_src/turso_connection.rs:34-40 | bindings/java/rs_src/turso_db.rs:43-49 | bindings/java/rs_src/turso_statement.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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/rs_src/turso_connection.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d57a09a6b9663bdb1ebdd793c0e4343ebb4f454ace0199bb75e4d2e786dcd001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): bindings/java/rs_src/turso_connection.rs:47-54 | bindings/java/rs_src/turso_db.rs:233-240 | bindings/java/rs_src/turso_statement.rs:94-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 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/java/rs_src/turso_connection.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":"bindings/java/rs_src/turso_connection.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f352860c5691f5ae12eef723e068f8bad869589d6d96ba260aed9da07654b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): bindings/javascript/sync/src/js_protocol_io.rs:88-92 | sync/sdk-kit/src/sync_engine_io.rs:131-135 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"bindings/javascript/sync/src/js_protocol_io.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"826f3aeaefed2c97e37c6ddb8428a633d16fdc4f0629cdf3d61e072e29bda361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:1278-1284 | testing/differential-oracle/sql_gen_prop/drop_table.rs:17-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3ee7c98e816d3cf0d8e22cbfd51ba1101df27d0213008ae5a8f1ed89c7394e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:1375-1381 | testing/differential-oracle/sql_gen_prop/drop_index.rs:16-24 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6254b39f4f2847bbe7be254b78d0b73cd4fd8bc6c0007f760cdc1136706a6e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:1533-1539 | testing/differential-oracle/sql_gen_prop/drop_trigger.rs:19-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"9564bdb0c49deb4a60daf88e592b80cda4e05f5f041906792b212ec2e1256c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): testing/differential-oracle/sql_gen_prop/alter_table.rs:160-164 | testing/differential-oracle/sql_gen_prop/create_trigger.rs:246-250 | testing/differential-oracle/sql_gen_prop/expression.rs:774-778 | testing/differential-oracle/sql_gen_prop/profile.rs:644-648 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"testing/differential-oracle/sql_gen_prop/alter_table.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c71fb0acfb2d234ba8f3fe092690c744704899f6a2c79a60d2ad0f223cd05411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/drop_index.rs:28-37 | testing/differential-oracle/sql_gen_prop/drop_table.rs:29-38 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen_prop/drop_index.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"41faaa1dc1102d6e152eda06cb7a0754dd57511adce2c8206d0bc8a95a026789"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/drop_index.rs:40-47 | testing/differential-oracle/sql_gen_prop/drop_table.rs:58-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen_prop/drop_index.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a93aaafd73e95478d67439004392b4d149fec1741db323b18fff3800e28871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/differential-oracle/sql_gen/src/generate/stmt.rs:965-989 | testing/differential-oracle/sql_gen/src/generate/stmt.rs:1307-1317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen/src/generate/stmt.rs:965\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"c241e051470d2eb3ec0d54b5be73a3bef364e4609e08ed8e5486fc7a0c84c879"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/vdbe/explain.rs:483-496 | core/vdbe/explain.rs:614-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/explain.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":"core/vdbe/explain.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b01c5a24fa447af43df48f2c63735cd4d48f8ed34b0e6de9ab8e7d10852e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): core/storage/pager.rs:4115-4131 | core/storage/pager.rs:4161-4175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/pager.rs:4115\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5290f3da9d181361ab8d1fe0c3c5a013585ea7ed9c0fbf1b8b6494b9b04fcba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): core/translate/schema.rs:3193-3209 | core/translate/schema.rs:3393-3409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/schema.rs:3193\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":"core/translate/schema.rs"},"region":{"startLine":3193}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3138487d9db23734aa7f0afee9be9b9b96b475dd84ee72f58e4cecfcf35f61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): core/vdbe/explain.rs:455-471 | core/vdbe/explain.rs:483-495 | core/vdbe/explain.rs:614-630 \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 \u0060core/vdbe/explain.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. 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":"core/vdbe/explain.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fa8948f2e343e985c66c7d1737a3ffb9c9f39c9459a0cd5e303c2a18737530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/incremental/vdbe_maintenance.rs:351-363 | core/incremental/vdbe_maintenance.rs:404-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance.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":"core/incremental/vdbe_maintenance.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e41108fc203862408707f2dcf8d34351d9cc5b84ac9f02dbc449a8a4a62308c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): postgres/parser/translator.rs:3650-3664 | postgres/parser/translator.rs:3671-3681 \u2014 both copies are in the same file, so extract the block 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, \u0060postgres/parser/translator.rs:3648\u0060 calls \u0060translate_expr\u0060 and \u0060postgres/parser/translator.rs:3669\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":"postgres/parser/translator.rs"},"region":{"startLine":3650}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae382e614e8ab218b5c01888e036ecd9ecb63b3737dce7bd86e9c3e4652952b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/incremental/vdbe_maintenance.rs:299-308 | core/incremental/vdbe_maintenance.rs:322-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 \u0060core/incremental/vdbe_maintenance.rs:299\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, \u0060core/incremental/vdbe_maintenance.rs:309\u0060 calls \u0060materialize_node_output\u0060, \u0060emit_filter\u0060 and \u0060core/incremental/vdbe_maintenance.rs:335\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"be438a60a1e72cc13d02f0373cfddd288969cbadd3351f2bac86580fff73e49e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): postgres/parser/translator.rs:3967-3980 | postgres/parser/translator.rs:3985-3998 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:3967\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":"postgres/parser/translator.rs"},"region":{"startLine":3967}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6bebf0eb15c66d173f902030bb97c2a837123be6659abcc314d342b340015d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): postgres/regress/describe.rs:661-674 | postgres/regress/describe.rs:692-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 \u0060postgres/regress/describe.rs:661\u0060 it begins part-way through the construct above it, so those exact 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":"postgres/regress/describe.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15b617c06eae06c351d8647c17d7a62b80406423def9adab86cb27fdf98d961"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/translate/expr/translator.rs:1088-1101 | core/translate/expr/translator.rs:2412-2425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"335489a08d534561021a0f4bf8893145033f43e2326f6826cf1f34ecefc25bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/percentile.rs:64-77 | core/percentile.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 \u0060core/percentile.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":"core/percentile.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"da03148be3e3faea32c600459016d25de37688a73db89f1930775ac3e3de67a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:1229-1242 | core/index_method/toy_vector_sparse_ivf.rs:1474-1487 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:1229\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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":1229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4facb61489eed4dfe7ad355c357434b545923dd30def745cb961637166ab00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/translate/alter.rs:1149-1161 | core/translate/alter.rs:1162-1174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/alter.rs:1149\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b44dc4c8eb3a702b6d14e7ad5e1073eb0ccbc2a9dfe9943c0c0c49bf668ec8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vector/vector_types.rs:298-310 | core/vector/vector_types.rs:312-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vector/vector_types.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b77b40c9773a42dbbb52194f3541cae56d8a46b9652b35d640c3d0b49d6d296"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): postgres/regress/describe.rs:375-386 | postgres/regress/describe.rs:389-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 \u0060postgres/regress/describe.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/regress/describe.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccfef3637478c4bd03c6d0d619bcbf5bd0b0476b85829cb52b30a5e4592f2c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/vdbe/explain.rs:2803-2815 | core/vdbe/explain.rs:2819-2831 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/explain.rs:2803\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/explain.rs"},"region":{"startLine":2803}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a37498d17dad809826224019f6b9054faa8cc31a43ac092f42358854080e3cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/storage/wal.rs:3995-4007 | core/storage/wal.rs:4098-4110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/wal.rs:3995\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":"core/storage/wal.rs"},"region":{"startLine":3995}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f2141cbf212b25d13eba7003e19439f7369abe0115d028cf47a07fce704beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/incremental/vdbe_maintenance/set_op.rs:1102-1112 | core/incremental/vdbe_maintenance/sink.rs:266-278 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 and \u0060core/incremental/vdbe_maintenance/sink.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060core/incremental/vdbe_maintenance/set_op.rs:1102\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c814d1c1ce8de769e0e062ba243e9a7ba179bdc3076b565fc172d62821e7ac00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): core/json/jsonb.rs:1960-1972 | core/json/jsonb.rs:1974-1986 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:1960\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":"core/json/jsonb.rs"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eca7d8840caad97b4550d3ba2f79afbf98a098faaaa3ef9c68033690a8729d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/sqltest/src/runner/mod.rs:757-768 | testing/sqltest/src/runner/mod.rs:776-788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/runner/mod.rs:757\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2a11e45e343334969c07d955ddc7eca4a04b3afcbd9c93109936e91dd1d14b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/incremental/vdbe_maintenance/set_op.rs:1100-1110 | core/incremental/vdbe_maintenance/sink.rs:254-266 | core/translate/schema.rs:1713-1725 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 and \u0060core/incremental/vdbe_maintenance/sink.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060core/incremental/vdbe_maintenance/set_op.rs:1100\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, \u0060core/incremental/vdbe_maintenance/set_op.rs:1096\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/translate/schema.rs:1711\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":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"56281019482b27417847a64cdf70adf4e2ffa2a596a2b4450cf67ba66d501a4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): postgres/parser/translator.rs:3503-3514 | postgres/parser/translator.rs:3618-3629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:3503\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":3503}}}],"partialFingerprints":{"codehealthFindingId/v1":"144bc801dc9d0a487186fc6a93a911221c6c523f5bdc3b97a23fedd38f428a87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): core/incremental/vdbe_maintenance/arrangement.rs:59-70 | core/incremental/vdbe_maintenance/members.rs:52-63 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 and \u0060core/incremental/vdbe_maintenance/members.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 \u0060core/incremental/vdbe_maintenance/arrangement.rs:59\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa24c86e41b33b21bf5a11c93c6f4101ed7690b35ac3cc58fdf0dfcf9f3bff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): postgres/parser/translator.rs:2119-2138 | postgres/parser/translator.rs:5105-5122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:2119\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":"postgres/parser/translator.rs"},"region":{"startLine":2119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17999b9ba97a2d8235056d956521c5abf8747c35c67beaf8bca2a1ad8233b6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/sqltest/src/generator/mod.rs:396-406 | testing/sqltest/src/generator/mod.rs:410-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/generator/mod.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. 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":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ae3d66babef648b6cf6e6692615e246da09a908825d40a0a0db36e9165299f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): core/index_method/toy_vector_sparse_ivf.rs:613-624 | core/index_method/toy_vector_sparse_ivf.rs:745-756 | core/index_method/toy_vector_sparse_ivf.rs:1017-1028 \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 \u0060core/index_method/toy_vector_sparse_ivf.rs:613\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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c739fc878d6a013b5d97e6cf578a0b71c44bbda4cbd3efd8c761f68124851f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/incremental/vdbe_maintenance/aggregate.rs:155-165 | core/incremental/vdbe_maintenance/set_op.rs:337-347 | core/incremental/vdbe_maintenance/set_op.rs:356-366 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/set_op.rs\u0060 as WHOLE FILES: this scan already matched 10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f245ec9d004068880b3e950bcb82d73b8359efdfe16f8a6902f5d97fecbf7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): core/translate/insert.rs:106-116 | core/translate/update.rs:323-333 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/translate/insert.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":"core/translate/insert.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42e21f21f3fd8d7d1faf1944212d72e75bd443de70c06a87ea8aa5680831290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/differential-oracle/sql_gen/src/ast.rs:1425-1435 | testing/differential-oracle/sql_gen_prop/create_trigger.rs:338-348 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060testing/differential-oracle/sql_gen/src/ast.rs:1425\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fb03a7171f04bd884bee14c52b2347f4370924bfdc4216e35ca729377dbb48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/sqltest/src/main.rs:916-926 | testing/sqltest/src/main.rs:942-952 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/main.rs:916\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":"testing/sqltest/src/main.rs"},"region":{"startLine":916}}}],"partialFingerprints":{"codehealthFindingId/v1":"793699d59a4771ead7eff487f325a88889059ea0c49e3d088bc4d7773d5f7e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/io/unix.rs:361-371 | core/io/unix.rs:432-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 \u0060core/io/unix.rs:361\u0060 it begins part-way through the construct above it, so those exact 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":"core/io/unix.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e5dfa37ef6a378bfa87c1530c291ba5aa310d7ad994c234fda32fe3a951d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): core/incremental/vdbe_maintenance/aggregate.rs:1044-1054 | core/incremental/vdbe_maintenance/arrangement.rs:418-428 | core/incremental/vdbe_maintenance/join.rs:1234-1244 \u2014 before extracting anything, compare \u0060core/incremental/vdbe_maintenance/aggregate.rs\u0060 and \u0060core/incremental/vdbe_maintenance/arrangement.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/incremental/vdbe_maintenance/aggregate.rs:1044\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, \u0060core/incremental/vdbe_maintenance/join.rs:1231\u0060 calls \u0060preassign_label_to_next_insn\u0060 and \u0060core/incremental/vdbe_maintenance/aggregate.rs:1042\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":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6eed4de30354d99ef69b779595167ad9023624d30509b2980a839a5fc516681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): sqlite/parser/src/ast/fmt.rs:790-800 | sqlite/parser/src/ast/fmt.rs:842-852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/ast/fmt.rs:790\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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f3bf70c68711d4171cfbb2ab85b0126f2108b29e6529947894a427a88d24bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/sqltest/src/runner/mod.rs:538-548 | testing/sqltest/src/runner/mod.rs:612-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a174b84bfa74db6d8fa565be91a3a27a9a3456c243d320217a2eb8908b05823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/translate/main_loop/init.rs:703-712 | core/translate/window.rs:3793-3802 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060core/translate/main_loop/init.rs:703\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/init.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"abbf8daf1da462a5470aae7b2624567b37cd7511c6b6a513ea027dd4a620db30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): core/index_method/toy_vector_sparse_ivf.rs:652-661 | core/index_method/toy_vector_sparse_ivf.rs:866-875 | core/index_method/toy_vector_sparse_ivf.rs:952-961 | core/index_method/toy_vector_sparse_ivf.rs:1162-1171 \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 \u0060core/index_method/toy_vector_sparse_ivf.rs:652\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfea6e4b8a78162973077cdd0a313cd44e08e6ed22f7d7163357d7913aeceae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): sync/engine/src/database_sync_engine.rs:2386-2395 | sync/engine/src/database_sync_engine.rs:2608-2617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/engine/src/database_sync_engine.rs:2386\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ede08e93eca4be72a51e8c4080eaec7bcebde9641f3ab8d9fb0480d4a2aadf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/storage/sqlite3_ondisk.rs:1163-1172 | core/storage/sqlite3_ondisk.rs:1191-1200 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/sqlite3_ondisk.rs:1163\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":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"f83ab3d6c0fa96b4bd680f00580f6eb3d8ef414559c5bd464e1a0ee469b1cacc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): testing/sqltest/src/snapshot/mod.rs:410-419 | testing/sqltest/src/snapshot/mod.rs:449-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 \u0060testing/sqltest/src/snapshot/mod.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060testing/sqltest/src/snapshot/mod.rs:421\u0060 calls \u0060clone\u0060 and \u0060testing/sqltest/src/snapshot/mod.rs:460\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":"testing/sqltest/src/snapshot/mod.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b01ab3f710e8287f29287776b3feebc24149ffbfc5c8e51c3a728e6c5f7179"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/index_method/toy_vector_sparse_ivf.rs:523-532 | core/index_method/toy_vector_sparse_ivf.rs:786-795 | core/index_method/toy_vector_sparse_ivf.rs:1556-1565 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.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. 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8561274007ceb7a9439b536fd5d67b6f945eea1ca622391eab6b03fa41586e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): core/vdbe/explain.rs:2740-2749 | core/vdbe/explain.rs:2801-2810 | core/vdbe/explain.rs:2817-2826 \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 \u0060core/vdbe/explain.rs:2740\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/explain.rs"},"region":{"startLine":2740}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24ab8813adc21fda3a79efda557fa30cbbe5f7ff7f4e9f2fb4e7c849ec95882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/storage/pager.rs:691-700 | core/storage/sqlite3_ondisk.rs:859-865 | core/storage/sqlite3_ondisk.rs:897-903 \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 \u0060core/storage/pager.rs:691\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/storage/pager.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e301da0d8b24efbc36139264e777d3a3a559d6a764ae19e225c294e4e2eb98b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): core/vdbe/execute.rs:8683-8692 | core/vdbe/execute.rs:8704-8713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:8683\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8683}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c4b9d5728e9ed5180cb54c0fb0a53f2fd1c60b443de5970fe27209280ae5405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): postgres/parser/translator.rs:3579-3588 | postgres/parser/translator.rs:3590-3599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:3579\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":3579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ed4752f2d9f4da3ab12291b6c455cce01433024545762eceab9d9ece8e08c2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): testing/sqltest/src/main.rs:581-590 | testing/sqltest/src/main.rs:675-684 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/main.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":"testing/sqltest/src/main.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a57c1798e1bef4fc9dff3fb950d89c8d3a0a066cb9e673f93864f3bc0f95d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): postgres/parser/translator.rs:1158-1167 | postgres/parser/translator.rs:1189-1198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:1158\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":1158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb286d5653c547ab2bc079ed95ff4e17316361fe88f022b815b747edbe7d405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): testing/sqltest/src/generator/mod.rs:371-379 | testing/sqltest/src/generator/mod.rs:556-565 | testing/sqltest/src/generator/mod.rs:1041-1050 \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 \u0060testing/sqltest/src/generator/mod.rs:371\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"290f8555099a2d9ca5006c640cea5887fa4cbe53a5119913ccc4cdc32dca4d89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/execute.rs:13185-13192 | core/vdbe/execute.rs:15347-15356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:13185\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":13185}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca2ad95b3225fb1aa4f418659f980c25ddf374a276fb81bd9637fa883cfeedd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:672-680 | core/index_method/toy_vector_sparse_ivf.rs:714-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"0938a27a4f074c278a21ab498bdbb3c498a9b8fae915df3c46234fbe343c9f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/vdbe/execute.rs:9870-9878 | core/vdbe/execute.rs:9959-9967 \u2014 both copies are in the same file, so extract the block 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, \u0060core/vdbe/execute.rs:9956\u0060 calls \u0060is_offset\u0060 and \u0060core/vdbe/execute.rs:9867\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":"core/vdbe/execute.rs"},"region":{"startLine":9870}}}],"partialFingerprints":{"codehealthFindingId/v1":"9089cf1b2cb22b14835462420e60869876ec618053e8b1148fc41cbccd73a15c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/schema.rs:8887-8895 | core/schema.rs:8943-8951 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:8887\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":8887}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae31c28a507cfc6b4788276689f63978ae8badaf90ef24bd6334ca0d7fe9947"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): testing/simulator/generation/property.rs:315-321 | testing/simulator/generation/property.rs:391-399 | testing/simulator/generation/property.rs:527-535 | testing/simulator/generation/property.rs:751-757 \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 \u0060testing/simulator/generation/property.rs:315\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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":"testing/simulator/generation/property.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"171e9ea2d1ed7734281280c8fb33a3db9b8097203276b56d8588d08981ea42f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sqlite/parser/src/ast/fmt.rs:881-889 | sqlite/parser/src/ast/fmt.rs:923-931 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/ast/fmt.rs:881\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":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2765aed78d17afa0e87e3804f5f0fea5d62aa58d4980caf03c7af83c5430cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): sync/engine/src/server_proto.rs:362-370 | sync/engine/src/server_proto.rs:485-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 \u0060sync/engine/src/server_proto.rs:362\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/server_proto.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c1bbdf7ba1b362b755afa2c0ad9aeac1c423de0bdc3449f8a666e66ecbfd8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): sync/engine/src/database_sync_engine.rs:2437-2452 | sync/engine/src/database_sync_engine.rs:2472-2488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sync/engine/src/database_sync_engine.rs:2437\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":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":2437}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0728ff928a2ded9fc09539df9bffaef5edf7e3f80f19313be405d92d41db1ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/simulator/generation/property.rs:1286-1293 | testing/simulator/generation/property.rs:1302-1310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/generation/property.rs:1286\u0060 it does not close everything it opens, so those exact 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":"testing/simulator/generation/property.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5569d1430da5765a5d2a4742dfc86d8d8da5c79917db911329c79b345ef6007c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/simulator/runner/differential.rs:248-256 | testing/simulator/runner/doublecheck.rs:243-251 \u2014 before extracting anything, compare \u0060testing/simulator/runner/differential.rs\u0060 and \u0060testing/simulator/runner/doublecheck.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/runner/differential.rs:248\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/differential.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e375952181f15d07546b9318e720ec3eda764554120f3caeba45ca0c7d4513f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/json/jsonb.rs:2386-2394 | core/json/jsonb.rs:2403-2411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/json/jsonb.rs:2386\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":2386}}}],"partialFingerprints":{"codehealthFindingId/v1":"5196ac98cf40c0d834ac44690224227a0f8a98e9bdc24130d3a4e1c8bb359eae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): postgres/parser/translator.rs:2107-2115 | postgres/parser/translator.rs:5093-5101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:2107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":2107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd098d58e828791758a9d3792d476f8905d4d66d22f61643c7ffa6252ffe702"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): postgres/parser/translator.rs:1376-1383 | postgres/parser/translator.rs:5566-5574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/parser/translator.rs:1376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae7eb93a7cf1ffb3ce304f88589c00bac29d04d5111db0663fe3b7ba2cc0623"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/vdbe/execute.rs:10584-10592 | core/vdbe/execute.rs:10906-10914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:10584\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":10584}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cedf1f72f98f235068b890790855a76dcc7666f6fbd14e750ee54c9ec1c1d09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): core/vdbe/explain.rs:1298-1306 | core/vdbe/explain.rs:1360-1368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/explain.rs:1298\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/explain.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f446e40aa51999b5d2fad850f86a09b8918fca5e30410f44d2ffc5e245973cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:1160-1167 | core/index_method/toy_vector_sparse_ivf.rs:1315-1322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:1160\u0060 it does not close everything it opens, so those exact 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, \u0060core/index_method/toy_vector_sparse_ivf.rs:1313\u0060 calls \u0060Some\u0060 and \u0060core/index_method/toy_vector_sparse_ivf.rs:1158\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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8cdf67cc458f81ed1c31902ada302fd7b15ad75c32cc43595f6285ef7376dae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/execute.rs:7454-7461 | core/vdbe/execute.rs:7465-7472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:7454\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":7454}}}],"partialFingerprints":{"codehealthFindingId/v1":"57610b3fb25c6a1e02cd7bd67ce75bc15d0e409dbfceea2aee9d26c3bff5c838"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/execute.rs:8719-8726 | core/vdbe/execute.rs:8745-8752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:8719\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8719}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd99a1c01218b290ec0f32ce25885a0f6bcc554f0f3b2fd8a177c5e0f2a5f03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): postgres/frontend/classes.rs:306-313 | postgres/frontend/classes.rs:336-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060postgres/frontend/classes.rs:306\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/classes.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e8476ec5fe57052c0789939613912f8d837988ef41ca47074d4b3f265204b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/hash_table.rs:1668-1675 | core/vdbe/hash_table.rs:2987-2994 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:1668\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":"core/vdbe/hash_table.rs"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"865a57e2ad60f79b2d0e8c24fff4f86e0550b3c19b960dcb2e84b1966a8315a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/vdbe/execute.rs:8654-8661 | core/vdbe/execute.rs:8830-8836 | core/vdbe/execute.rs:8867-8874 \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":"core/vdbe/execute.rs"},"region":{"startLine":8654}}}],"partialFingerprints":{"codehealthFindingId/v1":"019050b7ff182e2dd0762c3dc996ce852161e6bca043fc81b3921b7f98214305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): postgres/regress/describe.rs:229-236 | postgres/regress/describe.rs:671-678 | postgres/regress/describe.rs:699-706 \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 \u0060postgres/regress/describe.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. 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":"postgres/regress/describe.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"37f832a2ca36f53cd7d9b85ac08a0536f31699134102b606cbac7009bdb4b9d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/schema.rs:4469-4476 | core/schema.rs:4525-4532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":4469}}}],"partialFingerprints":{"codehealthFindingId/v1":"498daa2dda28d37ea98cfcba638935c0ea9da1025b5ab10d6a66051a4d2e6e70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/mod.rs:4414-4421 | core/vdbe/mod.rs:4431-4438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/mod.rs:4414\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":"core/vdbe/mod.rs"},"region":{"startLine":4414}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df146908065ca8be1c788d2a26780cdb725ba3864165956483cccfc29f333e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): core/translate/window.rs:3593-3607 | core/translate/window.rs:3730-3743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/window.rs:3593\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":"core/translate/window.rs"},"region":{"startLine":3593}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa8176b79f17b1bd11a383f99af4f53e60ac09d7eb7ac76c816148316f5cb91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): core/translate/alter.rs:1199-1204 | core/translate/alter.rs:1415-1420 | core/translate/alter.rs:1798-1805 | core/translate/alter.rs:2378-2385 | core/translate/alter.rs:2411-2418 \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 \u0060core/translate/alter.rs:1199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"602798b653331e630126e0841de3e80cfa06662ff8b0d660d237ccf79b2b11d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/vdbe/hash_table.rs:441-448 | core/vdbe/hash_table.rs:457-464 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/hash_table.rs:441\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b560063dad79ba7b9c14aa6d99fd9c3556abb182594f607c6228e3fabfd92c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): core/storage/sqlite3_ondisk.rs:1027-1034 | core/storage/sqlite3_ondisk.rs:1059-1066 | core/storage/sqlite3_ondisk.rs:1095-1102 \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 \u0060core/storage/sqlite3_ondisk.rs:1027\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40cedbc14f691911cf2d2e3223c1789e72f95d838cab2ba70f5765d9b4679ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/sqltest/src/generator/mod.rs:229-236 | testing/sqltest/src/generator/mod.rs:241-248 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqltest/src/generator/mod.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":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f65c5298583cc248932457abd6e0c7be03f72ab84502baf9902c82a05679075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:627-633 | core/index_method/toy_vector_sparse_ivf.rs:927-933 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d66938dd867b3f1b0267abaf99c21a756a955cbb84f64de3623601581954a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): core/vdbe/execute.rs:8379-8385 | core/vdbe/execute.rs:8417-8423 | core/vdbe/execute.rs:8556-8562 | core/vdbe/execute.rs:8597-8603 \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 \u0060core/vdbe/execute.rs:8379\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, \u0060core/vdbe/execute.rs:8596\u0060 calls \u0060from_i64\u0060 and \u0060core/vdbe/execute.rs:8378\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":"core/vdbe/execute.rs"},"region":{"startLine":8379}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d90b4e6863e865a12b0a9634281d0591a1522b3cb78cf4169a9935c83096c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/function.rs:524-530 | testing/differential-oracle/sql_gen_prop/function.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 \u0060testing/differential-oracle/sql_gen_prop/function.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":"testing/differential-oracle/sql_gen_prop/function.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"01af8c15d34f25e04e7a7da3be2d5895cac8eee2872d0c2a2d8eb5348d4b3907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:168-174 | core/index_method/toy_vector_sparse_ivf.rs:203-209 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/index_method/toy_vector_sparse_ivf.rs:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc803c9697446f4bc9c0696eef2b47029b9ef6d00e97f6d619d6e4f6b3e7d83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/incremental/vdbe_maintenance/binding.rs:80-86 | core/incremental/vdbe_maintenance/plan.rs:594-600 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060core/incremental/vdbe_maintenance/binding.rs:80\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":"core/incremental/vdbe_maintenance/binding.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ede2dcdf2c562815a20a1466ab310cd3f025a6f8b570f8d5a49184e8e62647"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): core/mvcc/persistent_storage/logical_log.rs:3270-3276 | core/mvcc/persistent_storage/logical_log.rs:3297-3303 | core/mvcc/persistent_storage/logical_log.rs:3316-3322 \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 \u0060core/mvcc/persistent_storage/logical_log.rs:3270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":3270}}}],"partialFingerprints":{"codehealthFindingId/v1":"003c1354a9acfc251ea660dc1b3c8da30d13c38bc2ba4e25f20b0fa1d9b3fc82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/vdbe/execute.rs:7726-7732 | core/vdbe/execute.rs:7776-7782 \u2014 both copies are in the same file, so extract the block 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":"core/vdbe/execute.rs"},"region":{"startLine":7726}}}],"partialFingerprints":{"codehealthFindingId/v1":"5553567922abf21b924968dd5022055885a7ccd20d821506a51938f515132dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/storage/sqlite3_ondisk.rs:1042-1048 | core/storage/sqlite3_ondisk.rs:1074-1080 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/storage/sqlite3_ondisk.rs:1042\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/sqlite3_ondisk.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5bd5a8ddf4f92c3ee2a2b9394f86c11ba97ec04fc1520f8c051a972f1971594"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/schema.rs:6213-6219 | core/schema.rs:6241-6247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":6213}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8bd71d764d1f679611cd118e2d507cc0b04d3d9e323eebb98fe25011ac9c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): testing/sqltest/src/generator/mod.rs:359-365 | testing/sqltest/src/generator/mod.rs:437-443 | testing/sqltest/src/generator/mod.rs:550-556 | testing/sqltest/src/generator/mod.rs:613-619 | testing/sqltest/src/generator/mod.rs:1035-1041 \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":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b101ce92d85608f0aec946933091bdd2eb632eb05c2e3a3bc45046796171844b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/sql_gen/src/generate/stmt.rs:559-565 | testing/differential-oracle/sql_gen/src/generate/stmt.rs:568-574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen/src/generate/stmt.rs:559\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d49724524d48e942e14dd2c0e8be9e773e3d49dbe82701d19d5009e288186d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): core/vdbe/execute.rs:12367-12373 | core/vdbe/execute.rs:12388-12394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:12367\u0060 it begins part-way through the construct above it, so those exact 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":"core/vdbe/execute.rs"},"region":{"startLine":12367}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd2c0c6595dfd8183c37abeea6952c55266df695e0902febd6c301452aff303"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/simulator/model/interactions.rs:657-662 | testing/simulator/model/interactions.rs:683-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/simulator/model/interactions.rs:657\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/model/interactions.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"c989aabaf4fadde134feaaf0ec48fee57e2071b775a5108d2318471615934023"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): sqlite/parser/src/parser.rs:4919-4924 | sqlite/parser/src/parser.rs:5168-5173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060sqlite/parser/src/parser.rs:4919\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":4919}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2005c8cc4d47528334c745edac89983b22a3a5cd4331bfb96edefa8eb8f3116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6): postgres/cli/main.rs:289-294 | postgres/cli/main.rs:350-355 | postgres/cli/main.rs:381-386 | postgres/cli/main.rs:413-418 | postgres/cli/main.rs:447-452 | postgres/cli/main.rs:545-550 \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 \u0060postgres/cli/main.rs:289\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060postgres/cli/main.rs:454\u0060 calls \u0060add_attribute\u0060 and \u0060postgres/cli/main.rs:296\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":"postgres/cli/main.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab02bf9b1b457545ba7f366582246a9517c451b3a9e33681d1b1f9b2fa9d4710"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): testing/sqltest/src/generator/mod.rs:687-692 | testing/sqltest/src/generator/mod.rs:1004-1008 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/generator/mod.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fbd3b20151d1855721a6458eafe137e146b4f720a35cdf5cfbde90ac0da7d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/index_method/toy_vector_sparse_ivf.rs:166-171 | core/index_method/toy_vector_sparse_ivf.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 \u0060core/index_method/toy_vector_sparse_ivf.rs:166\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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dbbb895fec10c600c7d6fd1c81126f26fc124a78044aec9dcaed4a634f7c312"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/mvcc/persistent_storage/logical_log.rs:1237-1241 | core/mvcc/persistent_storage/logical_log.rs:1254-1258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/persistent_storage/logical_log.rs:1237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/persistent_storage/logical_log.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3251aa9863766a283aafedb418af3468dc62d67bade6a896d494de994bc5298"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/vdbe/execute.rs:13454-13458 | core/vdbe/execute.rs:13486-13490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/vdbe/execute.rs:13454\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":13454}}}],"partialFingerprints":{"codehealthFindingId/v1":"30bfa94bd209c66b66c171277b342ad39e001dc0963f5d65b2ec875346c3897d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): sqlite/parser/src/parser.rs:5171-5175 | sqlite/parser/src/parser.rs:5235-5239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":5171}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c26a1e3cd80e16886abde710034b553f9009c71e8a0563d084b0c4fb8cd285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): core/vdbe/execute.rs:8351-8355 | core/vdbe/execute.rs:8382-8386 | core/vdbe/execute.rs:8420-8424 | core/vdbe/execute.rs:8559-8563 | core/vdbe/execute.rs:8600-8604 \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 \u0060core/vdbe/execute.rs:8351\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":8351}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d04e53beff06cfb504dfe4fa959bd6734e91f9bf9b28c5f61f5ba0e6f14493e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): core/index_method/toy_vector_sparse_ivf.rs:171-175 | core/index_method/toy_vector_sparse_ivf.rs:176-180 | core/index_method/toy_vector_sparse_ivf.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 \u0060core/index_method/toy_vector_sparse_ivf.rs:171\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":"core/index_method/toy_vector_sparse_ivf.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca5e7e61bfbf09d7ab5013b90dc5a5f10bcf8e884afda4bc2577e08a2066c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/translate/compound_select.rs:1010-1014 | core/translate/compound_select.rs:1042-1046 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/compound_select.rs:1010\u0060 it begins part-way through the construct above it, so those exact 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, \u0060core/translate/compound_select.rs:1009\u0060 calls \u0060add_comment\u0060, \u0060offset\u0060 and \u0060core/translate/compound_select.rs:1041\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":"core/translate/compound_select.rs"},"region":{"startLine":1010}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3cc2a420db7cff86c11da0e960d5f40ddb2a413e4fe4ed6d05d179125f6c78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/connection.rs:4257-4261 | core/connection.rs:4332-4336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/connection.rs:4257\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":"core/connection.rs"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1872d148947f32664986d2c8e1a8e5dbcdb4062c8d82d93a9eab01bbe829a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/database.rs:3519-3523 | core/ext/mod.rs:276-280 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"core/database.rs"},"region":{"startLine":3519}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb93642a0281f636a7aecdd9afc04315309de13a1c130e2dab3f0fb5c3cf10ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): core/index_method/fts/mod.rs:2997-3001 | core/index_method/fts/mod.rs:3031-3035 | core/index_method/fts/mod.rs:3076-3080 | core/index_method/fts/mod.rs:3092-3096 | core/index_method/fts/mod.rs:3719-3723 \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":"core/index_method/fts/mod.rs"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ed2e455a58a7e0a37c39b3a998604ed66250a9bc4da7940dc7dc55c3c5f612"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): core/mvcc/database/mod.rs:10330-10335 | core/mvcc/database/mod.rs:10447-10452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/mvcc/database/mod.rs:10330\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/mod.rs"},"region":{"startLine":10330}}}],"partialFingerprints":{"codehealthFindingId/v1":"2684e455a6a9e2bd44f269a0301f269202ca833e8934c17cf5fac971b6b0a3ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/schema.rs:2891-2898 | core/schema.rs:3845-3852 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:2891\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"201d81b7343b55a6ddeefd5e337bff436c76e4e037ea975176ca09e457a6e3ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/schema.rs:5129-5133 | core/schema.rs:5154-5158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/schema.rs:5129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":5129}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ecfdb0c98d6d086f3b119ee84e4bb8282c1fda48e9383c933e1c2053374a3fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/translate/trigger_exec.rs:411-415 | core/translate/trigger_exec.rs:453-457 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060core/translate/trigger_exec.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":"core/translate/trigger_exec.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bbc123a61e14eeec8fdfbbb4d61176f2b2f72759d1ccafad7e4ad08f1c8252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): core/types.rs:949-956 | core/types.rs:2447-2454 \u2014 both copies are in the same file, so extract the block 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":"core/types.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57323864443531552a4589af9604012028a8f1575360bdc03ec48b42646ffe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): core/util.rs:2309-2313 | core/util.rs:2406-2410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":2309}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0f1f3b9e40f57d1384650e0734b1b4ad402c587150964ef7d085e4bd2a6ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): sync/sdk-kit/src/rsapi.rs:442-446 | sync/sdk-kit/src/rsapi.rs:468-472 | sync/sdk-kit/src/rsapi.rs:480-484 \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 \u0060sync/sdk-kit/src/rsapi.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":"sync/sdk-kit/src/rsapi.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"18aa878c2421383329aab8d8e5972da141938551f9d02f5cd3779424e72e8458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): testing/differential-oracle/sql_gen/src/trace.rs:276-280 | testing/differential-oracle/sql_gen/src/trace.rs:576-580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/sql_gen/src/trace.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":"testing/differential-oracle/sql_gen/src/trace.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b6a92abbac4dc1e32e1f0e123a731d5794ee40e564e4b97e6d32c43687af4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): testing/differential-oracle/sql_gen_prop/statement.rs:375-379 | testing/differential-oracle/sql_gen_prop/statement.rs:387-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 \u0060testing/differential-oracle/sql_gen_prop/statement.rs:375\u0060 it does not close everything it opens, so those exact 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, \u0060testing/differential-oracle/sql_gen_prop/statement.rs:393\u0060 calls \u0060create_index_for_table\u0060, \u0060prop_map\u0060, \u0060drop_table_for_table\u0060 and \u0060testing/differential-oracle/sql_gen_prop/statement.rs:381\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":"testing/differential-oracle/sql_gen_prop/statement.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd6886654d368d653ecc3a6fcdcbdf07afbfe2fca5ef65ac6aadde36d150b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:175-192 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:203-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 \u0060bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:175\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"626a16cd199be6a32f8e916c3f02ed27f958143c78f5b4641638628dd9dbca76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:237-251 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:256-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"c909a5c23dbb87f11168cf002872efe7816c13a3000000c9a53235580c6664ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:174-186 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:202-214 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:402-414 \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 \u0060bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java: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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34dce1db99ed39ce58931de8394e1415bc687148fedefddc688c7f8b80cff86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:174-184 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:195-205 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:216-226 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java:345-355 \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 \u0060bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java: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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4ResultSet.java"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"4da817306c9ff11e20b701ccfcc6665cf9c4f5c6d0e328efd718d35569d6d6a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:141-148 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:152-159 | bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java:163-170 \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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060x\u0060 to \u0060Date\u0060 in one and \u0060Time\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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"87242ee55421005c4f5617611d3ef43b89264e013c0646cd6563820ea3ba78f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2): bindings/python/turso/sqlalchemy/dialect.py:109-154 | bindings/python/turso/sqlalchemy/dialect.py:274-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. 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":"bindings/python/turso/sqlalchemy/dialect.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b884001fc2b493bd0ed8fb7ad65eb8baa9c453dbf8381fbc853de6adb022be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): bindings/python/turso/lib.py:140-172 | serverless/python/turso_serverless/dbapi.py:53-85 \u2014 before extracting anything, compare \u0060bindings/python/turso/lib.py\u0060 and \u0060serverless/python/turso_serverless/dbapi.py\u0060 as WHOLE FILES: this scan already matched 3 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":"bindings/python/turso/lib.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d25e485807d5d9cfe0e6ce98074c5ccfb3827f6bbfac4f23cbbbbbe721f566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): bindings/python/turso/lib.py:240-257 | serverless/python/turso_serverless/connection.py:82-99 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"bindings/python/turso/lib.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"41905039c426e22e32b97ea5eeab3ecb32fb2bc62eddf545ecee43834dd6b703"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): bindings/python/turso/sqlalchemy/dialect.py:137-152 | bindings/python/turso/sqlalchemy/dialect.py:302-317 | bindings/python/turso/sqlalchemy/dialect.py: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":"bindings/python/turso/sqlalchemy/dialect.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"808c485d77c9d5c45edeb0da79c4c55a980e1b012a27776b3c265cd12867824a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): testing/sqlright/crash_reports/lib/executor.py:54-68 | testing/sqlright/crash_reports/lib/executor.py:104-117 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/sqlright/crash_reports/lib/executor.py: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":"testing/sqlright/crash_reports/lib/executor.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"837406f128952aec9892fd1ff10b4417e28980bb41467d429fda549dbcd88115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): scripts/corruption-debug-tools/wal_commits.py:26-39 | scripts/corruption-debug-tools/wal_info.py:29-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/wal_commits.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d615d47f77bbf615880f81c5d6a2d70dbf0fd19377d2df9b22326f08a38c6f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): scripts/corruption-debug-tools/page_diff.py:31-42 | scripts/corruption-debug-tools/page_history.py:34-45 | scripts/corruption-debug-tools/verify_stale.py:35-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/page_diff.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f298c0507f39890a9f85b0f9fa7d4801aebcec8edd4e1c668d4a0a0ff62ea05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/sqlright/crash_reports/collect_crashes.py:158-169 | testing/sqlright/crash_reports/query_crashes.py:32-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlright/crash_reports/collect_crashes.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8526992d797e54eb98a7221d920f422ee311bb2d4256d87fbec1c2850d54a4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): scripts/corruption-debug-tools/page_diff.py:29-39 | scripts/corruption-debug-tools/page_info.py:33-43 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060scripts/corruption-debug-tools/page_diff.py:27\u0060 calls \u0060add_argument\u0060 and \u0060scripts/corruption-debug-tools/page_info.py: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":"scripts/corruption-debug-tools/page_diff.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"915cc9a0b0dc1e5654399760a7f6c7728fd32d245a07cfeb4f5abed880ad16df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): testing/antithesis/stress-composer/parallel_driver_nested_savepoint.py:47-56 | testing/antithesis/stress-composer/parallel_driver_savepoint.py:47-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. 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060testing/antithesis/stress-composer/parallel_driver_nested_savepoint.py:59\u0060 calls \u0060try_insert\u0060 and \u0060testing/antithesis/stress-composer/parallel_driver_savepoint.py:59\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":"testing/antithesis/stress-composer/parallel_driver_nested_savepoint.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84dff275ea2ee22faf4fca361aaf257367d2a42d60e7148322890844dc54b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): scripts/corruption-debug-tools/page_diff.py:31-39 | scripts/corruption-debug-tools/page_history.py:34-42 | scripts/corruption-debug-tools/page_info.py:35-43 | scripts/corruption-debug-tools/verify_stale.py:35-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 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/page_diff.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc99e92c756cddace4f19eb56b1971f7949172b5d5bd92f734fd4317b29ee81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bindings/python/turso/lib.py:1213-1221 | serverless/python/turso_serverless/dbapi.py:109-117 \u2014 before extracting anything, compare \u0060bindings/python/turso/lib.py\u0060 and \u0060serverless/python/turso_serverless/dbapi.py\u0060 as WHOLE FILES: this scan already matched 3 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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060cursor\u0060 to \u0060Cursor\u0060 in one and \u0060Any\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":"bindings/python/turso/lib.py"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"637c0b96c1a8837a1f3963cb98ca50a1c38a5df80d3de490808c2aa109c34822"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): scripts/corruption-debug-tools/page_diff.py:38-45 | scripts/corruption-debug-tools/page_history.py:41-48 | scripts/corruption-debug-tools/track_rowid.py:40-47 | scripts/corruption-debug-tools/verify_stale.py:42-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/page_diff.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dcc3696525ad9885d04c1e9b0768767ac381471aaaa8f8a4782d56170f99ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/corruption-debug-tools/page_diff.py:109-116 | scripts/corruption-debug-tools/page_diff.py:118-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/page_diff.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cda8f0eb4cd9408b1b83fecfa079bdd5d9b6caf6963731fd10ecb2d136995f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/corruption-debug-tools/page_info.py:95-102 | scripts/corruption-debug-tools/page_info.py:105-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/page_info.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f4e2266084b6e2c6b25a737f94b3b40f2578e8831f3a88463b04e893be8efc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): scripts/corruption-debug-tools/find_corrupt_frame.py:134-140 | scripts/corruption-debug-tools/page_diff.py:37-43 | scripts/corruption-debug-tools/page_history.py:40-46 | scripts/corruption-debug-tools/track_rowid.py:39-45 | scripts/corruption-debug-tools/verify_stale.py:41-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 all 5 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/corruption-debug-tools/find_corrupt_frame.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"4959fb5b5ba08ee5dfec887ebfa39205cf79204a8b55f1928b2975aea6fb1097"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): bindings/python/turso/lib.py:227-234 | serverless/python/turso_serverless/connection.py:69-76 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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 \u0060mode\u0060 to \u0060Optional[str]\u0060 in one and \u0060str | None\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":"bindings/python/turso/lib.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"68522d8a7a30e78d8ab81c661f3b6ad6550d84640610efff9256fb51c7ffe336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): bindings/python/turso/lib.py:263-268 | serverless/python/turso_serverless/connection.py:105-110 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"bindings/python/turso/lib.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae2dd10c80164af674c785ded15a85ea6bb4b5479f8f29b9bdb6e9a777a8b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): bindings/python/turso/lib.py:276-285 | serverless/python/turso_serverless/connection.py: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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060results\u0060 to \u0060Optional[list] = None\u0060 in one and \u0060list | None = None\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":"bindings/python/turso/lib.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"7389f7d69c46e3167f15654a483bd250225b65cec844aa1fe7ab979bfb7cc74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): bindings/python/turso/lib.py:1227-1235 | serverless/python/turso_serverless/dbapi.py:123-131 \u2014 before extracting anything, compare \u0060bindings/python/turso/lib.py\u0060 and \u0060serverless/python/turso_serverless/dbapi.py\u0060 as WHOLE FILES: this scan already matched 3 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":"bindings/python/turso/lib.py"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"43971f645e1a8fc85dfb6c0e3ba00e3c8c6017d83bfefdae503f23ef88d1eb26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201328 lines \u00D7 2): bindings/go/driver_db.go:97-124 | bindings/go/driver_db.go:392-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060bindings/go/driver_db.go: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. 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":"bindings/go/driver_db.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eef27c06bc84b89339489e3c8000be80dabff1349458f140925e219a1a6e9ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): bindings/go/driver_db.go:148-160 | bindings/go/driver_db.go:281-293 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/go/driver_db.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c42d3dd1d32b83cad1764be775c4d6be738c4be36df25b04cd5f8e72cc7f7a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): bindings/go/driver_sync.go:532-545 | bindings/go/driver_sync.go:571-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 \u0060bindings/go/driver_sync.go:532\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"bindings/go/driver_sync.go"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce04fb3bd703834213055d906fc6851653264b01a61bbe905f14a82f01437d14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): testing/stress-go/main.go:427-434 | testing/stress-go/main.go:560-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/stress-go/main.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d474143d2d503dbcb9cf43a4500c17c37df79035e04555307569e068b31fadb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): bindings/go/bindings_db.go:411-419 | bindings/go/bindings_db.go:474-482 | bindings/go/bindings_db.go:514-522 | bindings/go/bindings_db.go:527-535 | bindings/go/bindings_db.go:538-546 | bindings/go/bindings_sync.go:642-650 \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":"bindings/go/bindings_db.go"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35fb8908f8bb68e422ae2d61c1ef2c69bfb0e1d3263b27e9a40fdcaf426b6e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 9): bindings/go/bindings_db.go:422-431 | bindings/go/bindings_sync.go:461-470 | bindings/go/bindings_sync.go:474-483 | bindings/go/bindings_sync.go:488-497 | bindings/go/bindings_sync.go:501-510 | bindings/go/bindings_sync.go:514-523 | bindings/go/bindings_sync.go:527-536 | bindings/go/bindings_sync.go:540-549 | bindings/go/bindings_sync.go:630-639 \u2014 there are 9 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 9 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/go/bindings_db.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"669fc8fbb94eac0aaa4372bcdd6b708e5231403b0f3a2213cd75f8d46a19b9ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): bindings/go/bindings_db.go:449-458 | bindings/go/bindings_sync.go:558-567 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"bindings/go/bindings_db.go"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bff12957815d599d95e59b39b2064ab86dbf9d36a6610ad9016a4b11ac7e34"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (39 shared lines): perf/latency/turso_engine.rs:135-214 | perf/throughput/turso_engine.rs:130-200 \u2014 These two members are variants of one another: 39 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":"perf/latency/turso_engine.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e0eed6e2120de60a9ec2036b9a718b103c01b82d30bda92b2bd27aac11e181"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): perf/latency/sqlite_engine.rs:14-138 | perf/latency/turso_engine.rs:14-101 | perf/tatp/sqlite_engine.rs:45-115 | perf/tatp/turso_engine.rs:62-142 | perf/throughput/sqlite_engine.rs:12-114 | perf/throughput/turso_engine.rs:12-95 \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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb65ac523dd712456b77e98fe6f086721d313166dfb4d1d6d0b661bffc1bda4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1251-1273 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2075-2186 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2505-2583 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3126-3158 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"565c89883393d69896537ba6e64d8da84c3fa0257410274d52e61b65c0fbfe6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2909-2974 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2981-3027 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3063-3118 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3375-3411 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2909}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ad812a8d3c485caa9d39a482fb7b656db188df1a6e695a4d1f67306205020d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): perf/memory/src/profile/mixed.rs:44-114 | perf/memory/src/profile/read.rs:44-114 \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":"perf/memory/src/profile/mixed.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f31113781f2b1ed5724ebf8cfd9cd14736f55fcb2e3450e0136c4606bcc951d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): perf/memory/src/profile/scan.rs:36-91 | perf/memory/src/profile/update_churn.rs:48-117 \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":"perf/memory/src/profile/scan.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"559b6613f37f14bd655250dd049a66dc53e954d4bd6e5fbe4b2dd8afb16919d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2025-2072 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3165-3214 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f09f0d8f678383ceaf88bf4f203697699c8f6655964bb03abac07326235bbae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1142-1166 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2318-2356 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e23f9207e2845c8a83a6f9d2815f2d97f574cf233e214e556a6afe4704fc9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): perf/latency/turso_engine.rs:236-277 | perf/throughput/turso_engine.rs:215-256 \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":"perf/latency/turso_engine.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecc83b0139501faeeb45e5a0334ec94521597a4a6a78d20a1b93c270528fef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): perf/connection/limbo/src/main.rs:16-57 | perf/connection/rusqlite/src/main.rs:13-50 \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":"perf/connection/limbo/src/main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"414f0859ea3abe4c0c82941830d32003a4817aa0cd5c7e153d24e2d4516f2b50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): perf/tatp/plot/plot-mqth.py:42-66 | perf/tatp/plot/plot-response-times.py:45-71 \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":"perf/tatp/plot/plot-mqth.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1197269780895fe104955240f41ebecf4c816ef33b9676e5865d15bb03cf6c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): testing/differential-oracle/fuzzer/shrink.rs:574-634 | testing/differential-oracle/fuzzer/shrink.rs:798-846 \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":"testing/differential-oracle/fuzzer/shrink.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2c74e32525a548530f227fb7fa7305aaa2008a9084219043f46d99f17cbfe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2694-2727 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2730-2763 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2694}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e59a5c97b1e636fcb7574b7927190baf6725f522e60d4251d1023253a6d44b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): perf/tatp/main.rs:760-805 | perf/throughput/main.rs:541-585 \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":"perf/tatp/main.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2930190d57c88833a785a64007c3b57c10574bb31f8510b54ea155481ec672c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): testing/differential-oracle/fuzzer/schema.rs:285-319 | testing/differential-oracle/fuzzer/schema.rs:325-355 \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":"testing/differential-oracle/fuzzer/schema.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed2b0b982d8b05c770f07da4c9dc5c698f6abe07c6de09adeb7865d252b5e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): perf/tatp/main.rs:550-574 | perf/throughput/main.rs:296-320 \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":"perf/tatp/main.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"582a5fe855f105c375e2a242e0cf239b5e7d0e96f8ec0ef26cf508129d9c3785"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): testing/differential-oracle/fuzzer/oracle.rs:250-281 | testing/differential-oracle/fuzzer/oracle.rs:284-317 \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":"testing/differential-oracle/fuzzer/oracle.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7a8b3924040e8673d97ba1eb6312b39c0103e34263a0457979994e2fa70dbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): perf/tatp/main.rs:915-943 | perf/throughput/main.rs:639-667 \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":"perf/tatp/main.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fc30946916259f85cdf1412446fdf62fcb94781e2b0d00a40e708189e33e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:610-630 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1199-1222 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ab96dcf496fbeeb61bb7632b045e390f41b65df97b3461745678d11212fb6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): testing/cli_tests/update.py:20-49 | testing/cli_tests/update.py:62-95 \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":"testing/cli_tests/update.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43e324fa6ab1e83cfecd584f70437f2c481cf12104473ae7d05806b77b72dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2366-2397 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2669-2691 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2366}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9c815865b49430c5ab415582659c9ea788c371b78ec50f200a146b31c4c472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): perf/memory/src/stack_report.rs:800-827 | perf/memory/src/stack_report.rs:829-856 \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":"perf/memory/src/stack_report.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0672359c36142733b465c02034981306814df43c1f9d950c99cc3c6b7a17914"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): testing/cli_tests/cli_test_cases.py:346-362 | testing/cli_tests/cli_test_cases.py:366-385 \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":"testing/cli_tests/cli_test_cases.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"5996ef21d7c74f6ce9ce936691e9e7677555a83c95a7c8d067d28177b37be014"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): perf/latency/main.rs:562-591 | perf/tatp/main.rs:865-893 | perf/throughput/main.rs:588-617 \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":"perf/latency/main.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"c106cb381167ce372e438e68f8625b3e2fee88295470dbbe94adcb08637cd72e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): perf/tatp/main.rs:895-913 | perf/throughput/main.rs:619-637 \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":"perf/tatp/main.rs"},"region":{"startLine":895}}}],"partialFingerprints":{"codehealthFindingId/v1":"777e7dbe0f28a354bf82edb2c3dbbe3c33eff2795052e949469f0855963cbd82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): perf/tatp/main.rs:972-984 | perf/throughput/main.rs:696-708 \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":"perf/tatp/main.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3352a54df503798b12eacaa225449803f97ef6634db959552351406e6dda96"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): testing/differential-oracle/fuzzer/printf_gen.rs:587-611 | testing/differential-oracle/fuzzer/printf_gen.rs:614-637 \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":"testing/differential-oracle/fuzzer/printf_gen.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"7379f7c15aa897e90e9f67dcf23e6301e65cb866d96792469514868366ff49d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): perf/latency/sqlite_engine.rs:149-162 | perf/tatp/sqlite_engine.rs:313-325 | perf/throughput/sqlite_engine.rs:125-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 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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c03b5e1c5e45a8e8f1aca9f41eb735ee3de62c04ecd95a89ecc224d9b43e9d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1232-1245 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1276-1289 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fde974a1e019980e015499cf05bcc6b907863c03e5439b406bd49499a9d87a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): testing/differential-oracle/fuzzer/schema.rs:159-172 | testing/differential-oracle/fuzzer/schema.rs:175-188 \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":"testing/differential-oracle/fuzzer/schema.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa685814cadd3b5fe16a2c77158cf8c3e399431531c538f41f3265a3503d1ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): testing/cli_tests/collate.py:126-143 | testing/cli_tests/update.py:108-126 \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":"testing/cli_tests/collate.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcf8d8ef9723e4f62e27995ba5c3b661da1236e1b9816c97878e43eb2b43d8a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3959-3971 | testing/differential-oracle/fuzzer/runner.rs:491-503 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":3959}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cc7fe4a8227f7ef6a6cee989d877f689678ccd09ab2e511a5c945f97840214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): perf/latency/main.rs:545-553 | perf/tatp/main.rs:1042-1050 | perf/throughput/main.rs:766-774 \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":"perf/latency/main.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6260a926e1976325b153485a28d1a1e03fcb0a97a207bc1224c15f973ca9d684"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:379-391 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:393-405 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"617603cb1d58e34292125fbcf66dea9d2a569d964743279038c50c15f9c9ddf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): perf/latency/sqlite_engine.rs:164-177 | perf/throughput/sqlite_engine.rs:149-162 \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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a9248530cde636446eb05326027e420ec77b0c7c84203d807f0f0b7a97ab8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): perf/memory/src/mvcc_row_memory.rs:142-146 | perf/memory/src/workload.rs:244-252 \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":"perf/memory/src/mvcc_row_memory.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"10099b6a44af40126f9d13651a9837255d23fc43c945be9f9d344c82d16bc0bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 4): perf/memory/src/profile/mixed.rs:45-80 | perf/memory/src/profile/read.rs:45-80 | perf/memory/src/profile/scan.rs:37-72 | perf/memory/src/profile/update_churn.rs:49-84 \u2014 before extracting anything, compare \u0060perf/memory/src/profile/mixed.rs\u0060 and \u0060perf/memory/src/profile/read.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060perf/memory/src/profile/mixed.rs:45\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/memory/src/profile/mixed.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7eb0269b7753d0ac469daf0b806a59a710332867710af4f48c9f508ff21706"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): perf/latency/turso_engine.rs:237-266 | perf/throughput/turso_engine.rs:216-245 \u2014 \u0060perf/latency/turso_engine.rs\u0060 and \u0060perf/throughput/turso_engine.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 8 separate duplicated blocks between them, totalling at least 121 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 \u0060perf/latency/turso_engine.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":"perf/latency/turso_engine.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ec43ed2f7cc5fc09be0ae55bb56d5725cab9058478d1636db69aaccc722c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): perf/connection/limbo/src/main.rs:31-57 | perf/connection/rusqlite/src/main.rs:24-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 \u0060perf/connection/limbo/src/main.rs:31\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/connection/limbo/src/main.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f832d89db66584cfcbb521594df9d9773e9bc513ec6d62f90a7e3714808bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): perf/memory/src/profile/mixed.rs:88-114 | perf/memory/src/profile/read.rs:88-114 \u2014 before extracting anything, compare \u0060perf/memory/src/profile/mixed.rs\u0060 and \u0060perf/memory/src/profile/read.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060perf/memory/src/profile/mixed.rs:88\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/memory/src/profile/mixed.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0549ae4f079da180d00ba3ce8ab11d4be5ac12a77e45e2e21f86dca40f19716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2026-2050 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3166-3191 \u2014 both copies are in the same file, so extract the block 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, \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3192\u0060 calls \u0060random_range\u0060 and \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2053\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"34eceaf206fea13722ac1759b336fcc02854e913e16e7215c90368de48e9c6ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): perf/latency/sqlite_engine.rs:37-61 | perf/throughput/sqlite_engine.rs:34-58 \u2014 \u0060perf/latency/sqlite_engine.rs\u0060 and \u0060perf/throughput/sqlite_engine.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 65 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 \u0060perf/latency/sqlite_engine.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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"972a6053d9edc651122922a79a70c91a9eb33b0387d150a19725b967fa9a5fb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): perf/tatp/main.rs:734-758 | perf/throughput/main.rs:515-539 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:734\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/main.rs"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"94da28d00c50b9fc99e537ee711c906ddb4c7f14b1c9768db1423e0e9adb33f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): perf/tatp/main.rs:920-943 | perf/throughput/main.rs:644-667 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:920\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/main.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b8500d505fd19113834f273bc62b5e0007eaf401de9181cc5e2424da17d04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201323 lines \u00D7 2): perf/latency/turso_engine.rs:136-158 | perf/throughput/turso_engine.rs:131-149 \u2014 \u0060perf/latency/turso_engine.rs\u0060 and \u0060perf/throughput/turso_engine.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 8 separate duplicated blocks between them, totalling at least 121 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 \u0060perf/latency/turso_engine.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060perf/latency/turso_engine.rs:159\u0060 calls \u0060wait_until\u0060, \u0060now\u0060 and \u0060perf/throughput/turso_engine.rs:153\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":"perf/latency/turso_engine.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ed323c5d47637b015c8d3859837dcb8a19c6bd90b59677bf06c36c101be81a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201322 lines \u00D7 2): perf/encryption/src/main.rs:421-439 | perf/encryption/src/main.rs:440-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 \u0060perf/encryption/src/main.rs:421\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/encryption/src/main.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d205533bb47b6f2e1fbfed9340ac2b25688f17a282d7d3a09bb26515923b890"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:4332-4353 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:4570-4591 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:4332\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":4332}}}],"partialFingerprints":{"codehealthFindingId/v1":"38442be72bbdcecd8d8de6791680c2990af7b8ad7a6eeac5033a81e0a1539034"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): testing/differential-oracle/fuzzer/ivm.rs:1163-1183 | testing/differential-oracle/fuzzer/ivm.rs:1239-1259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/ivm.rs:1163\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":1163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1531a34472ff5676022f54506bacf11c7638106719e748d0f2f1ec8281a01278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:611-630 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1203-1222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1203\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfda8db7eeefc53def5610abc852c011ec3ca8753d9f55f9a549d2a7c8d7fb56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1145-1164 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2334-2353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3d87bc4acb0ca2513cf9a1b7542e671dce76b873a60b37204cb1851ee8d4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): perf/latency/sqlite_engine.rs:102-118 | perf/latency/turso_engine.rs:62-78 \u2014 before extracting anything, compare \u0060perf/latency/sqlite_engine.rs\u0060 and \u0060perf/latency/turso_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/latency/sqlite_engine.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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5198b9a21471d73e1de472bbb171850ba87cf0ea004bd97f9e6f822cfdb627f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): perf/tatp/main.rs:897-913 | perf/throughput/main.rs:621-637 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:897\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines 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 \u0060path\u0060 to \u0060\u0026Path\u0060 in one and \u0060\u0026std::path::Path\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/main.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"642f92395d6ad8389909661895e450f06ec682dcabd309059ef02bb8a3b11344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 4): perf/tatp/sqlite_engine.rs:86-100 | perf/tatp/turso_engine.rs:108-122 | perf/throughput/sqlite_engine.rs:84-99 | perf/throughput/turso_engine.rs:55-69 \u2014 before extracting anything, compare \u0060perf/tatp/sqlite_engine.rs\u0060 and \u0060perf/tatp/turso_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/tatp/sqlite_engine.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":"perf/tatp/sqlite_engine.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c2f66dc98336273b3d568b876517493c1cb2dc2573a2d5fb6fb2ff87f4ff48"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): perf/tatp/sqlite_engine.rs:191-206 | perf/tatp/turso_engine.rs:233-248 \u2014 before extracting anything, compare \u0060perf/tatp/sqlite_engine.rs\u0060 and \u0060perf/tatp/turso_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/tatp/sqlite_engine.rs:191\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/sqlite_engine.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e684aff2a072a6a678bff088a7e6ae039b3a1537deb3acd37e15ec08805f30b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2128-2144 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2156-2172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"777853fb992cbf39690aa120a77c7bff17d4af023518cafa70c3f625f40ac210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): testing/differential-oracle/fuzzer/printf_fuzzer.rs:377-392 | testing/differential-oracle/fuzzer/printf_fuzzer.rs:404-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 \u0060testing/differential-oracle/fuzzer/printf_fuzzer.rs:377\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/printf_fuzzer.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"653406ba911e5ccaeb94a3ffef6766a1362f6a457dfefa88af2e4462e457c733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 6): perf/latency/sqlite_engine.rs:112-125 | perf/latency/turso_engine.rs:72-85 | perf/tatp/sqlite_engine.rs:94-107 | perf/tatp/turso_engine.rs:116-129 | perf/throughput/sqlite_engine.rs:93-106 | perf/throughput/turso_engine.rs:63-76 \u2014 before extracting anything, compare \u0060perf/latency/sqlite_engine.rs\u0060 and \u0060perf/latency/turso_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/latency/sqlite_engine.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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dfa8b8ee51b8f7107ae3721a813fc21453f38c18ffd3361f2ff7fa6642b449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1303-1316 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2129-2142 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2157-2170 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1303}}}],"partialFingerprints":{"codehealthFindingId/v1":"6876f93fc87e13e42ee727ab34f2122df9e7079b2072216dc2dd5349232df7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): perf/latency/turso_engine.rs:112-125 | perf/throughput/turso_engine.rs:106-119 \u2014 \u0060perf/latency/turso_engine.rs\u0060 and \u0060perf/throughput/turso_engine.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 8 separate duplicated blocks between them, totalling at least 121 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":"perf/latency/turso_engine.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d257e7d6748f6b4d236e9be8e5ffe2a19b5c7268bf3c8313632b0f9ecabb3f24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): testing/differential-oracle/fuzzer/ivm.rs:769-782 | testing/differential-oracle/fuzzer/ivm.rs:1292-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 \u0060testing/differential-oracle/fuzzer/ivm.rs:769\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0770829deef54df7cd4286c67e2dbd96843b6160385a8439d03732fea2b04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): perf/latency/main.rs:523-540 | perf/tatp/main.rs:1008-1025 | perf/throughput/main.rs:732-749 \u2014 \u0060perf/latency/main.rs\u0060 and \u0060perf/tatp/main.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 6 separate duplicated blocks between them, totalling at least 52 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060\u0026std::path::Path\u0060 in one and \u0060\u0026Path\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":"perf/latency/main.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f2403c60ad40c52c60fe9d5ee11f749411dc9659c31481ebbfc18c3e861b7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): perf/latency/turso_engine.rs:32-43 | perf/throughput/turso_engine.rs:25-37 \u2014 \u0060perf/latency/turso_engine.rs\u0060 and \u0060perf/throughput/turso_engine.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 8 separate duplicated blocks between them, totalling at least 121 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":"perf/latency/turso_engine.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fd4b8f9eb2675a55894678746971ddbeec2118e4e47f92e32fbbeaa28efc82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 5): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1259-1270 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2083-2094 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2529-2539 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2563-2573 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3138-3149 \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 \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1259\u0060 it begins part-way through the construct above it, so those exact 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, \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2574\u0060 calls \u0060push\u0060, \u0060join\u0060 and \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2540\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1377470c055aa85fc46766e931786e7db79e35420746041b16d16e7dda4cd97d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201321 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:823-843 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:934-948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:823\u0060 it does not close everything it opens, so those exact lines 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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5ad27f06fbd2791ed8a6c859822b9fc722a4a92cfc2e8bf4dd7ca40418a3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2053-2064 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3194-3205 \u2014 both copies are in the same file, so extract the block 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, \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3192\u0060 calls \u0060random_range\u0060 and \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2050\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d66452ca1a9bce772a4ea12fdbb8fb5f222983c51ac284a62cb73017b05bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2670-2681 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2695-2706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2670\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"d134424e3f25d086b0db5fe44b1f8cc5654857a522f564102fb6089a51b66ba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3254-3265 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3332-3342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3254\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":3254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3602ac05dcbb84fa34416ff26c02877c239056ab70ab8c1a821d7c464f911939"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:4543-4554 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:4558-4569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:4543\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":4543}}}],"partialFingerprints":{"codehealthFindingId/v1":"892da0c5bbc0c515f23c5f565cc3469e340fa00c3e374f91062ada0ca478d81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): testing/differential-oracle/fuzzer/schema.rs:296-307 | testing/differential-oracle/fuzzer/schema.rs:332-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":"testing/differential-oracle/fuzzer/schema.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5489ef5da9fedbbeec9d858c3793c0ceada5f6aff14f75ea5d8f8c863a082131"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): perf/latency/sqlite_engine.rs:152-162 | perf/tatp/sqlite_engine.rs:315-325 | perf/throughput/sqlite_engine.rs:128-138 \u2014 \u0060perf/latency/sqlite_engine.rs\u0060 and \u0060perf/tatp/sqlite_engine.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 33 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 \u0060perf/latency/sqlite_engine.rs:152\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/latency/sqlite_engine.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"620b97782a750cd573b2ad13105acb42381113190c5152535ca60c803894f8bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): perf/latency/main.rs:414-424 | perf/throughput/main.rs:323-333 \u2014 \u0060perf/latency/main.rs\u0060 and \u0060perf/throughput/main.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 8 separate duplicated blocks between them, totalling at least 71 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":"perf/latency/main.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cb85fdbb53e425127135001c71ecad0564cd84f6d5338be2930a8e9166e7e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): perf/latency/turso_engine.rs:181-191 | perf/throughput/turso_engine.rs:168-178 \u2014 \u0060perf/latency/turso_engine.rs\u0060 and \u0060perf/throughput/turso_engine.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 8 separate duplicated blocks between them, totalling at least 121 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 \u0060perf/latency/turso_engine.rs:181\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":"perf/latency/turso_engine.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f856bc23e3ba04ade8d4ae853cc2fba9ca822583225a2d52478e65727e357a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): perf/memory/src/stack_report.rs:817-827 | perf/memory/src/stack_report.rs:846-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/memory/src/stack_report.rs:817\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/memory/src/stack_report.rs"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdf7b78a0dd397e0654d330d456da7dcc1df3924a3acf85b94077eab97087b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): perf/tatp/sqlite_engine.rs:53-63 | perf/throughput/sqlite_engine.rs:16-26 \u2014 \u0060perf/tatp/sqlite_engine.rs\u0060 and \u0060perf/throughput/sqlite_engine.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 60 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":"perf/tatp/sqlite_engine.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"30dd656e6e1ba526196efc88e0b55cfea68aeeac617a6ad16a0f2b19bd82f81c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:301-311 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:344-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"b396502b76734540ebb2092d38625d20a37b8c620d1d0a3d36db3900ddecee18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1773-1783 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1847-1857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1773\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"9489d98b936983d0d1322a82f13cb4e0e6791f511935ecbd184391abe41a162a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): testing/differential-oracle/fuzzer/ivm.rs:799-809 | testing/differential-oracle/fuzzer/ivm.rs:883-893 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"4856c3b9ee4262f8a78f1bcf82f0a6dd13f2e3b4bb4e06df880f991b5fead67c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): perf/tatp/main.rs:554-563 | perf/throughput/main.rs:300-309 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:554\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/main.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"009c91dde017b72b1a4bae69f841beced2e33100855069c38af4481b6df04c1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): perf/tatp/main.rs:565-574 | perf/throughput/main.rs:311-320 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:565\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/main.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d694949aacd354a88abbc05bc11170ff8ff5592103d2d5ab4eeee219199c3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1724-1733 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2787-2796 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1724\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac5a5cb91298c5643c340e2bed0c8be87710eada2dcc1e055f931107609ee56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): testing/differential-oracle/fuzzer/ivm.rs:327-335 | testing/differential-oracle/fuzzer/ivm.rs:599-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db6f1e4937940c5aa6539290bb8970108731af059e4b2d8dd628e3bfc44070b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): testing/differential-oracle/fuzzer/ivm.rs:1042-1051 | testing/differential-oracle/fuzzer/ivm.rs:1300-1309 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/ivm.rs:1042\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d75a54ec25557715c5e08b5201705f9436ccb16de41aec9d7cfdef1f31f7396"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): perf/latency/turso_engine.rs:165-173 | perf/throughput/turso_engine.rs:153-161 \u2014 \u0060perf/latency/turso_engine.rs\u0060 and \u0060perf/throughput/turso_engine.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 8 separate duplicated blocks between them, totalling at least 121 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 \u0060perf/latency/turso_engine.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060perf/latency/turso_engine.rs:159\u0060 calls \u0060wait_until\u0060, \u0060now\u0060 and \u0060perf/throughput/turso_engine.rs:149\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":"perf/latency/turso_engine.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7737e33259b430f8636d072078eabe1fb3a66265431444a8b431a0af8b957f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:781-788 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:805-812 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1738-1745 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1778-1785 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1852-1859 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9ecf30812092f8c44597f1df9e63fe5085f68a18e8d68ad4b00134bbeaf66e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): perf/memory/src/profile/insert.rs:40-47 | perf/memory/src/profile/mixed.rs:78-85 | perf/memory/src/profile/read.rs:78-85 | perf/memory/src/profile/scan.rs:70-77 \u2014 before extracting anything, compare \u0060perf/memory/src/profile/mixed.rs\u0060 and \u0060perf/memory/src/profile/read.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060perf/memory/src/profile/insert.rs:40\u0060 it does not close everything it opens, so those exact 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, \u0060perf/memory/src/profile/mixed.rs:87\u0060 calls \u0060random_bool\u0060, \u0060random_range\u0060 and \u0060perf/memory/src/profile/insert.rs:48\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":"perf/memory/src/profile/insert.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a3453adf778a94667bae11f3b921faad6bdc251d6a8caa9c5e00c9966c29a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): perf/latency/main.rs:546-553 | perf/tatp/main.rs:1043-1050 | perf/throughput/main.rs:767-774 \u2014 \u0060perf/latency/main.rs\u0060 and \u0060perf/tatp/main.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 6 separate duplicated blocks between them, totalling at least 52 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":"perf/latency/main.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e96a1e1eee3498276c3655ebbce792bd53810d6f7247e8139b36ae77489648"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): perf/latency/sqlite_engine.rs:22-28 | perf/tatp/sqlite_engine.rs:54-61 | perf/throughput/sqlite_engine.rs:17-24 \u2014 \u0060perf/latency/sqlite_engine.rs\u0060 and \u0060perf/tatp/sqlite_engine.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 33 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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50a22e9ad323666ee016b284187062881675374cc3006b73474b198b8c59857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2860-2867 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3251-3258 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3268-3275 \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, \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3264\u0060 calls \u0060random_range\u0060 and \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2859\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2860}}}],"partialFingerprints":{"codehealthFindingId/v1":"51320b483de4239a6032e50be7cac86a4d94afa896266a344819cfe6154c5cf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): perf/latency/main.rs:432-439 | perf/throughput/main.rs:371-378 \u2014 \u0060perf/latency/main.rs\u0060 and \u0060perf/throughput/main.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 8 separate duplicated blocks between them, totalling at least 71 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":"perf/latency/main.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"833d42397a7290048b83b6f5b29cf075e5515f96c5921a3963af534db155f682"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): perf/latency/sqlite_engine.rs:89-101 | perf/latency/turso_engine.rs:201-214 \u2014 before extracting anything, compare \u0060perf/latency/sqlite_engine.rs\u0060 and \u0060perf/latency/turso_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/latency/sqlite_engine.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. 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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6821c0e4195a2d23b644b4271182e004a2982cbb3b103a94d9e27a2f64ef78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): perf/tatp/main.rs:770-777 | perf/throughput/main.rs:551-558 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:770\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/main.rs"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"708b1a55dcfcd19c52c6a268329ff687d9f0ae1d0ec655e8eb2549ef2dcf9815"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): perf/tatp/sqlite_engine.rs:47-54 | perf/tatp/turso_engine.rs:68-75 \u2014 before extracting anything, compare \u0060perf/tatp/sqlite_engine.rs\u0060 and \u0060perf/tatp/turso_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other 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":"perf/tatp/sqlite_engine.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef424e17e0e71d002d1a56724be0b3c9a4b91d403397e61e30e69efbc9851eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): perf/throughput/sqlite_engine.rs:77-83 | perf/throughput/turso_engine.rs:193-200 \u2014 before extracting anything, compare \u0060perf/throughput/sqlite_engine.rs\u0060 and \u0060perf/throughput/turso_engine.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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/throughput/sqlite_engine.rs:77\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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":"perf/throughput/sqlite_engine.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc8e81a0158ebe658cf2e4e92771688ef0196c480465f45f42f0d1a92c86099"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2100-2107 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2111-2118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2100\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e50a38e150cfe1e8dee7a8641d57b1f207296db3bbd281da657cc101ea5e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/differential-oracle/fuzzer/schema.rs:439-446 | testing/differential-oracle/fuzzer/schema.rs:483-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/schema.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af5c3162f6cb2c222a2a1fa5b9a9ab505c71085b94c4816d02b135332cb72a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2862-2868 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3253-3259 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3270-3276 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3331-3337 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa6a8c04f812b0c501e7d78afbc071aa30efbf87054997c23ae5c6bf0202d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2372-2378 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2674-2680 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2699-2705 \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 \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2372\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f0dc2ea822e97e915d896941b74b5b446591e9ebb8150afb04e152e6bf5118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): perf/fts/src/main.rs:149-155 | perf/fts/src/main.rs:174-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 \u0060perf/fts/src/main.rs:149\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":"perf/fts/src/main.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2b225715831d4c0324a075ac701245052834d5fd4c5146912223c18bb06f69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): perf/latency/turso_engine.rs:21-27 | perf/throughput/turso_engine.rs:17-23 \u2014 \u0060perf/latency/turso_engine.rs\u0060 and \u0060perf/throughput/turso_engine.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 8 separate duplicated blocks between them, totalling at least 121 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":"perf/latency/turso_engine.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba7bc685e7262fabb18739f12f010bdee92ca1c6cc25a366e1e1424a17c4144a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2916-2922 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2991-2997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2916\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2916}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b197ca99ecc6fc96f1c5bf9e5d2b8c5543bc23330d09efb9f664a3da58237af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3581-3586 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3728-3733 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3755-3760 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3785-3790 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3817-3822 \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 \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3581\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7a8ef3dfe598fa84ba0e95b236363057302498a0d55711493db1fe6976206f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): perf/latency/main.rs:600-606 | perf/tatp/main.rs:896-902 | perf/throughput/main.rs:620-626 \u2014 \u0060perf/latency/main.rs\u0060 and \u0060perf/tatp/main.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 6 separate duplicated blocks between them, totalling at least 52 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 \u0060perf/latency/main.rs:600\u0060 it does not close everything it opens, so those exact lines 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 \u0060path\u0060 to \u0060\u0026Path\u0060 in one and \u0060\u0026std::path::Path\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/latency/main.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"68038e095010fae382b3f7a00ee32f36824023f8a3a471b21b99921153423c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): perf/latency/sqlite_engine.rs:17-23 | perf/latency/turso_engine.rs:27-33 \u2014 before extracting anything, compare \u0060perf/latency/sqlite_engine.rs\u0060 and \u0060perf/latency/turso_engine.rs\u0060 as WHOLE FILES: this scan already matched 4 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/latency/sqlite_engine.rs:17\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/latency/sqlite_engine.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5923ac49c2baa0e1997a5b57dc847515874b221dde8191a7a9cbf1322f02f0ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): perf/tatp/main.rs:512-517 | perf/throughput/main.rs:383-388 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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":"perf/tatp/main.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac642bfce8e7b64b1e60b5b32c679ee56454f99a74ae81348f0781d0821da6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): perf/tatp/main.rs:519-524 | perf/throughput/main.rs:390-395 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:519\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":"perf/tatp/main.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea52f015041dd063bf0069682df9fb1f16a4f9e2e8a4cf074381bbeebfe7f4d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): perf/tatp/main.rs:977-984 | perf/throughput/main.rs:701-708 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:977\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/main.rs"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c0de1cf630aab9d55e2bbd7eaa5ac315e5be7824e133b537fdaabae2a6b7f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): perf/tatp/turso_engine.rs:74-79 | perf/throughput/turso_engine.rs:24-29 \u2014 \u0060perf/tatp/turso_engine.rs\u0060 and \u0060perf/throughput/turso_engine.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 3 separate duplicated blocks between them, totalling at least 36 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 \u0060perf/tatp/turso_engine.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":"perf/tatp/turso_engine.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfacf62cf8f8cd4bb6776208a4871ce6d72475a54c7aab355594f84240cb2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1665-1671 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3223-3229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1665\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1665}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a9d128d0d07eb416584234e3d751cbb682aec63fcea97ecfc5ba59ba8de11f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2704-2709 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2740-2745 \u2014 both copies are in the same file, so extract the block 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, \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2746\u0060 calls \u0060random_range\u0060 and \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2710\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2704}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a94528ca7a540dcc17f1ab12720a99551fd149760f2d211b679b5023eb75102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): testing/differential-oracle/fuzzer/schema.rs:239-245 | testing/differential-oracle/fuzzer/schema.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 \u0060testing/differential-oracle/fuzzer/schema.rs:239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/schema.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda1c75bbfb3ea381f7eda87a3bed128ded78848b7bf9669f16f424a279bfe3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2919-2923 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2994-2998 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3094-3098 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3384-3388 \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 \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2919\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2919}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe32119e44502491f9e3ab6cfdf74f32c2a12242cc77da20fdbdf9a1ff029fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): perf/latency/main.rs:634-638 | perf/tatp/main.rs:973-977 | perf/throughput/main.rs:697-701 \u2014 \u0060perf/latency/main.rs\u0060 and \u0060perf/tatp/main.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 6 separate duplicated blocks between them, totalling at least 52 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":"perf/latency/main.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"7493849e934b0cafa0d2f64352a7b7f4d15f496e95471fc03962b2b7d151473b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2678-2683 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2703-2708 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:2739-2744 \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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":2678}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab83a0fd6ea08fb51f045d4287c67862859a8b9886b7cbba06f42c5fa43cc735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): perf/latency/main.rs:650-655 | perf/tatp/main.rs:955-960 | perf/throughput/main.rs:679-684 \u2014 \u0060perf/latency/main.rs\u0060 and \u0060perf/tatp/main.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 6 separate duplicated blocks between them, totalling at least 52 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":"perf/latency/main.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"774dc62402e039b64669e75fe2cf1938503b2af83fa1896c8a8512dbf2eafe62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): perf/memory/src/profile/mixed.rs:25-36 | perf/memory/src/profile/read.rs:25-36 \u2014 before extracting anything, compare \u0060perf/memory/src/profile/mixed.rs\u0060 and \u0060perf/memory/src/profile/read.rs\u0060 as WHOLE FILES: this scan already matched 4 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":"perf/memory/src/profile/mixed.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"52102a214dec5af27822b3da46dc716f93d86d4c407e5fd08ecf1faedd44abdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): perf/tatp/main.rs:372-382 | perf/throughput/main.rs:264-274 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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":"perf/tatp/main.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72864201bedcd787970e2151bd22dc38a0ee72a563e68898d7dabb665b13804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): perf/memory/src/profile/insert.rs:31-42 | perf/memory/src/profile/series_blob.rs:31-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 \u0060perf/memory/src/profile/insert.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. 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":"perf/memory/src/profile/insert.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58daba9e5ab11faba97b03710e0b2d5b249cd316ccd3f03f79d1480e24adc4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3610-3621 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3659-3669 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3698-3709 \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 \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:3610\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":3610}}}],"partialFingerprints":{"codehealthFindingId/v1":"7874429cd0169e891a6db3ad7f4e689685737391f34a5366bee84b43fe064962"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): perf/tatp/main.rs:872-882 | perf/throughput/main.rs:595-605 \u2014 \u0060perf/tatp/main.rs\u0060 and \u0060perf/throughput/main.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 17 separate duplicated blocks between them, totalling at least 188 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 \u0060perf/tatp/main.rs:872\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/main.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafee1d4b7434eab6aa013e2b1dcc12824c5383e6bbe9272bd5dfb7850a17989"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): testing/differential-oracle/fuzzer/ivm.rs:1426-1434 | testing/differential-oracle/fuzzer/ivm.rs:1465-1473 \u2014 both copies are in the same file, so extract the block 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":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c735c616150c86048225dce32e306aa83226fb5991d8669ef5e85638bbdb959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fuzz/fuzz_targets/expression.rs:209-217 | fuzz/fuzz_targets/expression.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 \u0060fuzz/fuzz_targets/expression.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":"fuzz/fuzz_targets/expression.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3edc558ed26af62d2d0f9218216adf68ad459d49ca633635745d58382fb792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:911-918 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:926-932 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:911\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3314bc94b9f7a34b0eb084416efc01c70a6364bdafddcaf8b6c17b145571fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): perf/latency/main.rs:563-570 | perf/tatp/main.rs:866-873 | perf/throughput/main.rs:589-596 \u2014 \u0060perf/latency/main.rs\u0060 and \u0060perf/tatp/main.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 6 separate duplicated blocks between them, totalling at least 52 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060path\u0060 to \u0060\u0026Path\u0060 in one and \u0060\u0026std::path::Path\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/latency/main.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"902606eeed438107ae7a541b4414fad3ab154efb3870ad6da1df2233df8ac80e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): perf/memory/src/stack_report.rs:801-808 | perf/memory/src/stack_report.rs:830-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 \u0060perf/memory/src/stack_report.rs:801\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/memory/src/stack_report.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"9190cf7edbd1d6351bce96c04856ada8b31b02deacb420acdcbab7f817390a05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:853-860 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:910-915 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:925-929 \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 \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:853\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d42d55f0cf60f5990cbdc2b0fd1baa3c7ac679e4bbe31aadfa21cda64b506a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): testing/differential-oracle/fuzzer/ivm.rs:1400-1407 | testing/differential-oracle/fuzzer/ivm.rs:1435-1442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4d5e1114fc4d3a49c221a111d12005225f3f510fa9c1ad9a0faafb7e5c6a86f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): perf/latency/sqlite_engine.rs:78-84 | perf/throughput/sqlite_engine.rs:60-66 \u2014 \u0060perf/latency/sqlite_engine.rs\u0060 and \u0060perf/throughput/sqlite_engine.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 65 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060perf/throughput/sqlite_engine.rs:70\u0060 calls \u0060fetch_add\u0060 and \u0060perf/latency/sqlite_engine.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":"perf/latency/sqlite_engine.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4796de93defb78f1146860ea22d9eac68593becbe5c6cdff1eaa7c6219de7cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:590-596 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:1279-1285 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b69cf8fae6b3c91581272b056288cf7ee814f54753e4a952ad8fd1fbb54af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:789-793 | testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:813-818 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/differential-oracle/fuzzer/custom_types_fuzzer.rs:789\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"de180fc735ba9af5234bb34084b8c556affcfaa3677b4a8665669735ce944448"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): testing/differential-oracle/fuzzer/ivm.rs:717-723 | testing/differential-oracle/fuzzer/ivm.rs:1311-1317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/ivm.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ce0a633686b6859efb392f4ec9ab4b173a374958186f4f94ce3940474960f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 3): perf/connection/gen-database.py:9-43 | perf/connection/limbo/gen-database.py:9-43 | perf/connection/rusqlite/gen-database.py:9-43 \u2014 before extracting anything, compare \u0060perf/connection/gen-database.py\u0060 and \u0060perf/connection/limbo/gen-database.py\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 \u0060perf/connection/gen-database.py: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":"perf/connection/gen-database.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb82d87cf09e235cba7f6ddd48218da60aad490f079eb2eaca7d32896a7d2217"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40 lines \u00D7 3): perf/connection/limbo/plot.py:11-50 | perf/connection/plot.py:11-50 | perf/connection/rusqlite/plot.py:11-50 \u2014 before extracting anything, compare \u0060perf/connection/limbo/plot.py\u0060 and \u0060perf/connection/plot.py\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":"perf/connection/limbo/plot.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8176d42de0360b7656c22acb682d8e482f2a1f7e8a4085a3876ca265aa9a68a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): perf/latency/plot/plot-latency-ecdf.py:64-74 | perf/throughput/plot/plot-throughput.py: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/latency/plot/plot-latency-ecdf.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0240ff25c91b30af541b495da857b7b07c151d1333c1ae6135ab580849dae90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201310 lines \u00D7 3): perf/latency/plot/plot-latency-ecdf.py:66-75 | perf/tatp/plot/plot-mqth.py:46-52 | perf/throughput/plot/plot-throughput.py:52-59 \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 \u0060perf/latency/plot/plot-latency-ecdf.py: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":"perf/latency/plot/plot-latency-ecdf.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"87362bfd31e7e6f56e4f249c98b41b446be98644510e0c1727b2f5d6e713c571"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): perf/tatp/plot/plot-mqth.py:57-66 | perf/throughput/plot/plot-throughput.py:64-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":"perf/tatp/plot/plot-mqth.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a700ecf09ccfdf4f12fbbe5ed9dc2e583ca890616daac3d62de6061e29aa088"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): testing/cli_tests/update.py:33-42 | testing/cli_tests/update.py:76-86 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060testing/cli_tests/update.py: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. 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":"testing/cli_tests/update.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c262f8ca5056122df22aa3827f978b167ba10891867be4bc0617be53dbd2b210"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): perf/tatp/plot/plot-mqth.py:47-54 | perf/tatp/plot/plot-response-times.py:53-61 | perf/throughput/plot/plot-throughput.py:54-61 \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":"perf/tatp/plot/plot-mqth.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b756983c340e10736a8f7bf23ca32ec7a4655136bcacf6ae5835a484c482564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): perf/tatp/plot/plot-response-times.py:45-51 | perf/throughput/plot/plot-throughput.py:48-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":"perf/tatp/plot/plot-response-times.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96be8a99bd0f3aeed3bb7dcaaeee01d32d90de2e485591dfe8cafa34e079201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): perf/tatp/plot/plot-mqth.py:45-49 | perf/tpc-h/plot/plot-tpch.py:59-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060perf/tpc-h/plot/plot-tpch.py:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/tatp/plot/plot-mqth.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2fb5b65ce10e63e0915d18cbc7c18d460beb9b5b4eb8e5fbbc11096a0d7f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): testing/cli_tests/collate.py:115-120 | testing/cli_tests/update.py:99-104 | testing/cli_tests/write.py:138-143 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"testing/cli_tests/collate.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda59590692a3f2c981656041010666f0bdf3cd9f4aca1da1b4d3e9fdcd4f125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): testing/cli_tests/sqlite_bench.py:92-96 | testing/cli_tests/vfs_bench.py:63-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/cli_tests/sqlite_bench.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9f7604d40d61062df52983604cb0dc5b4ccf3793e7bc4137df4b29133ffd57"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: query-result-oracle: query-result-oracle: 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":"63eae9c1e43c1deeb3c281df99d3fb770674bed3d95dc7a11bcff95fe4266425"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: turso_pg_client: turso_pg_client: 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":"14fad1701c5e43634fca9cb61bb23a8a042be922a255ef564e4af9e3dc3288df"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: turso_parser: turso_parser: abstractness 0.06, instability 0.08, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 12 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"781fa377df107861508ba7a4c99f975c90b678ee6afab5369eb84070133a5d59"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: turso_sqlite: turso_sqlite: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a56c17bf00e2672e757d8742a761f8ca024ce9b1bfdbf9b0025a2a7ed41c736f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: @tursodatabase/serverless: @tursodatabase/serverless: abstractness 0.21, instability 0.00, distance 0.79 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"43ccc59b662e67f405cbecab729b9ad50f8de62a9576069db17194df2e50040d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: turso_core: turso_core: abstractness 0.09, instability 0.14, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 19 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8eaf6e42193c4ab8fc3b47efa08df504095d09ef6b3bc5cf78118e1cd028fb99"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Policy (LCOM4 16): Policy\u0027s methods fall into 16 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 16 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":"testing/differential-oracle/sql_gen/src/policy.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8d62be677944e00bf84155987d1466ee52a06297b4ec63f0d11199b4b22f98"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Connection (LCOM4 6): Connection\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"306eb9b4e70c840e262667837be5b8e95f9c9ac3428d58f54e2b5d68917a317c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProgramBuilder (LCOM4 6): ProgramBuilder\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":"core/vdbe/builder.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae0db25e4898bbdd14948f4122aca88e36be0e3de8913f36532f0bf3fd4dead"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FunctionDef (LCOM4 6): FunctionDef\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":"testing/differential-oracle/sql_gen/src/functions.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6dfecd8587d1815ec25d5546704b31f3339f522e5b572f6729f6c31d8bdb7b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FunctionDef (LCOM4 5): FunctionDef\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":"testing/differential-oracle/sql_gen_prop/function.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2768bb9a38f54a1b5e274cfcc9e06344220f6dfa1470645152f2a8c95746515"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ProcessLocalOwnershipState (LCOM4 4): ProcessLocalOwnershipState\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":"core/storage/shared_wal_coordination.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5841414f7f399c6f301802afc2edd2a83cd46c8b74b69247e119a42a33952a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DatabaseReplayGenerator (LCOM4 4): DatabaseReplayGenerator\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":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eda6932e2aa78a9cf4bfcd1f134a54a52da3b37a88f6252f9b44129536b6f85"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Context (LCOM4 4): Context\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":"testing/differential-oracle/sql_gen/src/context.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5995d4de18dd9bd94f1a5b2881a5e562bbb09c34e3d475dfb612528bb77d78d"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: TestCommitTransaction: Skipped \u2014 https://github.com/tursodatabase/turso/pull/3591"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Tests/TursoTests.cs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9568ccbffca5862dd4a0dda4128d8ad7d49e158dd3492fb1e36cc0a81cf6377"}},{"ruleId":"D10","level":"warning","message":{"text":"No assertions: ReplicaFacadePropagatesItsEffectivePoolingDefault: 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":"bindings/dotnet/src/Turso.Tests/SqliteManagedExecutionTests.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e722f2408e2f0e09d381e56da4083e8ef76e812bbeb9e67ec5e6598d778b70"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/vdbe/execute.rs: core/vdbe/execute.rs changed 259 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 173 in turso_core::vdbe::execute::op_function at line 10010. 7 of those changes were fix/bug commits, and the other 252 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/vdbe/execute.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/execute.rs"},"region":{"startLine":10010}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd22984729c87de01b3f8d0872c17dafd255ec41d94e08e838fbcccb64fbb2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: postgres/parser/translator.rs: postgres/parser/translator.rs changed 251 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in PostgreSQLTranslator::translate_expr at line 3298. 7 of those changes were fix/bug commits, and the other 244 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- postgres/parser/translator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/translator.rs"},"region":{"startLine":3298}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69c720ec364e41abef2925c3175940839280f68f7bce611103c4263f1f38570"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/alter.rs: core/translate/alter.rs changed 95 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 165 in turso_core::translate::alter::translate_alter_table at line 822. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/alter.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/alter.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb66e3ede4c282d4b79175eb3ba7723f856b97a14ba3081ab224c1bf8d0445a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/expr/translator.rs: core/translate/expr/translator.rs changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in turso_core::translate::expr::translator::translate_function_call_expr at line 1047. 2 of those changes were fix/bug commits, and the other 86 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/expr/translator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/translator.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d958f9320024067ec60238949558e072354d87d57b2979ee61ac8a9fec83b7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/schema.rs: core/schema.rs changed 150 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in turso_core::schema::create_table at line 7144. 2 of those changes were fix/bug commits, and the other 148 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/schema.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":7144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9656b4f0098c5c9f73a07ba5309bde637b4dc329fbd18bf133ef76deafc55f19"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/vdbe/explain.rs: core/vdbe/explain.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 264 in turso_core::vdbe::explain::insn_to_row at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/vdbe/explain.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/explain.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a6044d6c6dbb99b9a1a926d59870879ff6af45fc182ebb3f020c23c06584f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/vdbe/mod.rs: core/vdbe/mod.rs changed 97 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 85 in Program::abort at line 3546. 2 of those changes were fix/bug commits, and the other 95 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/vdbe/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":"core/vdbe/mod.rs"},"region":{"startLine":3546}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd10bf91888fc871815a18d7b213f45ace4a89bf3325bf8b97572798c482fcc5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/mvcc/database/mod.rs: core/mvcc/database/mod.rs changed 99 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in CommitStateMachine::step at line 3084. 5 of those changes were fix/bug commits, and the other 94 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/mvcc/database/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":"core/mvcc/database/mod.rs"},"region":{"startLine":3084}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba09b7a3fbbec71b2f9c16be6b6e79b4336466b5fa43f0e777324265fc6a3c5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/emitter/update.rs: core/translate/emitter/update.rs changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 129 in turso_core::translate::emitter::update::emit_update_insns at line 1088. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/emitter/update.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/update.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dce69cd2f8dae32d148f8e01ae4f2aeb9fd67e084c42ea2535791a6d7c64a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/storage/btree.rs: core/storage/btree.rs changed 87 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in BTreeCursor::balance_non_root at line 3604. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/storage/btree.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/btree.rs"},"region":{"startLine":3604}}}],"partialFingerprints":{"codehealthFindingId/v1":"27da66398a575a8e10b714e5a2778ccda0917c23bbe7e18ac5c667a682b8d938"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/insert.rs: core/translate/insert.rs changed 85 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in turso_core::translate::insert::translate_insert at line 252. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/insert.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/insert.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33eefe97e51bacce10197af2692d0216f39507744f9e714a40eebffa7b283c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/pragma.rs: core/translate/pragma.rs changed 44 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 132 in turso_core::translate::pragma::query_pragma at line 887. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/pragma.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/pragma.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09712665d653e238284a86d9a77e9a08a6312c4b1c510901b0cd480a8f4d0dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/dialect/engine.rs: core/dialect/engine.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 231 in turso_core::dialect::engine::resolve_builtin_function_name at line 248. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/dialect/engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/dialect/engine.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e129bc2bf85cc861af99e17ef7390ba0e9e72bb952aa3f0f5ee302ec76d20253"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/schema.rs: core/translate/schema.rs changed 91 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in turso_core::translate::schema::resolve_check_expr_type at line 246. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/schema.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/schema.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9432eec64080dd98a735ece8222a007a5876638a57b5ce3104df91a4456cfc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/optimizer/mod.rs: core/translate/optimizer/mod.rs changed 73 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in turso_core::translate::optimizer::apply_table_access_plan at line 3129. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/optimizer/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":"core/translate/optimizer/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbce06fb817a8705ea7d99f2593f7bd80cdc113ccf0aed2e3d4fa7b020ff52bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/mvcc/database/checkpoint_state_machine.rs: core/mvcc/database/checkpoint_state_machine.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in CheckpointStateMachine::step_inner at line 2477. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/mvcc/database/checkpoint_state_machine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/database/checkpoint_state_machine.rs"},"region":{"startLine":2477}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b051153786a5fd549e88c5da0078804d3527f049f28f296ee753247c41bcda"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/upsert.rs: core/translate/upsert.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in turso_core::translate::upsert::emit_upsert at line 480. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/upsert.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/upsert.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9735bc1a625a4ed023ee5c684251e4e50f12390501a7408e749d36192b960b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlite/parser/src/ast/fmt.rs: sqlite/parser/src/ast/fmt.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 124 in Stmt::to_tokens at line 248. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- sqlite/parser/src/ast/fmt.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f435757b35a57b330d77b7b3481ece67be12d17545da94925b1015bf6f337486"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/mod.rs: core/translate/mod.rs changed 47 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in turso_core::translate::translate_statement at line 227. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/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":"core/translate/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbf9e58d55b2eb1bc4084d2b7bf028e38e74818b1d9af20c9ecd1b7df524775"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/database.rs: core/database.rs changed 66 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in Database::header_validation at line 2064. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/database.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/database.rs"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"317024b180f0843000d784a72019ae084a65a0eb8b210879aca09d84ede6bbee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/connection.rs: core/connection.rs changed 112 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Connection::drive_reparse_building at line 1613. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/connection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":1613}}}],"partialFingerprints":{"codehealthFindingId/v1":"9581c1fe2d80d0e8d4e23881fed8d0a62544a1535444f2f7c6f7a880968d9094"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/select.rs: core/translate/select.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in turso_core::translate::select::prepare_one_select_plan at line 301. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/select.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/select.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84bdba7b0f706f634b8b955f1b53922fbb8437c72a8fb61957894c1b58264af"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/storage/pager.rs: core/storage/pager.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in Pager::commit_wal_inner at line 4545. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/storage/pager.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/pager.rs"},"region":{"startLine":4545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97c2bf817e1d209d9271c5aca0b032bbf8a274bfc8ecf98bd21db4c59df495c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/json/jsonb.rs: core/json/jsonb.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 64 in Jsonb::navigate_to_segment at line 2731. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/json/jsonb.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/json/jsonb.rs"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22629ed2e73f05d1f3095ef372db0a417a1be6962cb5e39c29adf1f12096639"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: postgres/frontend/catalog.rs: postgres/frontend/catalog.rs changed 115 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in turso_pg::catalog::pg_get_constraintdef at line 3883. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- postgres/frontend/catalog.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/catalog.rs"},"region":{"startLine":3883}}}],"partialFingerprints":{"codehealthFindingId/v1":"444998e7e3d3bf1d26ade6ce358eeb1dcd4b84cbf72e00e44706641becde5455"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/subquery.rs: core/translate/subquery.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in turso_core::translate::subquery::get_subquery_parser at line 754. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/subquery.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/subquery.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3495202537f7fe5b868816739f0038a0f2c5b80e18d423e3c0943123fb9e871"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/optimizer/join.rs: core/translate/optimizer/join.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in turso_core::translate::optimizer::join::join_lhs_and_rhs at line 489. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/optimizer/join.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/join.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4fd708b1850e5dee205e5e7146b9c0ec83cd13b507949875bf41e9f69f4b53"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/optimizer/constraints.rs: core/translate/optimizer/constraints.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in turso_core::translate::optimizer::constraints::constraints_from_where_clause at line 729. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/optimizer/constraints.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/constraints.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb8b44f16b055e64936c672c8df774863ad466eb91209e175e145d95fa0d071"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: postgres/frontend/functions.rs: postgres/frontend/functions.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in turso_pg::functions::format_type at line 1190. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- postgres/frontend/functions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/functions.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f7133326092b331e67f80719079efe3dae1085ea391ae5788901f0d1d835eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: postgres/frontend/session.rs: postgres/frontend/session.rs changed 93 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in DeferredExecution::cleanup_nonblock at line 1003. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- postgres/frontend/session.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/frontend/session.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af33ce13c0deb765016713de6e2b8692bec2e0ab4d5479f87caab6099f46cbf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/planner.rs: core/translate/planner.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in turso_core::translate::planner::parse_table at line 2002. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/planner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/planner.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"4be9be6a6fe63b256a4a2691802da21f3ffb542cc35b16c935b3bb63d89fbde2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/vdbe/vacuum.rs: core/vdbe/vacuum.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in turso_core::vdbe::vacuum::vacuum_target_build_step at line 599. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/vdbe/vacuum.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/vacuum.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa34574d150c2c390c29683981c91e8ecfab8236711a32f1c01e52b3faa95d3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/expr/expr_type.rs: core/translate/expr/expr_type.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in turso_core::translate::expr::expr_type::type_of at line 295. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/expr/expr_type.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/expr_type.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23316a9dfa37aee728ec63e541577427a91209d01cea21c8925a69475f74ac6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/main_loop/init.rs: core/translate/main_loop/init.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in InitLoop::emit at line 28. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/main_loop/init.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/init.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f8cc2b926edf5c90431cdb5a5fb3bbf0cf9c9407bc503495faea1389c14c81"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/roles.rs: core/translate/roles.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in turso_core::translate::roles::check_statement_privileges at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/roles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/roles.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad37f8565ec151aebeff56b3e15c4336c7dbb6d23387f553091a1beb5f5eaa76"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/index.rs: core/translate/index.rs changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in turso_core::translate::index::translate_create_index at line 104. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/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":"core/translate/index.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7e55ee440b04a457aa7720e4113f494f41319c276b8321f2ac48aba6a2c41b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/statement.rs: core/statement.rs changed 63 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Statement::finish_step at line 610. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/statement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/statement.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de7384b4de5ecb41b0f76176d388982e255223c05b61715953642a2ff96f488"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/plan.rs: core/translate/plan.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in turso_core::translate::plan::expand_star at line 1107. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/plan.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/plan.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"f643b53d06e75ea8423a70d51c3132aff3200bfa311ad1a350404c9f54b853cc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/expr/condition.rs: core/translate/expr/condition.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in turso_core::translate::expr::condition::translate_leaf_condition_expr at line 372. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/expr/condition.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/condition.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c9fc7a36828dfce8dd347858e5f77e06e2507fe99585b002668e0382b2c9c59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/storage/wal.rs: core/storage/wal.rs changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in WalFile::checkpoint_inner at line 5001. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/storage/wal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/storage/wal.rs"},"region":{"startLine":5001}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8be72e8c8d70cf8b92cf31578dc47bc57c30d9f2fb251111821e9a4023c2ac8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: postgres/frontend/error.rs: postgres/frontend/error.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in turso_pg::error::parse_error_sqlstate at line 299. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- postgres/frontend/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":"postgres/frontend/error.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cc3e8ec04befbc2b607d31e51bd23a3bc7b03bbc6647e33ebfffc024bac6da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: postgres/frontend/classes.rs: postgres/frontend/classes.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in turso_pg::classes::translate_catalog_changes at line 615. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- postgres/frontend/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":"postgres/frontend/classes.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d25e8d3a1fc562136cc548b9bd20315d37c036ebdc907a18362c070b7641134"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/expr/binary.rs: core/translate/expr/binary.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in turso_core::translate::expr::binary::emit_binary_condition_insn at line 825. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/expr/binary.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/binary.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a59fbf9d232697fbf454f60874dd024fc79011243f87c6d54d49497d36f912"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/util.rs: core/util.rs changed 57 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in turso_core::util::visit_stmt at line 1765. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/util.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/util.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"2921e9dc856200ca39ee0fdeb3a5e11c7bcb6946ca666fbccfa37cf3a89d6872"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/window.rs: core/translate/window.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in EmitWindow::emit_window_step at line 1403. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/window.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/window.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb6e5f77e6cbef423305af975ad44c3e9a3bb1f7eb4ad3c3d4592db3447a563"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/fkeys.rs: core/translate/fkeys.rs changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in turso_core::translate::fkeys::emit_fk_child_update_counters at line 1150. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/fkeys.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/fkeys.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"353beb305e2cd3dcaa58abfd40aea168d17c22880686faa30cd64f2e5d25ce97"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sync/engine/src/database_sync_engine.rs: sync/engine/src/database_sync_engine.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 83 in DatabaseSyncEngine::apply_changes_internal at line 2170. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- sync/engine/src/database_sync_engine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_sync_engine.rs"},"region":{"startLine":2170}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbcb0e664d8ebffb9b5ddd5255b3517e602ac49938b08084280cc8093d7d6f4c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sqlite/parser/src/parser.rs: sqlite/parser/src/parser.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Parser::parse_create_type at line 4917. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- sqlite/parser/src/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/parser.rs"},"region":{"startLine":4917}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a9e4f8c3aa89a2df0d7f2b83e3cd13167211a8bac10fbb55260778e3db002c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/optimizer/access_method.rs: core/translate/optimizer/access_method.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in turso_core::translate::optimizer::access_method::choose_best_btree_candidate at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/optimizer/access_method.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/access_method.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"078e8d8ced021fe49643a3e25a0917273f1344e5656a678ffaa1aeb25d4884b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/collate.rs: core/translate/collate.rs changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in turso_core::translate::collate::for_each_operand at line 1002. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/collate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/collate.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f7afb1a75db9d9bd878ad4e1b22ee2f91350d5a528565d8c91879db692484"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bindings/c/src/lib.rs: bindings/c/src/lib.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in turso_sqlite3::sqlite3_open_v2 at line 670. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- bindings/c/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":"bindings/c/src/lib.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cca680e9cfb2d96e9ff4ee20ffa7042783dd0af1eee333e6d60605fce5ce2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/integrity_check.rs: core/translate/integrity_check.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in turso_core::translate::integrity_check::translate_integrity_check_for_schema at line 180. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/integrity_check.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/integrity_check.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"1776429f54b430e1080e2886feb9b4a1868471501619cba531419aec143b82e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/mvcc/cursor.rs: core/mvcc/cursor.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MvccLazyCursor::seek at line 1673. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/mvcc/cursor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/mvcc/cursor.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baccfae34e73fc34a63ac6ce654dc71f4774519287116b85fa5284e9333509d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/functions/datetime.rs: core/functions/datetime.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in turso_core::functions::datetime::exec_strftime at line 1274. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/functions/datetime.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/datetime.rs"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fd18321b4c4bc1a65208d20c17f064818d1e084a11ca6d4e7fdd64bd7457d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/simulator/generation/property.rs: testing/simulator/generation/property.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in Property::interactions at line 294. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/simulator/generation/property.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/generation/property.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4500b5afd01dead06280b715ead88d155ab8cf4bcc0ee508128baacd41540f2f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/vdbe/value.rs: core/vdbe/value.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Value::exec_substring at line 475. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/vdbe/value.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/value.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffca8a304233204388bd8c5a1405e5c4b338b3f26a8d64989f85df553d3c780"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/emitter/select.rs: core/translate/emitter/select.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in turso_core::translate::emitter::select::build_materialized_build_input_plan at line 860. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/emitter/select.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/select.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faa580ba02b71a9b2cb2fa7776ff3f7bd50bd71f77ed108c3cbff19c4ad735a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/main_loop/close.rs: core/translate/main_loop/close.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in CloseLoop::emit at line 14. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/main_loop/close.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/close.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b956dcbd9b45b0975935a1acfbbb7ecc6554305136f49a7789ebbddc44e8891f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/json/mod.rs: core/json/mod.rs changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in turso_core::json::json_string_to_db_type at line 626. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/json/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":"core/json/mod.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8832be92ec090ad98dee2a35f1e203bcc8032cade20668670e16594337bbea"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/optimizer/unnest.rs: core/translate/optimizer/unnest.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in turso_core::translate::optimizer::unnest::try_rewrite_single_value_aggregate at line 488. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/optimizer/unnest.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/unnest.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"f970af1b0b70c2ce6c7afd67d72babac6b4ec5332bf27c271bbed01ccd529363"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/view.rs: core/translate/view.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in turso_core::translate::view::translate_drop_view 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/view.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a382bfd68e2ac9a35450e08fba14c2cb6e9d16883251ab972985035e0449ab9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/main_loop/hash.rs: core/translate/main_loop/hash.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in PreparedHashBuild::emit at line 229. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/main_loop/hash.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/hash.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c4b21925a480d5cdb1938017145fdf1a00976543bf9acdc063e19563ca024a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/stress/main.rs: testing/stress/main.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in turso_stress::async_main at line 609. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/stress/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":"testing/stress/main.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"199fbd8ef42e8728f72718d915eaccb0401894c373fb07335c721dceff6aa9ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: fuzz/fuzz_targets/scalar_func.rs: fuzz/fuzz_targets/scalar_func.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in limbo_fuzz::fuzz_targets::scalar_func::execute_scalar_func at line 234. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- fuzz/fuzz_targets/scalar_func.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fuzz/fuzz_targets/scalar_func.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dcfd376a7f3bd847110f3c1ba67eca3a8dafec8fb6c7c013d54916b124d62a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/aggregation.rs: core/translate/aggregation.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in turso_core::translate::aggregation::translate_aggregation_step at line 521. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/aggregation.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/aggregation.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b41edaef5d99897f6bd8cd22afee0e84a9650d72ff0853185edf3f85925163"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/trigger_exec.rs: core/translate/trigger_exec.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in turso_core::translate::trigger_exec::execute_trigger_commands at line 506. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/trigger_exec.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/trigger_exec.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"05018956928c1f11e1e2b2a872ca3c02c7a79093800c030697d937ee9cd83a8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/main_loop/body.rs: core/translate/main_loop/body.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in turso_core::translate::main_loop::body::emit_loop_source at line 131. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/main_loop/body.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/body.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0515a5bb837aa696a94aa9bf9338b88dbbe5a4df946614a208e8ed96da6b032d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/expr/walk.rs: core/translate/expr/walk.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in turso_core::translate::expr::walk::walk_expr at line 10. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/expr/walk.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/expr/walk.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23c157482cdf8b37bf3c0d14174fa50e1c37a684d1de44214be46f4bf584120"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/concurrent-simulator/lib.rs: testing/concurrent-simulator/lib.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in Whopper::perform_work at line 1013. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/concurrent-simulator/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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1013}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd200e9a8030ac3e1500f76533a3b833f292214bc94b52ab598eb533b4d7fc3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/main_loop/seek.rs: core/translate/main_loop/seek.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in SeekEmitter::emit_start_bound at line 229. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/main_loop/seek.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/seek.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"026af87e211987198b468f508c8a9d08f4b0c525aed973c39573efbb56d97d94"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/differential-oracle/sql_gen/src/generate/select.rs: testing/differential-oracle/sql_gen/src/generate/select.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in sql_gen::generate::select::generate_select_impl_inner at line 245. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/differential-oracle/sql_gen/src/generate/select.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/generate/select.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac99a17558eac98413d7b92ca510a1668201fcb3af8682c3f00947b6f12e5f7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/optimizer/order.rs: core/translate/optimizer/order.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in turso_core::translate::optimizer::order::index_columns_order_consumed at line 984. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/optimizer/order.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/order.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6622131c084df8057b94e2d03bfdf93ca3dc2f9a5b3a5b020aa23240b62e02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/eqp.rs: core/translate/eqp.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in EqpDetail::fmt at line 312. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/eqp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/eqp.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d837bc7a7d8e634c663af14a2af08e3e7555e600b8f13d5aeccc9db01e7435"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/trigger.rs: core/translate/trigger.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in turso_core::translate::trigger::translate_create_trigger at line 92. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/trigger.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/trigger.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"272623c42a2dd3f6b49285784a473877544055e21b74098622f820adf6046f06"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/group_by.rs: core/translate/group_by.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in turso_core::translate::group_by::group_by_process_single_group at line 652. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/group_by.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/group_by.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"a264a2b1ac97688cd6c9da6748977eb041c19789281a643e963fe4b8873b5156"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/incremental/vdbe_maintenance/aggregate.rs: core/incremental/vdbe_maintenance/aggregate.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in turso_core::incremental::vdbe_maintenance::aggregate::emit_group_aggregate_rows at line 106. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/incremental/vdbe_maintenance/aggregate.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/aggregate.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5a0401112acf6f2c069a5967f34bf07dde1a784df028aa780b9fa13a63ad8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/compound_select.rs: core/translate/compound_select.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in turso_core::translate::compound_select::emit_program_for_compound_select at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/compound_select.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/compound_select.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a2b9df9e809d1c21cade7515f3297be4e65c3d2d86b9ffbbf666c7f3c7a8bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/emitter/delete.rs: core/translate/emitter/delete.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in turso_core::translate::emitter::delete::emit_delete_insns at line 489. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/emitter/delete.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/emitter/delete.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6758af49127260ef32cbd5d5c0eba500c7ce3b95b8aa3d642633646fb57364"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/incremental/view.rs: core/incremental/view.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in IncrementalView::referenced_tables at line 754. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/incremental/view.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/view.rs"},"region":{"startLine":754}}}],"partialFingerprints":{"codehealthFindingId/v1":"782784d990a6735e09bef782c7e245497cc6e8065c61f0853b18eaf0958f0fb6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/attach.rs: core/attach.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Connection::attach_database_with_config at line 424. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/attach.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/attach.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"109204b1a4591556193e2c979cd2b0adf2bdd82407ac03f5ddf3da6447ca0855"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/concurrent-simulator/allocation_fault.rs: testing/concurrent-simulator/allocation_fault.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in turso_whopper::allocation_fault::allocation_site_id at line 201. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/concurrent-simulator/allocation_fault.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/allocation_fault.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f192201a25f043a1b945540ba12270cd855098a3447bb58decbbb07665e873"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/differential-oracle/fuzzer/runner.rs: testing/differential-oracle/fuzzer/runner.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in Fuzzer::run_inner at line 611. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/differential-oracle/fuzzer/runner.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/fuzzer/runner.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d7c65b3e736c83723528a8982d130ddb037c935b90f64e514911fcb849a686"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/sqltest/src/parser/mod.rs: testing/sqltest/src/parser/mod.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in Parser::parse_test_or_snapshot at line 301. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/sqltest/src/parser/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":"testing/sqltest/src/parser/mod.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e834f62a9f4c07d6814f26e859f0e7089c4ae41e259c65722d26a23dff60385"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/expr/vectors.rs: core/translate/expr/vectors.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in turso_core::translate::expr::vectors::expr_vector_size at line 4. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/expr/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":"core/translate/expr/vectors.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"b771b6df2591e6c322e4bab9b6dd6991464ab7c48b7ee97f39a491b98b43bb73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/vdbe/hash_table.rs: core/vdbe/hash_table.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in HashTable::spill_multiple_partitions at line 1685. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/vdbe/hash_table.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/vdbe/hash_table.rs"},"region":{"startLine":1685}}}],"partialFingerprints":{"codehealthFindingId/v1":"943c5f215aaaff32f9cb7553645c58ea233df71eb85406b9a9a45099f10e4e59"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: bindings/javascript/packages/common/promise.ts: bindings/javascript/packages/common/promise.ts changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in promise.executeBatch at line 734. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- bindings/javascript/packages/common/promise.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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"697d3c00bfe5b3e723016b498951c7fffad9c40c4e3ab83c17d8b24b8db2a63a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/concurrent-simulator/main.rs: testing/concurrent-simulator/main.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in turso_whopper::run_inprocess at line 370. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/concurrent-simulator/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":"testing/concurrent-simulator/main.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde0328acfa8af6fb18a133f4c173dc0729ad5926aa3c7b196ace0dab11ede74"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/incremental/vdbe_maintenance/join.rs: core/incremental/vdbe_maintenance/join.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in turso_core::incremental::vdbe_maintenance::join::emit_semi_or_anti_join at line 733. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/incremental/vdbe_maintenance/join.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/join.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ea04506ba91d763dea51c743ff707e6f782617ccfa8c099f3c2072d35f3495"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/main_loop/open.rs: core/translate/main_loop/open.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in OpenLoop::emit at line 55. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/main_loop/open.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/main_loop/open.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1a77c5cd1f74c2ea14133a8e646dd0a875e2bda426d47c64a6f1f1a21d135b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/simulator/runner/env.rs: testing/simulator/runner/env.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SimulatorEnv::new at line 1807. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/simulator/runner/env.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/runner/env.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d351f641420aa4c5f94e53f8a0d209755d8366a73a0e81e2514389b6ce0aee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/differential-oracle/sql_gen/src/ast.rs: testing/differential-oracle/sql_gen/src/ast.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in SelectStmt::fmt at line 808. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/differential-oracle/sql_gen/src/ast.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/differential-oracle/sql_gen/src/ast.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"6528faecfc0acbfbe151a763a5cadd3ec14f4278fcef9785f44c745f6b0cc7b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/sqltest/src/runner/mod.rs: testing/sqltest/src/runner/mod.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in sqltest::runner::run_single at line 480. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/sqltest/src/runner/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":"testing/sqltest/src/runner/mod.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4436e50c1699d36a42040e7caedbf3e44c6700e7af16e0317b32634004403b37"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/sqltest/src/main.rs: testing/sqltest/src/main.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in sqltest::run_tests at line 234. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/sqltest/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":"testing/sqltest/src/main.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d05bc0364552b4d9596135961ee3b4bce94058bb7b0942767b82fa096e110b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: sync/engine/src/database_replay_generator.rs: sync/engine/src/database_replay_generator.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in DatabaseReplayGenerator::execute_ddl_idempotent at line 736. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- sync/engine/src/database_replay_generator.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sync/engine/src/database_replay_generator.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbe7290400bab948b48ad311836a5916e31a303f5f4cd2c07153c230e359473"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: serverless/javascript/src/session.ts: serverless/javascript/src/session.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in Session.batch at line 501. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- serverless/javascript/src/session.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":"serverless/javascript/src/session.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc4095417db94434ab7a5cefbd9a763d90132c63519fb865c97a2967bbdcd8d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/translate/display.rs: core/translate/display.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in SelectPlan::fmt at line 109. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/translate/display.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/display.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c28ef7f9161ac8654bb6de1e97e0600059d045576c3b6976c9343aecbf6578ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/functions/string.rs: core/functions/string.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in turso_core::functions::string::pad at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/functions/string.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/functions/string.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"48072a9ba83f46f105793c0be7061bc37338bdb47971e80eec57f2c5a593fa27"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: testing/concurrent-simulator/worker.rs: testing/concurrent-simulator/worker.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in turso_whopper::worker::run_worker at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- testing/concurrent-simulator/worker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/concurrent-simulator/worker.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5427ca1dcab79e18b56dc64e6b30342ea663a87db11454ffd9c2bf4f3e7b49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/incremental/vdbe_maintenance/set_op.rs: core/incremental/vdbe_maintenance/set_op.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in turso_core::incremental::vdbe_maintenance::set_op::emit_deduplicating_set_op at line 310. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/incremental/vdbe_maintenance/set_op.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/set_op.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"34adbb2cc3e84c5b0c37354a6e8dcb3d1c2ffd8770556e892891bfde514db20c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: core/incremental/vdbe_maintenance/arrangement.rs: core/incremental/vdbe_maintenance/arrangement.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in turso_core::incremental::vdbe_maintenance::arrangement::emit_output_arrangement at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- core/incremental/vdbe_maintenance/arrangement.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/incremental/vdbe_maintenance/arrangement.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa7eb6b8672f82c74f303ae785cac061d89dfa53dc922aef4ccbc4c26c8cfc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: serverless/javascript/src/protocol.ts: serverless/javascript/src/protocol.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in protocol.encodeValue at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- serverless/javascript/src/protocol.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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9ed7f8b5306e780c6c55003bf4064fa05d4576beeaf64d27f4c18f6d73a4cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: postgres/parser/copy.rs: postgres/parser/copy.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in turso_pg_parser::copy::try_extract_copy_to_stdout at line 20. 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 19:27:36 -03:00\u0027 --until=\u00272026-11-13 19:27:36 -03:00\u0027 --full-history --no-merges -- postgres/parser/copy.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"postgres/parser/copy.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"75434d65f6077440379ecae86a7bbfc9c182b3c06396fac083a3a953efe5b42f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 148 significant file(s) lose their only recent owner: testing/differential-oracle/fuzzer/custom_types_fuzzer.rs, testing/differential-oracle/sql_gen/src/generate/select.rs, testing/differential-oracle/sql_gen/src/ast.rs, postgres/parser/parser.rs, cli/opcodes_dictionary.rs, core/skiplist/base.rs, testing/differential-oracle/sql_gen/src/generate/stmt.rs, testing/differential-oracle/sql_gen/src/policy.rs (\u002B140 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4a8a361ce433d867a226303ac3065fe5f3be558983b16852c939c362494fa1f0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: sync/sdk-kit/src/turso_async_operation.rs, bindings/react-native/src/index.ts, bindings/react-native/src/internal/asyncOperation.ts, bindings/javascript/sync/src/generator.rs, bindings/react-native/android/src/main/java/com/turso/sync/reactnative/TursoModule.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"65f885fc26c8803c5a59f5c5c437eab384ffbf47c1049a21ab45c4973fe52f5c"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 4 significant file(s) lose their only recent owner: perf/fts/src/main.rs, perf/fts/plot/plot-fts.py, perf/fts/scripts/memory.py, perf/fts/src/profiling.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0d5e350b5e35d14b52f77c7ec00a5168c89d3ff7556caf1a0f94e091e22f12d2"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 3 significant file(s) lose their only recent owner: perf/encryption/src/main.rs, core/storage/page_transform.rs, testing/concurrent-simulator/yield_injection.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"457c685ab3c27432fa95bf034a488c91a6e4ec68dd503ff9ae70c2b19b0832b1"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 6 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (170 single-owned of 746 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; 746 of the 977 production source files in this repository met that bar). They are anonymized user #5 (4 file(s)), anonymized user #6 (1 file(s)), anonymized user #7 (1 file(s)), anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)), anonymized user #10 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs, bindings/dotnet/src/Turso.Data/TursoSyncDatabaseOptions.cs, bindings/dotnet/scripts/check_elf_dynsym_exports.py, bindings/dotnet/src/Turso.Data.Sqlite/SqliteDatabasePool.cs, core/io/windows_lock.rs, perf/checkpoint-bench/src/main.rs, extensions/fuzzy/src/lib.rs, bindings/java/gradle/publish.gradle.kts (\u002B1 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable CS8765 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnectionStringBuilder.cs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbeb543a1323ac975d7e88f8d1346784d77a4ae79d76c75e896187e445b87a5"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoAutomaticSyncCoordinator.cs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cde167ba0bb2c9f1d7080d85a4d2a4e4dbbd2023fe5279b14ea49d7f99daf16"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b629688f1eb0e0850145b76caaf29911306cf364f2f19372af96da329048df7"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoReplicaRegistry.cs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31b5dbba04b2a94e5356448b734c08d456d2184c0890cfd6200f4444989154b"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a7d286c51db517f511b6b568dc05ec62976d937e53eee8c2eb07ddd36536a6"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9895e5fb69c4cd866994a23b2d212f8e6bb629dc0025c5c791dfd1fbd584d8"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6d6274de23e39b2e27eb5d62847942316c3549cf313419be5e6674a11e7e13"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"662282d44a9b20416c728ea52d212527df6d7ef0654950aec1c2f37e9039dde3"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e5ff98fa948a7d6b0d2000792130f80c4d9b8e10691e96315bdb0c6ebeac65"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2515f675902dd29a730e94834994fc8ce3c1a118f1d8de89a09b52805771c6"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Raw/Public/TursoPageCodec.cs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f694fd508a2e5614a516568e6b69876abb5718f36defc112935bb76a30ee8317"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Serverless.Client/HranaHttp.cs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e1fbe59a5e6af6f9e2814864ab3b565bab8fe706d031d55f7990c4829e2f3e"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Serverless.Client/TursoServerlessConnection.cs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde633cfaa3f65f154b4a501a2da93e90efd376ae0a9023ae445383c615783d"}},{"ruleId":"D17","level":"error","message":{"text":"EmptyCatchBlock: empty catch block \u2014 the error is discarded with nothing recorded, so a failure here leaves no trace anywhere. Record it through whatever this codebase already uses to report problems, or let it propagate. Where swallowing one specific failure really is correct \u2014 as it often is on a teardown/dispose path where throwing would mask the original failure \u2014 catch exactly that exception type and write down WHY in a comment on the catch. Both are needed: a comment on a catch-all still swallows every failure nobody anticipated, and a note that only restates the swallow (\u0022ignored\u0022, \u0022do nothing\u0022) is read as no explanation at all."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Serverless.Client/TursoSession.cs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f363c4f7c242d246cca8ba90280de0509457c61aea5e34b00f7c2f7a8a7af57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Refactor this out \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cfd62d50c4de84caf027a5e432e78c89b9dea8c867c794a509e875764807deb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: nullable? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f975c907b87cbbb7b0f4b4d4d7f8d453f95883b0bff2fc77a25449b5b24960"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: currently the only way to project multiple values from a SelectExpression is to simulate a Select out to an anonymous \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":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f66602ceda4006b3479a10109e98ae8a186c52602b9cc80983953d1fcefd46"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable EF1001 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b460e09a38314e71514dcd1734f525e87bcad7bdc6d1820cd78da37638ca87d"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable EF1001 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0b5b66ba290e7bd58676a33052e0ef31850346253dac7c27edd89a41b21fe2"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable EF1001 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"942484a994bd9e38ca99710abc98a81be13a4bada38fa84ef67db464a31ee6e3"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable EF1001 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Tests/TursoEfRemoteReplicaTests.cs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"302abc428de64bb4d3db24e747c9d242cb53f584171ba50341068fd572148354"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable EF1001 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Tests/TursoEfRemoteReplicaTests.cs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"854b4abc37730739432b66e0bcb4edcbc8808cb08b318c5dd309003850733a71"}},{"ruleId":"D17","level":"warning","message":{"text":"BarePragmaDisable: #pragma warning disable EF1001 \u2014 the disable is closed again below, so its scope is not the problem; what it records is no reason: there is nothing on the directive line, and no ordinary comment attached to it either side. A suppression is a decision somebody made, and without the reason the next reader cannot tell a considered exception from an unexamined one, so it is never revisited and it outlives the code it was written for. Put the reason on the directive line \u2014 what makes this site legitimately different \u2014 or fix what the rule is pointing at and delete the pair. A rationale in the member\u0027s documentation comment does not clear this row and is not meant to: it explains the member to its callers, and the next person to touch the suppression is not reading it for that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Tests/TursoEfRemoteReplicaTests.cs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3dd164db4a1ccd53b02a9f627a171087b916b891e9fe14d8267395137da270"}},{"ruleId":"D17","level":"error","message":{"text":"WriteOnlyPrivateField: private Task _serverTask \u2014 assigned 1 time(s), read never \u2014 this field is written and never read anywhere its type can be reached from, so the state it keeps answers no question: every assignment to it computes a value that nothing observes, on every instance, for the lifetime of each one. It reads as a flag the code branches on, and nothing branches on it. Delete the field and its assignments \u2014 or, if the value was MEANT to be consulted, the missing read is the defect this row is pointing at, and the branch that should have depended on it is not there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Tests/TursoRemoteTests.cs"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1d2895934b607882cfc4f905bb3f0c286ef937c8c421424aee72851a6d6a48"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1591 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/Turso.Data.csproj"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4cccddd6e2c2130bfefcd04e1d89e6a26fcdfc34acd9deed030ac0e0623ac7"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1591 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/Turso.Data.Sqlite.csproj"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e979d3d1b214740f995edff3948263d51be52b7e07b06578d1b61941558e6265"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1591 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Turso.EntityFrameworkCore.Sqlite.csproj"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8f4ccd5ac3728a22ad0a7a4d1b732e2522b344699ce0f439d65b45e237d8a2"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1591 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Platform.Client/Turso.Platform.Client.csproj"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5862954f53b8a5d7068d5649fd5cad8addc633035e719af89b133fbb299eb4"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1591 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Raw/Turso.Raw.csproj"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac432035311918830d4c8d22e7cbd463ed19afbad561eb6c2cc1a8631121ffde"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: 1591 \u2014 this project generates an XML documentation file as a build output, so its documentation is something it PUBLISHES to whoever consumes the assembly, and this entry switches off a rule whose only job is to report that documentation missing or malformed. The two decisions sit in the same file and the quiet one wins: the documentation this project ships has holes exactly where the rule would have pointed, no build says so, and the people who meet the gap are downstream \u2014 in their editor, at the moment they are trying to use the member. Write the documentation the rule is asking for and drop the code from the list; where only some elements genuinely cannot carry it, narrow the suppression to those sites and give each one its reason, so the rest of the API stays covered. If the documentation was never meant to be consumed, the honest fix is the other line \u2014 stop generating the file, so the project no longer publishes something it is choosing not to check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Serverless.Client/Turso.Serverless.Client.csproj"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"805a4db97ea42fc70504cfd49ab8ab24889f368a5204c032160cd0d53c52ce96"}},{"ruleId":"D17","level":"error","message":{"text":"NoWarnInCsproj: EF1001 \u2014 this warning is switched off for the WHOLE project, in every file it builds, including code written years from now: nothing at the call site records that the rule was ever silenced, so the next reader has no reason to look here. Fix what the rule is reporting and drop the code from the list, or \u2014 if some occurrences really are legitimate \u2014 narrow the suppression to those sites and give each one its reason, so the rule keeps protecting the rest of the project."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Turso.EntityFrameworkCore.Sqlite.csproj"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"654c884e13779690065a153d978df274552693843a5b4c3f3afe8b13d2128829"}},{"ruleId":"D17","level":"warning","message":{"text":"CommentedOutCode: commented-out configuration block \u0060stress-nondeterminism-check\u0060 (17 lines)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/rust.yml"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5b9e81f7c706a4741bfc877251e2bdc89296edc4093bab3404887f18846d8d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060Turso.Data\u0060 is a package (\u0060IsPackable true\u0060) and neither \u0060bindings/dotnet/src/Turso.Data/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84083bf02402f792b300b35735df03f5e2e453a7579423bfaa007f64eb49d618"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060Turso.Raw\u0060 is a package (\u0060IsPackable true\u0060) and neither \u0060bindings/dotnet/src/Turso.Raw/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Raw/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74b5035f78d585c21af1c0f50e0b8e56f4a43a2d140bd616ef3d7a5ed4b67e7"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060common\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060bindings/javascript/packages/common/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/common/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da512f4b7f79e793cf63f33ec6978654fb5dd5381285a2fcdb0fedae07a62993"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060wasm-common\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060bindings/javascript/packages/wasm-common/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm-common/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36bccb6a3791968271ae0902e8bd5ca1f534d0460a171ad4e4bfe2a68e03dd1"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060common\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060bindings/javascript/sync/packages/common/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/common/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b537148071e97f8aa507cef4d80b3d49a64a05b82d070cb5a02b14dadc2bfdd"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060simulator-docker-runner\u0060 is a published package (\u0060package.json\u0060 without \u0060\u0022private\u0022: true\u0060) and neither \u0060testing/simulator/simulator-docker-runner/README.MD\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/simulator-docker-runner/README.MD"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ae46eb0eb4328c5d040d011c826d2f5f5ebf6c0a5eee8d0dac92a34a4d364d"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060bindings/dotnet/src/Turso.Platform.Client/tools/OpenApiTitler/OpenApiTitler.csproj\u0060 makes this repository a deployable product (line 4)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Platform.Client/tools/OpenApiTitler/OpenApiTitler.csproj"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8973abbee956498bd104dc594970bd2f858734575e76e779ed242653fa64a6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Resolves requestBody/response -\u003E content -\u003E application/json -\u003E schema.\u0022 repeats the code it sits on: 7 of its 8 words (request, body, response, content, application, json, schema) are already in \u0060JsonObject? GetJsonSchema(JsonNode? requestBodyOrResponse)\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":"bindings/dotnet/src/Turso.Platform.Client/tools/OpenApiTitler/Program.cs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b642269a6838fd3da3f83d9c7c51da2800aac9a35604ac74b16ffccfcd3c58f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create IO context with auth token and base URL\u0022 repeats the code it sits on: 6 of its 7 words (io, context, auth, token, base, url) are already in \u0060this._ioContext = {\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":"bindings/react-native/src/Database.ts"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0857da9846be335379932ab2e8dfc806350c7ca879b03adf996172234379348b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Define inTransaction property\u0022 repeats the code it sits on: 3 of its 3 words (define, transaction, property) are already in \u0060Object.defineProperty(this, \u0027inTransaction\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":"serverless/javascript/src/connection.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2edbcd7dc5db599c6b900b4f078c9d62a6454b09c97057e89cfabfab8958b78"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Github app ID.\u0022 repeats the code it sits on: 3 of its 3 words (github, app, id) are already in \u0060GITHUB_APP_ID: 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":"testing/differential-oracle/fuzzer/docker-runner/github.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72a52bffc8d15cb30bb6f8c94a88b9bb57b7e3d4f11b75a561942da9dcbdfa6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022This is the private key of the Github App.\u0022 repeats the code it sits on: 4 of its 4 words (private, key, github, app) are already in \u0060GITHUB_APP_PRIVATE_KEY: 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":"testing/differential-oracle/fuzzer/docker-runner/github.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c647c92799b61e4c2a95971f998c7bf12049bfc3f259c19bf9a6750b38c331fd"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Github app ID.\u0022 repeats the code it sits on: 3 of its 3 words (github, app, id) are already in \u0060GITHUB_APP_ID: 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":"testing/simulator/simulator-docker-runner/github.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b4716d00dc960e0c3fe127d09f9eefb06af9efac1866298e890cd3470ee27f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Build SQLancer\u0022 repeats the code it sits on: 3 of its 3 words (build, sq, lancer) are already in \u0060console.log(\u0022Building SQLancer...\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":"testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.ts"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bf93e2395978f097df1cecdc872c0f8c3aeeaf12fd0d612ea1bb1576d223f1"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"da5ee43adbd881b5df55d3e5dc5e5b1d2c165c8ef58cff3b2ef86cb0bc580d37"},"properties":{"commitSha":"deffa7d3457151d07726f566842b8d4f674d592a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"67f0481d72946c912fb3c37042e6db46631ddf6c35651299ba3ff282a8d5ce35"},"properties":{"commitSha":"81a38c942f56e5f50288c1f678a1d81e9db08675"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ceedeacc8612ffa7346a4505ac704b8c9c583c9014523315213ffd93a07830ec"},"properties":{"commitSha":"91e166914b5b24d9d0df1d0521000b8e0ab41875"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"596621fbdc898db30e8b5c176e46f96418fd1ab7f804463bacf1ece2da03e369"},"properties":{"commitSha":"9f1f90b1f153401f144fdd459eba618d5a03d680"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3dce8b47839b6cc65020933c5f2cb5f54328334b371e96019a03b41da0110aa1"},"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":"3ea5b13abddfb4ea201f49d88c4bd186df10cb400d69d7812533761a2d02b288"},"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":"2e4be2e2b3a28f34d5580478709721de6fee3ee8d104cfc5e925d590414ab467"},"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":"9a68481c9911d37e9d46d671f2fea3d7c61cf1a6f8dae009648c485c90446bb4"},"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":"0c062fa8736c6321e41ce86ea5d79e50eb854e573167296b80e4bd4e917e0338"},"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":"28052ec2507b692b5565d1b333301d272c5f6f444c9eeae22a83b408e56badb7"},"taxa":[{"id":"CWE-250","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dca1efaadb8ddc894f797b446a14a68ff1a9db08ed73811a0c0b0ef6ae3ce0cd"},"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":"c07e382c3c779be04d5152272941dbd8ebb6e153764d654d2a79d186c7ded7a6"},"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":"2872c9fc19cfd5700906afee67116908d8e5fc02b3cb8cd3dd19eef633831408"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff99fbd9bd307663b540f5d10cc84b4a695c72cd8f168392fde4bc92af6ac5a5"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fcda7508b8398c8669157c70cbd7c23f62e4cb4ca5fe3f28593c11e088a298dd"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"196b345ec7c1f1126fc04f68782d20c65a0336d682edd79f4cc4dec6bcb904ec"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"122740f5dcea67e07a02328c80c250411265e9204a2a281b87fae849f41173c4"},"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":"7653c48c5186d844edb787567459ed37e0c52440288c57829339f5da5fff007c"},"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":"25e148428990f316bf0ab90483251366bd9c3ce7523c2de0cd722b7a05ebc3e7"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0d1ea01dd06225240e9a752096572fc21450ddefb3b3df4086b8e3d424a567d7"},"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":"17ed54f747ce31f19117bcabff19d9d7dcda889279f37f17909b76b97603b54c"},"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":"87eed271fb4cef83e603aa4614bd641186c38891a0bee13260fc5130f7501edd"},"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":"2471a3f2e914729b00fb3baa68229a99256182ed33dec2a5c73b44a47220f941"},"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":"93d09705143c8dd7e9c535437d27691b4b3e8d20c7b80f0733e7563049cf7604"},"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":"7b2ee73db1c0e61a18a7c794a997b5a6a0c86d35c79f393aa16ab73718500f64"},"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":"471f3a06c318aca6dd5bad71b6f140e38fa4959c7b4dfc9512d8f017cf75f311"},"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":"bf3c2cdc96f49192b2fbecef819a8cb7e4a46807bbcc4b54f848f99bbb12e921"},"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":"41eff5675caff962c44a87cf10fa162b279513ae432aa5d916180a5ed3ff5440"},"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":"8827aad09084da866d2eb76feedd4e75cfbd89bf08af19466ebba744468abf8a"},"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":"e9b9e4e7b120613693361492e18b058479116848005dfb0f91b75a99f6c0f934"},"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":"b51cd731fb525f17b8b38c463acdcc7a2e0d6505b031804e7772e82736f0991e"},"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":"f47ad9b89161fee9fa9b9e467292ad5afe4b81b2fd67408a67a7b63c338b6b38"},"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":"49e9df15abb5f92add0830591936c7eef68c563b22208cadcbe80ba32728ab96"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b80a161fd2a3d027b1495113ac23abeb4180536f251c09d73276ec879b56f88"},"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":"01e29bb0755669a6eef55a47413377e77dce7b88ba57ea898a5621ba61b9b281"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d2bbf4db0c0e09606afc98b04e17df3bfe887cdfdd807d54822b0c9b8316e441"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0957cc7f47d1931c56662464cd3ce406765637560a7f96e94ab37853c0558962"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e95f6532d08bee653ce4555799288487dd087220965de716dee8e77db2e28166"},"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":"97883f3c6873781c2574d99eb3bbfc1c1f87ae8031b4d63bde886ca7f7fefce9"},"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":"e01d0baeb189f3f58d271ff9bdf85808576f365920c4054d433c26093dede49c"},"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":"63d4674af3841316316fa78e3508ed2c34d39ddac958b51212fffbd8ab8e497e"},"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":"7c4b16ca2e4cf4312ca65667076d7972b1d1e3d15a8ffa0e75a7ddbfe62920c4"},"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":"ec4c6b77d3d977ce22bf4d1869f13a397cbc228d613a09def984521faf6d7340"},"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":"42525c0749d780f45b76058c97b5a4cad3e844385ce0c39867048d99f1022f89"},"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":"19f861b793bcd0dd57a5d63e88ef747fa10c172caf78b1942ea681304299314e"},"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":"7947dc5f5027d62e847d8038dc3a4e3f4be3e1c4aec7cae2b55e922def22e750"},"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":"00185a8ced72ddf4f39a4109bf9153cd636e73a16e64010a2fd2c841ea587c80"},"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":"a21b94ae0b7309feffb9dd02bf7a50080fe8cb1027c9b935b04938ef4fa7f2b1"},"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":"5e2685e931bcbf427961a90b27529e02a163ad9a91251cd2372ef0c60a46b371"},"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":"fef5da318fea97a27470f486d97b761bcb5d906ea7266f08b5a1c57a77a95996"},"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":"404501da3fe43fe9143108189ac270e30d041a7be0595a6977ad915025a25ad2"},"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":"14b23c7e786550b004f4607f3c99f6ac6f36f0f5eae46cd5da49b4e695f29f05"},"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":"1079f4eb956a1d0e5a7e16dee22a0a221f94dc21eab44b6af1f05428768eca83"},"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":"75e33d7eacb4ff8a8195c3e8be3edfdf81b919f3d40eb8ebf262af594cd88a84"},"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":"14ca78f827620d20908bb3c49c883fbba09a2cd4b66b450a52c5a7de814f9c69"},"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":"67e5b9be38b2569c45a2346b8a6f273f003ead2071ec350baaff770d749ad7f9"},"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":"394cfc9f3b5c90f9b0bd5930ea1541450752aff9f24f4e7b8c7ae583c0439762"},"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":"1550e9819062864bb90ab488fc98bed173cd09a7863b81e5144336345cb95744"},"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":"0d87a2895cba678a6c7eb6ac24e12b3a79d97fc3933a411e3db056ebd14f2058"},"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":"8846deba28ce9baae37f13af950f74edd150641183a0b2cb45aeb2a8f11e03f4"},"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":"8177686245a87a8579378929b1f2b7517e80f3206c2bfcf90597ce659a59e4e6"},"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":"5432c6c7c8f6d81c7acd8e0693c423b7b6c752c9361ba9453af56b8c68817fbd"},"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":"4d935e599b21d0d9987006b19afa0a0f596f0bccf4091ccd64d4b634841a6431"},"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":"08f609ba0b699dbcdb9427fafe0d453fb54cc069ba896471b0206151e37c5bed"},"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":"b51c19b86dee89f7ee18095a4eb48220f2df88f6559f1aeacfba74e29e15b161"},"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":"6c2d276b881f722589120b7d8211e1ae9a4cd70986ebcaa0f667e22f2493f42b"},"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":"21b56ea3e70111b2fd9f656b9c528b5a9cf3b1cc8a2f1756658cdbbbd9adc03d"},"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":"c57588762aacbf42ce6df8c14d4601f2b6c46eb967600892d10445aa758415b3"},"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":"2e195b19bb84117307946330ad13827272627822128a4adb0dc92839abdc161a"},"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":"5b33c39ded716426fe65fd54f73a1327436e4944cea71e7ab0e3605fe4ff2ea3"},"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":"09b05d58ec3279e321419b5b9c881d41d6e1eedc49095668af6f3d8bd0bdcb33"},"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":"c1579d2f7100425faee6fda10493f84af8b8e7a6c86052210aa6905f2ae408a5"},"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":"9d320da4066b2f636279dd9ef0a76c1da965074aebf234d7aa4c61a33582bc30"},"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":"306d5a851ff725ef8bb04606dc23bddb8772f53c56bf259cf6281f5b49309ec1"},"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":"0d7c3c6e4f70c031d1c9692068f90c0df7a1656c9c30cef78d2d744109a604d8"},"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":"e41129671119f84f270e24fd13af66f326716758f3a5fa8865615f81240fe27b"},"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":"422935c156e4e8cdc607a819183079e9b9408064d13d21b5122536932371e237"},"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":"293128bee5a2e94a65ce3273b402054d15b6b576e6d86199f8ae05a12b3faa05"},"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":"0dd075637a933a46a29e19f0771927bafb7cfc28838205dc25f99e408310018c"},"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":"fc8d13a4a7a594c692fedeedd6c84511fd1013ba33e3c8017bc120b123cf92f5"},"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":"f36e192bfd592852c247121cde35ee02f07f0b580e217016e8f01deed8191f1f"},"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":"565779e444409869371ea298e455b1b77b2a988bc0a1cbeb0dea2526c6b54fbf"},"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":"2586629ba19b4b8447f0edacbf7338929034e1a276a9b53c92ddfc1715ee6b74"},"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":"5c04cf2921bfbe289988fdddc8bbfc6a6f028d4f05e2b127ff7cef53d223e1f7"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eab521191ec740d62b5367efc61636a15f40ab0fc44f97a532ddb5c6e076904a"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f628fe520e839afd473fb2a179c335929145f0673d410ba3a774ec6c328464fe"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4d236a3cde668de3d9bb5a1e6797f4b371eb0a66fa1f41c35f44c50480b2f46"},"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":"caf2246dbd5058394d5045b2486d030bfacc292e8c8dba1be364d2aeb427c6a5"},"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":"00bb9948d3a9e39e3c85fa0b4a8e9d80ebca0e252f48d5bb6f2a275b12b4ac8d"},"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":"3a17d771a811fe5318893195c6c8fc89c8eddeff9d7100896f724fc09b08b35f"},"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":"8ab24b0a1d80bb6e47309d28321f202ed1da4d99bbac450bf9391d7a9602196a"},"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":"4e08481f7d7c56a1e38c91fb56b5a9b18052e6f6e105194b69fff47c3b9b3d34"},"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":"56cf9fbda3200bd48e6864c1b075249836471f4409eb4dc6e1fd5325134883da"},"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":"27312e4362bf49582979afdc66f8c24369dc795302824d7a8b1b7776ae23123f"},"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":"a1042d03dc1f4c79bea9664fcf58a446c258cdfc59b0c889bba606146253dc5b"},"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":"52883f4078efa50f80234f6582365bacffada21abcf26df8ac1c13b5260a53ed"},"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":"5b70cb83f444733dad482849eaece6edbebb5c3471aa7ac2831f931f4965da83"},"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":"de157148a71b19f23c1fb29b7b2c8865aed15e75809897b1e3e4cfb2ef65d9ff"},"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":"b46684c48763b75a071b9d51beeb2a3936cf1e7609671985247c1a35682d0784"},"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":"6822fed9c030587d029faffd33450d50a0f66f17e83d7cc479cf2c76ad99c091"},"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":"19e9ca6d01e96e88ebd317a0c4656c0aa67dfef4b2f9ef5928fe56c2268c7224"},"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":"6ec79306991b66c2fdb3050f111610535047dfa97a46b5ee8228088709b0d616"},"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":"4d244422c5a3dda8b992acaeb68f8581dcd2703ff3a22250494adaa0aedc5f81"},"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":"e01ba825cd83e1dfbc008a2c8a497567ba2b7a0af19e9f1b9f092c326f23519b"},"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":"0affe07cf337a03a497b2d267335889589d9ea377af7c3055a04a279107aa5c2"},"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":"43dfffa0d8687547c17b9d97df1e69583489a933478f50ea234e8fef89c03643"},"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":"786dfdbe71f4afdcc6716fe9d0d2669caa34233c4c2eb6025ddb7e9610b53e4d"},"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":"74f5761829f324563d1436f8d69aef967c8cb1f859dbb6cabf8c3996d29ec9a8"},"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":"d4fa63368de87abd74f521d7488b7839b3655b7ad52ef6519d86a320b30e6e42"},"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":"d71dd15463e59c7756332d84cbaddfe833ebb50239488a7daace2979585cf0ea"},"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":"40c27e286c683a5947bf58867a56f8c7d46575160f39c5a975bbc328b076316b"},"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":"eed6b277043803ea215dc223b8132943a795e970a8d6334c4e473a7bf5448d45"},"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":"36b0b1f2ac6475841abbcc5e4a740c4e41d14e95597c0541a6355d32bc9fa658"},"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":"c0fc5d496b2277938f10e19233dcb3c45a108fc2082ffed4b50ba7807f557a90"},"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":"b634941594a51675336a19afb7a95f3efea70d9b684af5cce65acbba1c0b0c7b"},"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":"6a3b979f90664f9385198fb4c78a5a4e8c85dd03725647f9a3e88f94ac20817b"},"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":"72fbb7ad7843a06e348d7b97e41f087a1862c577897ec84b2892e0e21e1b349c"},"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":"26bba73b407a76e3c7bccacddf345b729203ae413d19bd1fd1675925ae566a65"},"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":"a9e2eb01bec93e5f05a80a69c8ee7e8dc383c0e1ca1a35159f68003275438454"},"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":"6ff3f206512674e5198abd0c2a24282745090b3af4421f3cbfed811e9b3289a9"},"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":"f98423207a1fa4025180577001f13d2efd94bbeb16589347b212fb501edc7fb3"},"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":"a6496e25baa575e84a64636f0c1e6d2a82449ff421599ea0ede4400581fb4cf8"},"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":"64bdfbf71140f46f458a533ae90af03502452c5d9c111afab37014f1b74217f8"},"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":"3476ef6a1d2d901ca14d8a6c4b5fe14a7b0b1b1d6980daa897ded89ca7f03282"},"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":"ddd2cd88efd2fc077e7341fe3d213413eef438c0853ecfc875e11741c7ac986b"},"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":"5d61198a83b456bc9633eedb18147af34580527df9a80ffc385d615c7e503a10"},"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":"a20a344d7a0ad088c56384d5b822fbe6973a81696d190e7e0e5949f48fe4f98b"},"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":"0d1d49d9ea364a425add5a958fcbbcb7e4fd381979a35084cca846a0ab1b81d8"},"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":"71c15da0d863d893bef5f2aaff830f4a5a7e4bcdc7e93abcb72466d7fd2dc6f9"},"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":"e18d35c2f6ad7b0dabb8c94e66345c9c1c2df4db9a2db3fc9fb83a7d8f8f796d"},"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":"fd1ff54861b7322014ac12e24372af7ff20d8d35a510f20ec99efee0935b026e"},"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":"e65c931b5844ce581ce5a01e0280b1fb49085427ca9d7434d84ac22e6dbfcac9"},"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":"d751549efb138e084c769ca62cd2f5ef2f8b887ad8dfc5df34f22fad5c000e5b"},"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":"36ca9ef20cda35fda4f0a60a100346b7a1373c862efc23b5676ea3359140d268"},"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":"7dc1d11b7f96c5a981b4c6f5adf949296c3d401deea6c137b98d2fd584e758b2"},"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":"47369a826134db0b798497b3514f7c435fd172f7477676ff3d1696c3e66d614e"},"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":"fd0639b99010a1d323ea6a8510ac91fb2e6bc3f847c848d2283cf4dfcd9eeac6"},"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":"02398de3803a8216cb77f48ef32a3d48721fe0c793069825ad9ef5a00220eb49"},"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":"c941bc03d720124ae30f3587c7bc54f0853d0171dc40ffbe136357112ca11f88"},"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":"d588c2c411c6e428f4e04f05990cf85d9b33b942ebb4b4a34c731313ca40e1a5"},"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":"9f991ef91e47cbd3fdfae5d5f68bafe22c420cb948c7ff84c7dc9fd2643dd2ab"},"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":"3807883afeb9c5573b40e5204cbcad47a5a25d311e80a7a53d70164605591719"},"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":"42d1308125b89d32c2715dd8f8b871032d8a2a9c9719de7ca5cbf3be67501221"},"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":"6bc46d8774db739a3db8ef0e9460c24fd5b5715b3725d38fbd79fb2f31d4565b"},"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":"70b70784fbcc31a9e9c31598b2a3fa4cfda04ac044bd1ae0aa5c5e42711f5604"},"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":"173d67e5d5e1a86ff55721931a29c1ce44c9c6b3e8d7ee401bb63d90f8708713"},"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":"973c34357baa230d3abdc572810ed6af815e18bcc33be6d45b3735302ca2639b"},"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":"7f1c0d45bb1c0c5b114f97af06457a6c33dcf4d4eb2161dbafb134e371bee802"},"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":"288ed750189dde143351732e94eab2792ba469ba5d9432d9b4505414d6988fff"},"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":"832bc734d6f4565fa6aee92ed5f6bed74e8278479f8848e8b37cbc66e6bddc64"},"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":"4a91d3774746cff798305e04a251863e156474679daad416aa216c7e61717bba"},"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":"3f2b8274ca7223272e9698f30e327d373a068350e53ceb6b649f743d3f847e89"},"taxa":[{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08497a49cd7481f55cdcc7e609ddffe7b24967444205ea17342b38d19168b400"},"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":"c42287d65738178c05d43c0364a166fc058987142d6096b19ca9c76ccf89c06b"},"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":"23537fb7f33b2f60e0b5308beadd13bbebbda2e4c4723b70aa25b9b49839fcab"},"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":"6720b50e95ffb3a36d3a535f337fb6e3381769b39816647d0d836d5320a5d9a1"},"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":"595f1d56beec6d41528e365b14d661fe97d42faaf7cd18062fde3905da42ce82"},"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":"ade58f2d1b690517dcfc5ec0159905ea452253a468c29aec233de719b8d7d5cd"},"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":"3be2daaa6f1e3d086499222346705f8ebf8b032e9fd8d7b323a791147ba0d276"},"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":"0606690f181b9d5949af011ec1c4d7b3825e5e71d957ed91ac53fb00d1fb15d9"},"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":"393c39040e178411753e33d22458e9a649ba192507c7240660a7cb09b5e0f455"},"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":"114dba271b72d0705f1c266c4271385d82dd7f4e56efa238eb4e2eb45a083cb0"},"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":"2d7173c1b3097e2f69676deefe161c8184e768de707d73ab2b803c4286541e96"},"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":"3b6a7bad3c70e65c9e50a65b6a35fe64027fe60f05900b2303d2a1945e016c45"},"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":"3d9606e187a0acdc11dc2b946f59198dee243516b977001500fdb2c779f99c05"},"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":"9cde0749ee0b6da47f96544605bcd6429a24b345a3cdf712c78e17c5d61b8b1b"},"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":"5e91cf8be717238ee54897737f8096358137cc0f0813ec0da31dcf9c261a7a32"},"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":"20a5e043a660940d2989788f84306acc3af05c08a62cbc001190a3d89901db4f"},"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":"f7d24b5b74e256e47626c54f6865a0f5c90732e6334a892235588e2c6e5aef7e"},"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":"f4b83e40f270b6be315eb2aad0e3a2aa582dcfe291573f833b99da4b06e9a02a"},"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":"14a9fa6e50fc7e37e344ad8af207ef2303c5e84ed3c01a10c4aaf9f6f64f44f1"},"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":"599ec42dc25cdadf13e9603ba9a1a90f9bc754ae51aac62444a8c38e7d30f995"},"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":"3d4f5395ad33f4853d8ef69e2a93ca2581118a416a57d42850690433c690cb47"},"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":"42b4358e2c16bb19a83d4c33c752a62bc5c56ff8b7104988db04ba0fd5f37b61"},"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":"946c610e6aa0778a05c0bec54801509b6a06e14ea6f3064201426bdf0b366be9"},"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":"dd257bbd3a788878694566c9e611712183731e78857e0439f0ddff58a2a34f79"},"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":"d3e9ed4ed9c990a5a2ccbfd8437628a285426fa5dc01a3db97357ffa1e3714c3"},"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":"9750cfd0f5529b63a704cac9fc38fa6578d8fd2cafedb19ae3e133a3a865a6b2"},"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":"e4c6f3b5b4ce33497329c72f0bb72f2baed031557e1985b3082bd341a2df47f1"},"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":"1eb3c3a82bd2c626ebf6dcf4a903b3b20423dc862139ccb614eb8a84ce761de4"},"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":"d3e7f21a1602faf1bf0774fc9882a7991e27d3049f94f0b32edf1769552d7d98"},"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":"685634c201ebf112428ea739e00e0908580d195cea8d019714711f102d6cd616"},"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":"97b5034ea0b358d16fba12e6d8c6c7fe2113f9a9b93495edf2d98fa4e999e33f"},"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":"91ae47835dde23d630b4f7308d1530854939e37df40d90fc0e540fe0fa099cb3"},"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":"aa28b6b11f0283849fe589e92076e15e2162e9494124e252ff852355b8d96430"},"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":"8d55fe3f38b1ece71d87beba5f16163cee162b850c7bec54b963e69efc577842"},"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":"8e74c7ccf5e3964e349c37f3c6eca301b92ead4ffaf9e2efce810b442a133c9a"},"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":"7357a808a33d371a115a5a396e81e42a0d4396c7e8370954345eb3b9d2524fc1"},"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":"280a237ecb38c974c514dc1fac52248b9e93d1097d20b8b7abcc56bf8b1bcbff"},"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":"60187ac789b2f2718292ce8f06c680db36f9f58e5e0f865bbe9990aedf03f8bc"},"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":"34f9374f7f690c535a2e99bdf3ba4d870761be9fc797f77827da1f9235bfd818"},"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":"e42fedb7955ec2a84268df044df003978845b23fb24ed9ff8dba67956747dc7d"},"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":"596acf8c48a3f76fbd6d938b6a5eb8939eee23c0a5074f2d06f677cb1ea5b7f1"},"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":"09b11607b3232e2f9f46a7bbcc04124b517f4ea1592011f3f780433a962d437e"},"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":"f61e6250858bdfa71062ce3e01897d18a78b30e454d68adbe7295d3e26dba3ed"},"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":"cc6dec5ccb6c17ff7088266ed77465f9970fd4f3132694d1200e0a772b9cc439"},"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":"4ed0f183b698adafa306ce3adc10f2170a3afb8cda056be9b5a25c8074f80449"},"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":"ecd433211e85cb561671227ac07e1e398434a05d9cf8d207bc4ee60d4ab773ef"},"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":"b06673c77a84a42de9bba4e54be69b948eb07ca74338e1d735a966e4758c663b"},"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":"2c11c4da6149f77fb56ab3752687b545f9f07e28577db1736f4ef1201ac2713e"},"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":"3fe02316093e71125da6ec814ee92a5adf255664b9f3170ef9fcafd196f58361"},"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":"9389a64530a26061d0ce485e2ed2d20fa85cccb97aa68813117c76a1eb7467c7"},"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":"2ff3f0debec1b0214b917fdd821c7ecbd57b7e3a6a9491f19251ba8a4e669c7c"},"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":"095ed0bc452666596ac51796c5d0e206b31f786bba6eed5f6045dc49073ba178"},"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":"77204b24a9c7f95df932545532288f3cced05304a498d6d347eb80c639c08a50"},"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":"c6b252194a182f1f0fe049e6a2a849cb5082e843bf48ef5e709c6ef960960605"},"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":"48b2b554cbbd39464d3a180c19719acd024b217932c6ba1298925f073bcddaff"},"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":"21e0733133c47f81bdb8198ad60442a37cfe8352587c227b481b1d3403c3fdc2"},"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":"e3ab244250f7ea6d42342aa4ed151d2620a81077d40aba7c4f77e00be0bb833e"},"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":"aae6f05ddc8fdc07d8feb331f75135ce1d3dcc02e93d4c6722431ffe24d741be"},"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":"e91a7171b8f43c43dc64f9e88989530e95fb42c475e14343de9329f24f075aa3"},"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":"c5e6b2c28f5273ea99e2f9afc56f2a6c860cdebdffab3e6218d5fc98b12f7823"},"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":"5a3504af2f583bc18ae72de502724b5eb697265b16caa0a4607757a9358d6a8d"},"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":"b3c7aa137d1951ff9c059066a0d39d3e5c23b241923e5bfba087ec9a8bb74d28"},"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":"c90276eb3f39740bdaf23ac856117259a0d185c6da49cf79902c5ef278432ce4"},"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":"fa20973493de9ab828a5d80fcf59cdf5fdca11dddef0473603fb839c2bde0cc7"},"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":"9193ff1f639b4397ad8ae670c9f0d412cfddf5367adf7e1ac0e18acd3dd57b7f"},"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":"7bb19316e2cdc68db74096a48e1d791b4bd525ed87eb45b6fe417364cb4bc8d3"},"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":"8fce615708a7f9d6ba6c198cb234ce4d144618ea8a572fe32626d372bb5e505b"},"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":"60867defa1397ccd7df1dd2edf32a2816114a0dc966f50c06c5a5b9222752025"},"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":"c043975c81567339768067e7e8a836aab02afc89aea33f657bd7ea31356271df"},"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":"580995a3167cd6ce4e931bb518eb0f24a99db36220e72c5b0ea0a276def367a6"},"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":"ac87b75760b31f64b8048653f35186305a851811d38c7bd48d68a232e9b7b765"},"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":"745f5ca3c33101973be3e17d89ada55f91fb4d6601452dd9bfaf0a1bd3d05459"},"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":"907ba5b1e7b550a73ff7afa667a7a2de218a5ac1e94b2f4a666f70814aa48d89"},"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":"4ca20ab9a1b7efcd6f5ea7f0728f7c729aed60a3df7dd8c47981a5e049099502"},"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":"8f748178982897f2543fcfc173b87c2b0d154874c122fa153ce451c8705cde06"},"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":"c16df4a9e31b923d9aee555aa1d0bc2d165c35f48ec8e5e78d9f034cbab10592"},"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":"dcb03b5f9389f92563a64a01f40d8a04b16d4893aa6111b4340700a340fba4a4"},"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":"f263d29037dabe1a01f6022abd054027de70742f9f8a2a179b92c466246cd0d9"},"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":"24f983e57d11d78e0cba474c1eab911fffd1e0007250e9c55c73943fa5f314b5"},"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":"58bf61e4822dfca76ea3ec3fc4c1d05e411348212c948b5ab69e47071ebe3014"},"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":"850206aba9d8e1438e2d3e2515018bc4250c3712d6cc126f908c88f87011d885"},"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":"b41bbae5ac1ff264e59fc5f25d19caeb77b04dd40376beb6946453c5dcc765b1"},"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":"167825a5936f13a057e382a45779b55abbc7b5bf8badfef6958f251885551a7c"},"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":"63597ede8f1be758920e1eccae8c9d93bfa0e87db0715f48eaf1a9eb0b66db09"},"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":"b7f628188af11161c9d7b149e5299476a793eb3ff0267f1e5cda2d124025c321"},"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":"1c9f712282322d5bb8d8c66b0bff8849a6cc12ebcc67f504aed66923244092d1"},"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":"c0590c26856c8f728e84383288e6d9160a129f66396dffd22de9ff0fef55f418"},"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":"36dbca2a80fe54ef2e625786c25c207bc932af69db6f0619aaee5dcb2a2275c6"},"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":"7e0acaafdd67a1c4ec1048f77ff46d9d99fa7b6f21e5fb3116f8c53deaced558"},"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":"d495062c36a250c5f284182b2f912b7d33807fd7ffbcdb5bdd312ee6b5218084"},"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":"f477d7d15eb9bd04146a5754fd2440c7b96d363bed660e1815c76c1c2f6ef9c1"},"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":"c05176b9efdd6e6cddcf0061854f9d916c4130cf74beb2b7eeb150df6b7afad9"},"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":"60762e51f77033900e0c3304ce1f03e99d824db8a51668edf13bc267af74892d"},"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":"14208a6aaa9a84824368c8dbeaea2cf76edce2c7da32511023e012c4daa8d8e3"},"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":"43b7dc94e833e074013ba369d287bd23750261e30cd4e9ffac8b6d4f6ed349db"},"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":"933fd536b8721f09111a44a24e43092861a7829d5256bbd9a273d984838caeea"},"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":"a9608e4549e606853e67efe00ec9ca5a51e2bebe4332e5cf1e014a3028567377"},"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":"68224a64824bf75d6e02522a1195381f5a5f201cb0783c8826e0b41a8c22fe1e"},"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":"c41c061afb82a2210b33acc9c75cf841f8829d5e950553f001996716771356fd"},"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":"ebc8c22c901b173dcf5996ddb1bc8e3972d7221507677a769868d9830ff9b8cf"},"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":"917c1b7e9cfef09af1c0e95c054dcc1bc2ddd83ae7217cea2954f5d6dd3182c0"},"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":"b73766850518bdfd829da2df0f2746c968c023d1b1dc898de11d0b3c42d083f6"},"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":"c3851c8eb698f51aee3fa44fabd14fcfa0b48170699d446cdc1dac65ee65515e"},"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":"0ed5a4fc9fd03a53472b545a737575650f27125866e5b55f995eb7f0a8f55394"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b425c0779d4efea5ac9d7995b13b14357b8dc485c0832d6860ec179af8ff980c"},"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":"d6f3b9c67097af761d337ef59cb2332986344f7edb659a474d4b1010e443d366"},"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":"5a659ac3cd58cb3f94e18da46e168b97be23192203a5fe25a9becdfa7d18c30a"},"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":"d78a9b7d2f861500e2b6254a76053f6c94bb21003ea6040d75d401cc3ed8056c"},"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":"6c6bd0f48ff45599f447cd45f2f95059be2b714843636be286a8a4c660a96db8"},"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":"ef3b9bacc72db8936fe70c0a61664a0493741619e5fd83bbca8cfd24be34ce6b"},"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":"e101164d46146961c5a4de6ec9685009993f66725f6ab9605e5e44b05fa3118a"},"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":"485459cd15ee48c01f6cdb4a4c4b254d67ffd683ff65f3df712a8bec0bff3651"},"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":"ac0d8bc53d209abd02bd86ce5a153687097a07c31070c32af3fde2dbe3e08062"},"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":"ac69c984791fef69d1e307411f7c29738ac174bc5ae62b0eba1080ede2d5c1ca"},"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":"73128196a4b020ffa9d4d6a0b909ce72f7dc4498b67094259a7c1a94ed1675cc"},"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":"917e2b2f208e6bc716234471ed9f19a3b0f5a9de15caff29a4029810315c4f55"},"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":"acdb5d6602bde82532e037f1354d6ec26170629e2dce1c621049af4231b40195"},"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":"bfaaa25640213b772ecd1d681cac3ca04fbf50ea090697002dabc575cd3480c9"},"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":"2857ba9ddeef2c5e45cf2214403c31cb7ebbe87a793395c39a3b36c8c18e0e5f"},"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":"c165cc518a1f514856e7fb357cd4dba0770ba4fc90d7498c181d3951c101d5b0"},"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":"195dcec461759134fe466eb90953175c5e5a397511525033a3953c4762b92fce"},"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":"b72c55e76f20f07dee55fb3368010a5f588e477f329d55b20bf2ac6b1936b4da"},"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":"40f426aa2626edc832b98f876ebab99d09e0bd2a5e87c8d4b59edfc61edb86cf"},"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":"0319ce5915b7cc22a70b9405235e4c74821c1e64750f22b579bada6fb8f328a1"},"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":"0ba4538319666e38f635bf5e4e18e2463a11ae66e548c5a98b7a3550bdc5d803"},"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":"9d874af4db46713859e2a677ad79e7ff055ee9778ce64454b9ca868bfff9e2d8"},"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":"cf9a09476d93613e7c3b9925d2e18c2417572e03dff9f3a63c5a8acc53eb146d"},"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":"8eba842b358037a6f55a242be5856a97aa8a0c6ed5ef65d183411acc1208e4bb"},"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"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":"3560cd7f949b4f538a22ed9a986c6e55f4f69e174223eb36106d95f643d6e20c"},"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":"06daafe2709e468287b505c00bf9feb366987173d1ade4b317a3c3dfe35f4e51"},"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":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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":"ed20bf6038b725d1822cadb75c3bbb3353385d142f90c579e8eafaf2c6d5eb0e"},"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":"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":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"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":"f4c98c98541a54b0a01af4adaa864ceaab9a6f71372985da44cfe686401ae741"},"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":"1de4e8df69f8ea88743a72dc79ebdff0df14ccb12667fe14ae5c33266501ddc5"},"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":"90114bdfb46a14da7fdb84f499a586ebbb6ec4f6d60b31ffbb53eaa867f0e164"},"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":"779ada017121311af1dcbd594d845a667d64ff17257130a9c2304ac151f9b69e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ff630563cf18d2bfdf0e4add1fe73117b84061a7bdc9937b413454264457179c"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a171985860d653efe45358b81742b5062f66d3b4a0e922a639715aeb6cf1340e"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5264b1a3239e8fafd017cecae4e72ffa7b2963c96365f408b857caba236c16ca"},"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":"8259b8be486050d832e8cd0d3615cb14b1c44312ffed9c1274cb8979ba9ade8a"},"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":"64478662fa5e1544368a8d37a73d78bfc90ea789fe52460bc2794d70b8e273b3"},"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":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"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":"5a0307a0e95589e470722eaa1f6edefde899ff9d045423b92eaede73ef396b02"},"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":"59bdb5a1e8e9e2536fc49c741fcb4259a61a8678fc811d3adeb596662203897f"},"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":"04b15c1d822501a1f3b0513e178960337673a790f4f183f2453907ced2d2833f"},"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":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"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":"9e05a9afdb159c3b4e03fba36ee6c997dfff609cf8e7411f86b673ca79d09a53"},"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":"1d11b483dfcf915b1cf80342d758e26c1a3f32b269afb2615b61f8aa4d116443"},"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":"5820d2832b24c301dfa745945b6d73762e17d6f8190921e1bba42ea7ccd769f9"},"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":"d3863a2595bb228753ae718bfb2db02eb99929aa10f09e1bd606c6259c16041d"},"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":"d2542699b904854fe2d3bb29c559aae2c03652694d5ce26390e798fe91bdf8a8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9547ffe1fe450c6c27db818620d208444635fcb2b5e8020d78e0fe53a6e209e3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4445dfbc2eef6be992d39b3dcc05c4bae1e7837cce35c1fd48aef885756ad3e3"},"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":"37b192edd44ec3622a4a77f8726ae5bfe982f50c4039d879eb72cdf64b18c9aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89bb37b903bc30f61450a2205ec954e925681e960fc56e28dec9f39c9a5a6c25"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8e00e450452881ebfaecef0bdb6d6b4c2ca698802973930f77cbf8e905b2d285"},"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":"d131c32785c6d67895c6817bf9921917ceefb33faf83aef2f41038eb6e979d92"},"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":"dd8c2b9a880923d4dec86420d863f6e81bf7657c845ceb51cea60fbb9d4a444f"},"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":"4e366510d6d4c0ee60f02f4cb1a5aa6408a3a26dacc96182979c6e8916767a11"},"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":"c123c72c0fbc39f5282835e6faac93c33224b1902a119d3772d8a5e2482a5067"},"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":"a76e196d046d6cffe33e3da42c302e40078d51ce12bf38f4aa3509453092cb2d"},"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":"4b36c9b27fd8e8a80fba92a8fa46b50534d50b27ad40bab58cba0dd207973880"},"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":"11e0e62ff53cbded3e2c5ffbaaf61b49ec5156112b662dfd1af2dc323139f48a"},"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":"e6b9943d3e5888b9b670115d5af7e49a40fbb18b9edda554dd105a50c007b157"},"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":"0d54b6a3bd92c144ef0eae8ce5433c469cfc5d3bcd9bdd5c16db8616639cc3a9"},"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":"3577b5d460a45f2f85a34c317d2bbdc39946750e4d239c3a196c4aa170cf5403"},"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":"11166eb7ba129bc5a119448d70b5ba68a37d2f642b3a30ee42ffb136996be929"},"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":"80c19e0e2114d3939b325d084adfe644f297cce1094257bb6740756115cfada6"},"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":"90b14e7f1153c67bdbeec0077e47032ef4de28e18164b38b7196e70eed379390"},"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":"2b5691c5accf6d37ec58f3a779b6eeefb501fd2515c95e807c88911c6c2f87cc"},"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":"94740878708aba0bf1d5de81b0849199b8a02b5640a4690145fdea821b6a96b0"},"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":"e8ee1e8daefe053a47a746e18a42131c85c0e592eaf8aabe28d904fddcb74a65"},"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":"d60333c88b4631ae11bcb052c8b5cb98939b28cf028014d1251b9a66f227dda1"},"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":"d87b9e75e58350e492085394095417f7290985987c6a415f6f6b8de6de104925"},"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":"5e819e6da81df484722a4bbeee3cf18234cf23f1ff1ba8ca94994925432e851b"},"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":"b45720d22f4ebd6baa41095ee35c99cd00cff8ea604036e40bd5a63d92cd3639"},"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":"741cd62944a37ae8e265461ad0cdcb0270cff320cd5a44cbce80c48a0f5126b1"},"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":"8ff3afadf609a6755c1181240e03a3a424d96e89c4dc7c0e39ed489787162736"},"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":"382c0cb310acc81db009fe792c4915be6594a9b4ca894884b75cbd20316c8c88"},"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":"022480bd877a9031ecdfdd4214c7ad005f06a373ab3f89072b0cf9eec29392a3"},"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":"7fffff1ce743d7646d8da73475ea15e203c81415c7b61b11dfb2a931e1a9bdde"},"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":"f27712713be0964fd2475961be3dba0c3f43de936e3e8f2ace38d71a0d4f8d0b"},"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":"506a3b053a330d947bd3c82c0b13eec7dea9ff6d06cf538093010c046f767502"},"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":"eb2857e9e67c1b9cd7f9bd4bc7e291dcac32aa890b03dad5acf91df49afbbbf9"},"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":"c4b1f594fb5963a033fd7314b17fd74df9a452feab4c60f17fca3b3b0b585cf5"},"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":"7c54f2daa87e13b70af71278f405c45590bbc5e3d460954fecc6f7f100e5eb5d"},"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":"2316052545d49f0ede5fed4650f23a17de8d6e0c50f7d910731166b926dacd56"},"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":"2e9d08b7a3bdcd57342a918cd97a8003ae3efaf6b93f330d0ea0455b5c219f0e"},"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":"2f280ec4505dc3e6e0db61a25cffff1826d1c2491e6e8c7b0b9b9aa0aa716644"},"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":"b6411ca257718b534581974b9bbf035eaec569e5e8773c0f86cc4c491782417e"},"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":"8ca86136fc17520f146c9ece99b931a581d0aadf9d6b6765c3969f74cc9c95ea"},"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":"61b046b2c24715ec81946c8897c3dd6814f7847d0b163328df8c89935490ddae"},"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":"ca3f28e101178fbd184686ce3fbe8de031c71edcb5f31372d6e52efa6129c584"},"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":"9aeefd5fd38a5770719fe86fca6549c319878f852365be12322d35d38060bcb9"},"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":"a963e409d4f127328a7c66c37ed493999a4ab2a12dc8b4d08d77b74c750bc90f"},"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":"41c2c6220eb3781f6a4984a4393bc946a13f27a65ea6fe6e4d31f9ea63c59c7f"},"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":"8b3b94fcbd090c387efd62911334cf6b197279e57b4021025c5ae16933230d44"},"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":"f7bdfbf2d7f5f2171ba1449e9273ef5aa50a5a1ca48e7eec1bdd36ad3b55baa2"},"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":"fa2874ee1229be449817d1450f6009bfcec7cb181990687397d651d03e495076"},"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":"628767cd85cb03c2a29b21909b402ce31907177860a3494db2e3c75c8f892843"},"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":"82d42c19cd0a8eccf322a39f7595bf9f4fd116afb454baf8794d7a6eeba5d21b"},"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":"e028a8c4681bbb08706f693af0e7d85e9bc0f6eb46628ad10f834fb8a961587c"},"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":"4128854e3f6eb65b4e68cf04d9d6bbbc0094ff16eba8c244e128aa9f8333358c"},"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":"875873404fc6478b866f3685235ace9d20dae13eff25a361b9e758a28e113bd6"},"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":"0194a7dd4374e8e7ba62b6f04c9b079dc21c6bf6bd6ae14a42919bdfa1ceaf2a"},"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":"4b73ad9e638e136f5cadff540b776a22b9df898e5feb6abbd11652e9f4e53859"},"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":"9ba87db983b1ca284123ce82357ea493b6658d12bab7033bf574a8b99584d9b7"},"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":"c52de93b97f26665dabe5a7a4032c7f98099aa1707d8ec3a019dc63edadc7b6a"},"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":"e4407c77aa9ea4b7f5e72e0d970e2b885d85f4d25c3de68b9f1df85111e07d1a"},"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":"0e6a8c4b2950502186978b06ad826d1631fe1f6f906bb0b1885a0821c6805285"},"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":"851459c4b62b20b2adb8e6d3c52d9d261ce5ed513cf9c4f14f714471fa435587"},"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":"9cde4b8fc0e78d2e071361504c6cc273298f939b7f934f26561bf677cae00564"},"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":"be6608f857960f9c368e66cb665d55fa134e1cb14665757165ed54504e137fd3"},"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":"6443c43cda0147d6d5ffff0736e28823d9eeec32fcfa39574b97fd505c07ec3a"},"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":"86a14ceeb92ed3405e8e97da4a5487ff9f8b908eff12d438e1b4d5705dd70936"},"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":"2665b1d6f58359465ac7cf51194ab242716d7b7a7a7b3476ed9dca993d8772e5"},"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":"f6a909aa62a4c57911a6cdee034a64d8393dd8a35f44f91cd221c79d98ba23c9"},"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":"5c1f6dbf7ad34520cdba23b2029bec294d494d895bbcaac5e6226199e792b4dc"},"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":"d7b65db1b48d888f40fa58aac79f6ee969fb71672e1057f5e5990c7f7737a6b1"},"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":"6945f836c972e665fbf9750749424e4f1225d3106d9491153a0d1c12838ef42e"},"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":"4b0b5358d457faf52b774dfee6cf518409fa31db5dc64ddd8009ba31e5c30c78"},"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":"b6f6d3833a8d71336f70789a012474781c89153fb835ca9b5f7b91cfe328122f"},"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":"bad525a32e0823869d42c31b60a26ad23bb24558b158b83904094e9b5a34a493"},"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":"1954c89b6e6dda90607fad8f49b5d0f5164609e7556dcaabce31492231134b24"},"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":"6e8e7848720984dd707680204fe37a66d9e89c56b5ca7940ff162d1d13bacb76"},"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":"059f126c1e76fa42284cd65c433a9df73e60d540db845f8eb7d8269eceda2b8d"},"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":"b34e5134053b633fe3ce5d50329debd7d3f7ab6b1fa93d1c224122cd6f3535fe"},"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":"18871f81f745c03890f5d92b5a028b2694d77d94abe5255acd4f1a0a5f9c2a30"},"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":"c3e59636ecfdf10236b8f59544f6d5432f000dda7bce4c3236a13c80d049e018"},"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":"65fd7209a2c7e26bace3d86302034a88ad575f0f81fae4c9002cce527eb8c901"},"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":"b64097b0e04086370873e4299b602675a537a0f8e189f763434e3d6ffe2a024b"},"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":"80e4bc91fe6049eb8833ece7c63acee7d374a65fd737bb3de8660c896988cfd6"},"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":"61f45e1961181a04ff664576a73efb1f5534192ed5c35290e1e7fa854d134347"},"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":"514f6a49ece8f98b44922b384e05bc598f65a8acdc645e5834d3eb26c0f67316"},"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":"7d04244c18056a091b29aab1d8ea1e2eafbac07d8ceaf3361130411717dd90a0"},"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":"1f0f554298c59b5e68a16f8ca547433bbec19c45a77d2e1acc672b15d31328ad"},"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":"f74e2c62f85fa108e1e776d2d5a003bce344eb948f69a86a41282bd0b26d30dd"},"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":"c59b412379c684ee71538083a67fe80116a104f797a46d26760372fc7a10b7c1"},"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":"656d446b79e307c61e6c167e2cd6544313ef37587259bb6392bb456b04c15a81"},"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":"7ba4768efbe05e18504b434e8b085c3d9ed18735ce976b798381e9bb2d74f0f1"},"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":"487a1e7b917f93751a43dc930310209404ecb7beca38a0b518925156cdf65772"},"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":"fc3dafc976b2c8bece829cf89590af49f1f99cece0647c3a0ae811f745d59316"},"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":"f4b457e9c706273f6d3fe52429132eb9bd1316378ce871108d9ce6ee62a004dd"},"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":"efe41f6376816510629261682b435ac8c740584a62daf7d390c5287ae5b2c035"},"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":"78ad9eb1ce632f617e3d9225f53d92128962a57c751f8aab5aa9e98274cc820d"},"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":"5325934ce767ca8efb8934ecfc1f7de43cd75b31ea3ba64e2c6b43e279747606"},"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":"ac3777ee54436ff0893e701500b25c3bfc1173715a091206ddd722c8053d035a"},"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":"9d46bceafc053c13b0509223e1af6d2c01a22c86c0cc5e2cb088964a0c4490cd"},"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":"76014b59aa7bbebf68f35f73d11240f94d40fb9d8aa4eb1e5e0cf61f1850fe4d"},"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":"47854e7fe7b5960b7e5b84fbaf437d5080ffaf78b90c7557e1007ce603144c87"},"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":"6e9c2f054cd247727234b7eccc21879040111c37e8d4edb0cbdec0b3daaeecc1"},"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":"a4f558ef60b43dac1111bbd929681a0b535c9ca604752031661beca4c8f6df3c"},"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":"5924a7c1ee9a15cf88b598fb66b606a33a63c6626aa03fd91131f3d440f86e65"},"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":"c771556fb921abcab5b0a44bfa8f7961edaa8d5744da38858a4260deb10b91a8"},"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":"cb235e5e5714b3cf279e491be28735e867c64054f975efd07d3b5b873c0daba5"},"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":"0a3231ef23d9f60492264d3cce1e06b354f48a95627ade1553d15aa7515cfa04"},"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":"87ff5f4edd9a22ce4eff3b289fc8c0d781139c1152aabc1cf9aa89bb4818ca55"},"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":"63c7b046497acca17943f66400441dde7cccb1fff9d8f0476e96b7909d2a190f"},"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":"c736d8eb61704ea0e173c23c323855765b69f26a1da5d56a1c6812e30c5feb3e"},"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":"689c990b8c09a231f1b28060176ed1def555408dce915abc35386d9998b5e0c6"},"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":"96536caeb4b5bddb9064353831535957e1aa42a14dc082282cc1cf3230abbc87"},"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":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"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":"4a08b1042bf7dd5692928150ced759116a5acc9b3d8072a4db1ebab5df4f1e2b"},"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":"184af51527f1cc15bae8375fc5108f8961904f614c1d142e34477d4b5f6835e1"},"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":"8d82bf51a10cf66d10492350b125bdefbf7a69edd4cdd4fba3c4b07c4bb670b0"},"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":"381496e59b2b63f33a15779d3f941a4b6408e60c50fd996d6f82b2bf60a4abcd"},"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":"aab431093617bc41b7cf5b6a2317083c1f90825a7cc1dfcdde659c90b44faced"},"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":"7cf1164b20363240f1b78c5b129c88b9dae5a33595c8b9ed3f7c3d79fc75c352"},"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":"755f7243f9f2f52f3c3fd744b5896163b390ed22079e9dfcef33801dbde916de"},"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":"8f464c65e8ca22fa8a87c777e68178e921a82c6df1a631731f929f2bf974393b"},"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":"298647dbc19e1cacb8f16ebda5d28756f1ce8bdbafb5791932db7548c439897d"},"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":"ad5ab2f1697e3f5b93d1e664ff63cbcace9a6a0dcf76a347e2b3993c33417909"},"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":"7306df2ac791c90ad3706346e7376cc71e4646ae4a2282f86ba7d0bf7e880361"},"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":"b83288b7258d9e0ce78ba9343b0c9c08485d4ffefef842e19796bf35ecb9fdd1"},"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":"886e1de126c0e5587c97f00b0e931239348cf11e8b89e4aef3033648d7b7c749"},"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":"0d5d075405c82c89c7ee3f6321e9481bf21bcc42303e6136cecee3d78f54dba1"},"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":"ddd6c93bd8f8d596ab73daf2255c3abd8be51c0cdeb5f5edfcd63e69c616106d"},"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":"7fa95bb7e5a56c88672a1adc2c7e563f9a1957020ac12d24ad1e01a18e55db95"},"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":"c3f48adf69351d37ba1a584636e9ee8a4dfc42421758d4c0763cff43f82f503d"},"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":"2e3122b9f1929b3af48bee98d2969c9edd290b029ec3ff8541ed06d4dbefbd7d"},"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":"1123c002a7f5d8ec2c5aa87512194e4b641de3cf162e010d687623303dac159c"},"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":"cd4d4f5d0c88ee0a1dd826778e2e0b9e7ed51e1dc5bc7224ff882c7c7a5e7fd3"},"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":"2e167d6ae03c119f12849ce3431c4734fcadae06347d8cf483c5bbfba861ba06"},"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":"5421cb06587713d64953697cee762e64090d76af316644bfdde42614e187df5a"},"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":"28ddb5c9a7f8133b7729d79f804180b9ef19e8873709c0c4beee848913a6a61e"},"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":"93f739b170528829a1b7e0a443d88f78a1c84b90005a500622e023883f301999"},"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":"238a36e6076b4a2a98fa0d0c51ed931333c7de5755ea9b00dd477e4324e4a9e6"},"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":"cdf5628575a7217a215266cc42b50f18308eb120a09c327ccc8a552b9c29ca2e"},"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":"3810843f5dbf14a257d5e8b9fcb3b03cd7711e3943acb58b27a53f6acbde6602"},"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":"4cde0d3fecaa45f095b3df20b68971588c377113abb5d815848105ab9188d36c"},"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":"34769dc61b7ca254e889897b006e659f6e8b16def6d84a3aae43f0ca8413b541"},"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":"8ae95b7e8b05f6ce6be5910e969786d3038431fd5a68bab09cc309100e77d36b"},"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":"35ba9c7b3ed5ec6b0f719dbcfb0ed28a228f1c405369cba9b65f57b55cd6fd5c"},"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":"7c2b811a53ad9df0c08ff43bd9caaf2d8b8864f79002ecbc6f7e3d7e7ad0345e"},"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":"bffe109d65190ae17e4efe4e9849ba6179ff81d9fe3b6c1321c71e5facdd86b9"},"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":"503306f11ece66b4e84c3f7800950a1b9330f5fbbc29126f96a6f99aebbd9aa9"},"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":"0bc1ada3e03ae0b78b591e6f6c2192d58c45d39bb2662b3b66cd3dccbb851845"},"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":"d910338199fc6ebe60ccbb8adea173731b6bc68202a689c7531f46166fbb43eb"},"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":"85520b45a5f26dc5da3b81730daa39563e32537b097b3bca52ebb443a1d21eec"},"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":"6b45700f3c08201ab35d0438ae6d43b1f4e5024311b9ed493562b188a611f2c5"},"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":"03053f5d403ad10248db10491b256f218566569ab3b51cbcb9e9641959e54633"},"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":"bdb43b6e075455cb89a0aa0a76fe15f9233e2cb5de726186d2228153d08880b5"},"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":"c085f9790fadfcae43098ec6bc6bb845265ccfb4968a6a5fcad85726a05a3de3"},"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":"501eeebd809dc6c3eff07b293442af81c6fbc21f3bfcb20911070e63183d1d32"},"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":"944aa6f87eef3018eb3a749878a99c509c9441ac31af09b0bcae7707050b1dc5"},"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":"e461372ad4044b345dd4e95276922fb18e12b6392ed45c6cce5f4f29dea97db6"},"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":"8dacf01811b31a00edb22bd6bb8c88b1eed165f63883ba42033854e41fd41c05"},"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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40db432ee9237e44061d366380d6f71fd2e82522705e938182a6b091fce52391"},"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":"1bb1b729b8edf19bd9490cf229c442b15f47f197709326ae7bb65ca7ed4e34d7"},"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":"633878a06f71e30a7870a8cfd070dd3266e5927fffe17ad1e878bf5cc9bfd147"},"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":"97c4492b8bbe747d81c01d5390dbda6d18fa26edb90a3d20ced8fda297fbb45a"},"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":"173408610b7b8a75e0461c280f8c79f3ea3890a4072dd351e81abb0a6172d1d6"},"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":"01f5a6d2557dd12d394a9c5f1779b22294f4efd9fd04f3421efe87afb8a092d1"},"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":"5026713813aca11bddb5fd391d7c631dee300375c1d8d82a772e2821afeea5f9"},"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":"d2503f9810869484032185953e0587a09641da85d2b639c1aed75675ca184145"},"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":"7189bc904c213ab548835d8c46285fb95d2e0f76df5e3e16530413763027d0c6"},"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":"fc3bb60db66a1c5b975b57963099ff499589ff9d6ebd518b4392d7019249743f"},"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":"4644be7b16cd7e263312bdf02f5bedf4784af9ef4e5299ed1c88c6d27b754b46"},"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":"6cf55c9170d3452c670e0e71b05e029410a9f20964e7b6590bd6cfeb273ad178"},"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":"d074b1c80cf9bc42fed897836e9ff4eb8f66e7e36542d9a94e51d3efd54333cf"},"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":"8e8289ac81e778eaee67c663782674c8a644d75bab72f352dbcb51d13a2d7fe1"},"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":"45b9518520351f730d17aeb859fce87eb40a110673dc8842e9c06ab3f61723e2"},"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":"78515b4e90e809275dca5be6887ee9090f45ef79a89ec1e7074f8fdb8f132e6e"},"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":"ca7b8585d2da8cfe1e701f3715853212c9587889c62147d4beaad6e0dcb6b931"},"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":"255c62b56b188a5723473ad5765cf4688a2979aa522c1c7a77f48014fbb1dd95"},"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":"a210024d0f6ff6b4599d79da5286c46878569f4533122b2f5153e73d8ed97ac6"},"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":"fda7457611bc311161dd4bd27ae05e597e4c8e1a36af3160dda2370fe4df4752"},"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":"a244df0b1da0081daab0beddb81bcbb7c83af6ce9a6b4a77cf6fcf5115857803"},"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":"012fa305af177497e2754ea9722b03fb0b61e194396ae336856be4201e5ba4f3"},"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":"513f03f7c3d978377b8c2cf4370faa3e5e8245b04e75614853addec9b04c18ac"},"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":"c870c9cdcd4b8cabe5bbc0c7b4d23b82e15ac108f56bc5208d73e840e481d4e9"},"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":"3425df602705f59339aa66cd79220df28961ae001558e1e6183f8f74e5bf44f8"},"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":"a69eed91f6d79fabb0200bd3e2f98d8dd0a3a731afc44dff8c8fb9b3104d3da7"},"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":"00315d22f252b99f1a8c864b20965499ca806020b7f1e6ebcbf8f3e4bbe943b5"},"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":"01b143c198e655857f6b43b70701ecd4d4f81cca0429109444628ccf7ef789ca"},"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":"2cd64cc6b1c96f534faf8432b911b43223f152a153fa04fd260307833111be8e"},"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":"aa0bd6c2c260438f276013416352919564237078628b5c81701ae614893d96f7"},"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":"263e03b6ba4f5c172f6e6db0408dc9dd3ea6c699402a7274eee5a3ebf1e45760"},"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":"c3cf0767eae32646ba6dba9baab9a3db0385e4d8b4c7e8a0ebcad62c0e68a750"},"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":"9db0d2520ed2e69bffbec8d6928bbd575f4160612096682c6459cdf7e827a192"},"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":"ac66919a58c109d7253d34bb53197a3bb947049c7b319bd10a92f5192474c2c1"},"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":"8380a5b393f824af49258f86d36e26f1154fd195980111617c879b5ba50576d5"},"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":"226018c4880ede54177a481554d96c29cc85b44f420d6ce38ecf1ed7ed416d22"},"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":"84b36a71eaf7180c45ca74743bbf36b6896f265b93f4a7974df47572d19cf7ed"},"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":"56733dac80a855358835fa2a8427c95605267be8f2c72dd501ac9dd34534fdce"},"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":"87f5467390a57c64ca546b294dea2918881c319413b22c5b7dae6d0e5a0055f5"},"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":"fe47657c96b64da5b41cd7a9ef62d501ea79ed93892890cd7bd9ceacb883727a"},"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":"2fbd08dfb2bbd97dccdf00b455a9f5d15dd1967d08242f61068f1fe139f3dde4"},"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":"a41cacdfec1382d983fab5c75f27588421142a6da613c1914ba6f379550f9c28"},"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":"e167542644669d2440daee74fedca0555c378d2b6f7886e5ec2bda420f2e2344"},"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":"1a05a7922ce046282e62457fa72f4a1f3fa37bd64af745e410066a64b82b4375"},"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":"874a00a4056bcaf20068047dd20d496444dd11f1823fc66b8fd1f3665eea8a56"},"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":"5531176275629b2ebec72de8b44c26928a3297c5ae95cc31c7581be64980c1b1"},"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":"44766976debb5d4fb1fe945c35340de6eedbc06f4411d00c295fcd58c7187a25"},"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":"15208b83680baa0d66b8b99c98a3225ac7555b59bbbbef77d6ddf6dbdeff7565"},"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":"1dffa6d34df1bd18b677f37ee81adf4f4429dc81915670e50ccfd05a1607245b"},"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":"2d6add8acfd0fde9c01fe13231111e05ff9dbdb3f5a6b6279cd61b7308e85291"},"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":"eb074cc8ac34ad8ea487541dca15d02b8cf7cd76fbb13b0de43d540e34e184f7"},"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":"a88e74bfa12ea040ce1e8f7b3a94488da6f6b1a9b3a2e3019feecf5a988aed6f"},"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":"fe9c7d638c6c09fe4a4a2274d546cafb28f43d5461c4be25d0ddf5478317f8ff"},"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":"827257c4dd22a846810804f7363d4a8a17dd4303a7f552d3295080da6089060b"},"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":"8a5f9ca5bf66e470caedfea1083a77b544ca3003829271d5ef9702378a5e62e5"},"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":"c46a517892baddbb37c09efe8fc878963c725b1d7e87d6c9774ced8b28e97963"},"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":"303c0f21f3cd927c3ed86bde2e1ebb3f1555a53c8a616a0f2b828ed2ad988255"},"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":"563b9ab63251349f43641984f49fb9433282ff0700f12ea72abccb96b3893795"},"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":"cba00acb2b491d5e2d84885466fc394d2c5b2562bd2bea6c55d230e8d60ba628"},"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":"c5be088709a72c80df9d3e9e5d888e8dbc2284320bb8f72c6bcaac844a22065c"},"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":"6eec78c1b1cb1c1df8592aa30a7859c51ff25bddb2d1b501c840d390f79950b4"},"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":"4f2c8c62579f7220185b3570a56c3863c83ca69b78e98eec1f039b314f37778b"},"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":"0ad2c2cf4390c210dc32210b93be4483bb64fe5bbf054e2a2c01483fef38c09f"},"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":"f595d2226823222bb96d25286358c07063363a9e1b80376fab46ee84377bc60b"},"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":"e03ed53044362a40f8eb9bd341a717d378720f20c6d62f126be999bbb2ca3b44"},"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":"e65a828db4d493212678cd85f04bce90b05dfda04c883e84d7a5d83ed5a96b99"},"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":"d6f8410c024740acbc8750a554d3efdc009f91595b86c071cd5e1e22ce426415"},"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":"c148fb21d208fd4c20eb9ab444f643ec8f307f864e117ba16a2d809a99f59f36"},"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":"9b413e09683cb27801788229a10d65200590f704b2c16cc0dc6e4116593091fd"},"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":"f18641f38c00fcfcb61334b0fe3ebcced9ffb2f21e4019869c45da5c1b6e1f87"},"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":"e568d64fc34cf927438be51ffb4547f9625480436bb3b85c6f699aa1d16d1055"},"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":"1df13acd469c432507535b6468f61e06d9ff945b531079b743450cedb1c909bd"},"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":"a918fd6b772b04be017a8b9a96963ccfcaf5a742e8b9ad3b6020dee32a5c30c4"},"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":"93ff3c5993de4db5ceadba7be384c53f73b3aa31335d0f6a237ce84200ca8b4b"},"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":"7e93ac5f2fbb181bf3670f6a9b7973c49c7c218fbcd8e3122c81f90411cf8ed7"},"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":"667dada6ab6c1f27ce5411aae4ca8d3638bc30ffc0736de445187e15902556d5"},"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":"a9c818647a7d4d3dc7e278156bb42ca4cd550dc1fa85bc1b9b1bb3977efba9a1"},"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":"89d0607939099a1f9028fe98b161364c835f7f79760a4efc03e6447f8f9834ec"},"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":"7fd46957fa551f2526d56d8e3cb2ca3417117fea144de918b5a05f8cda66cf13"},"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":"99af2e0c73055e93b00ef28d2c7d04adece9fa985a385bbfcf3055c76781dc93"},"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":"12cd8bbf5c231a409d8f3616d7c8d8ec927660bbe304ecda522f45bb566e565a"},"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":"e9698f69b70fdc1b4834005c728f8c770b32b7b375bc68e7631be30ef37dffb7"},"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":"57d1b773a2356c8d79aff28af8957ddb8b9e0cd7222d2cfca7ab1cc06e99bb92"},"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":"31c66d5f493050ed0550b76b93fde129e22bbd97ed5ffbd0c39fb7fe6ee6c190"},"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":"b72d6b27ea0e9fe9577790b895bfa5a0fa3b7d581d94d9d2ac557ca361b078da"},"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":"c27906d0e5e4553f56edb28ff6b752618da81fe8f89af22cf66594866208568e"},"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":"18c3393eecaf782f9a8a11b3ec8aa875f661267510566058e072610d2e0d2749"},"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":"1e9eb39a3d016160173d3ede719f81f62d31974817ad8692e87911e090d2d877"},"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":"3b0f4fda28f461a053fb1198fb2f61867f463a294b165759da904794277978dc"},"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":"a13980299b2ffb9bb476ab4efd37320f08d217cc6eab49bbac2f71dcb098da7e"},"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":"81402637eb60c5438f1a1445b3beaac48693d10df9a779733013a9317e305170"},"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":"1614163913af412a46008f892f792b9a72dae82e5cbcfc3d351039dd2f940f41"},"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":"913472c6d9cd90ebf0498c0680ef514680848cf3e05ce03ce14174e296da1de4"},"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":"5023f63998b9eb3ce97995e3813b6cc5cac5d1d26a47560aefc1d87c96ea4864"},"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":"36cc0c4c540e45c86e95a31514f8155a88c5f287ea60f452867ba9f66bb146ed"},"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":"608eb9559d9b3e1f111048330105bb31c4bead8b587e1c57217e488990487dd6"},"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":"3fa514a5d912b68df52ac3ff2397f5b59fe8bcc648d7e334a5bfe425ed72a0e5"},"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":"74813e7a604852aa15a9c7325a2a3feb810702cd08861f17cad6d22d122ccf99"},"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":"0f7fc595e16ea404317ce339c10ab862ce6fce57e555ae6e3e29d483192991ca"},"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":"34c67ba56e759d1b7c848ca331e52710936a7a29ae30f8053104e0d6b600d45d"},"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":"a43264edea8c9b8782a29ab0d49329de5a90bcac4f57810942e318b13abf78a6"},"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":"a4f08892b83a4ce9a8bb60f36432968138600105cc324289bb6973cce9a62f9e"},"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":"182c078fb1dcbf09f938962c877d2b9078dde13b7878325214240effe2426dbc"},"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":"d558b3658f8ba2d8db4c0551ac3e780a3150bdd307bdced7fdb757dd7494e156"},"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":"9914da062b32b44f658eb169f27067f35d494a9fd9d613e722235bdded4851ad"},"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":"101c99d70f7c386eb6ab97d002a153d0d152dee67edea12cdf77a5f92a83dca8"},"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":"de66baaff1712954338187594a64297b064dc07c04b863df9455efee6eec5d76"},"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":"977ce541d4c2b120705617b9a369e90c4265c99e3ac8992279bea476561fcf4a"},"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":"f6b213c8eb7b0c61835152be4067698d54eed6992a442552367824c7846bd90e"},"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":"a3c68b42d393a3c53ff68b9a8788f749d14be5424d65144ff840d2b12c49a658"},"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":"cb8cf94f863a71e32b5f539634392d34076d4d7511a72d87359f91c976e704f2"},"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":"3fbd93f24c929d2c4a290d08cd8045e75631dd2fe13d57e1dafebca9aef1fbce"},"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":"937ebf7d8f976e3c4ac1ee1d2c4cc5fb6ee39d7ae8185d54379f7041a6ff5fd0"},"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":"ca09ee7dc30d4ddd92e6bc4e037b5ad9cd04c72fb4d67ff38961a4972466d32c"},"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":"db3c4f4549181cca2d0eaae2054963132b9b1f2f0d3ca6e9ed830c4515543ce3"},"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":"00afd0e91e9b1d4d0647f7cd487d7acae12b98109bb70fe8c9bd2670cda855b5"},"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":"c2c937c77eabc716f1068b328b501d19b4259641bcf9abcdff7dd1641a1b21f3"},"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":"acca2076a39d5cd30c1b4f34b9a21300f5768dbf352421ad96cbdd9d4c2d9fb2"},"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":"6db06f480378b2ca566c069968ce169d4caadd63b2275a3e17a520c4f7cde4d0"},"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":"c7cbf646b80e4307353e02bcceaab608bd6ac68cda0fe7e750d65f19fdda30b7"},"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":"c1f0d28baa1797d380dec307fbafca953c6f231503d5c1f9a8f8d99beaeceeaf"},"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":"047b5c9c599ce209a7b3986b66819e484374af83310dbfde1de3585696e0bb9a"},"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":"73fb3db7ecbb7d460d3e46a14674e81a39a216b3f3d931c781b4b54f839fd6c7"},"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":"6a894aec52abcada43764f7261b92dc5f0261bf898e33775b7a1328025442f07"},"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":"f7ed2b8455220ad1630b960e21e80bdddc76ec316fd1c69fa2ec0ef69380a9ee"},"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":"8e2611f658b4c5b87817c80b729f80e1d8f2ef525b73944ec78faa19b46c9c64"},"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":"02f3d80b6eafbf6e9585e7c79f93dbf77faeb45fafb3c7f0df3619fb9cc58c5e"},"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":"d448b3804750e70b8f00bd2f741e59514a3a8acb94702072a75672953f95034c"},"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":"0145d8a49b3f145b64a66dff72af37e10e40b483a2dac0345116530f97e6d0bd"},"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":"67c9a50ce64f27fa593ddc969f91ee7fcaa389e9a1ee32d477850fcc2fb8014d"},"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":"c48968b81664dee132d7faf0162592a1daab69a1f5f6477f16696f7c6d577890"},"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":"8de3abc69dbc063f7540420f25d4df4bb5ea95a65000aeb810e699ffc4cf13c8"},"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":"dbd214691f185cb1af6b6c06bb33e075a21f371e4fc6b43f0af48a0d2748898c"},"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":"017b515d87422354456301a7879beb1ec56c61b862100b3f46343083767eca5a"},"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":"9a73cb038bec5448d3f8115d6bb7d29e8290c3fd8486282b54c38992396afabb"},"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":"1a5f1e266e629f26dc01d5aad7e269ccf8a861eb16693cb1134f4ef9bd08855b"},"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":"d609146ccabfe3801e1d18ec49ca082704bfe09167cda92774575e1a3a98bc5d"},"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":"ee37c02b16d660e58337e2d6a93f41a9d3e36d93f8635c5429169307bb256132"},"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":"2220d122f967fa7037947da55b234ac9df769c8b2b89d6fbc9984b609fb7f6eb"},"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":"9ac90cbaadad257ce3b83a5b50e10a9677bff6816e91d294865e1794f4b035d6"},"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":"24aabc60c26bbb1cbbfc46ff27c13f760a2f2cdf1267f0b65189cacece21ba95"},"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":"e55cf477cc491d3b7e15fc5ce30b23177fe2b1c213adea14f60cc8caac3908ee"},"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":"70219aee234a22a623fc903f9289e4d285565d9fde8d6e77a6052231c54a000a"},"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":"d64047d3ef09a78f14d16bfdc93d1aefa2c4d8decb76fa7b03301b9a9052af6e"},"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":"7ca6262ba58732a89184628d7e3c2f91debf4a8cb07596e557ab1f91f614d231"},"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":"9903322b97d371a49bf611ea753706eead47472aafca5c40a4f16aa34b3c16e2"},"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":"6710ad5d349b4edf362ccc564b0f0454c22dc9969a6985d931b90b5161c38101"},"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":"4d2aa428fbbb1134f1e90092a20b43db65387c65c1c2b69f51ca1260a3d6dfc7"},"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":"da4db74aa27cf1469c24d528a2db292043da700127894d8c300e1aeed6aa5032"},"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":"a6e7f4aed2f8fc31371e851feaa9cb9905eb13ee09c26f09c1d41e0b25035afe"},"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":"4032c7d32062ed606deef8bc3fc7e38099e83da068784bd6e4625c399fd458a6"},"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":"277d45e61929c211bf4d70c9b216307fceac2fd4d4a5926697033d3bebdb0eea"},"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":"da3dce4289c0b1cba946f9fbe9b14e08a1ebd91c2184bfcf89239072f21780cd"},"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":"ba6a402a48fdd77811be884e865ce86cc96870ff17a26ad65979de5bd30a55e9"},"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":"7d2b688adefaf723550ec454cd5a3512d8910747331119f1a1140f9f0e8397ad"},"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":"6305687a9534478b5730442d905d45b56322c128c13f18aae2d6ce290a59a0df"},"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":"e895ff4a5b3bfaa59b74bc3ba9ac0d43abd602f3ff2e8f82fa6cdd511e85d90c"},"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":"4ce384df8fc4035fa470700294d693dc68b04fa5a8d9f3774005e58b8023ea8a"},"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":"b17e7c1a6da750b1c0a3614f1b0da0d5bb7f8ddf6b50c4775d6f7210ce2d3f22"},"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":"104cc6309cc1346c3aba9657e39d4d60a81164aaf803cbee32bb26d6c6a52ce0"},"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":"802eb3fc1ea56ccc589f6951c619ea12720208dd78194c2e71751638a94ac7bc"},"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":"fe14926636fbb0e38c3d124835cce63fcb12422bfcfa96df8f931df29ec1a44d"},"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":"5e0a0eb91f46bae90c3f94384162e02a9c0d17f57cea0c1e1aca3a7000a2c2cd"},"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":"73c6390f196cc63e193921c8adc52a28622a9c5597ade714207ba3a076fbea6b"},"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":"52afed146a359cf733704ea62d70d9fdc769dcc0ad9b78d19d4e504ac6b19790"},"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":"f54228f607d8435356a8fa824f10d569ae01b51b3d4caf0c10d123bb02b0f223"},"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":"68ef22ec6b4f2adc57a6b08cc86e76565c831285102036ab1d91cc8b54a364b9"},"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":"916c9ca5edfb61c11e38c70c36cd46b9b14b542fe070c8d3e0f58839f2a1930e"},"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":"45ac20e733b3dd727086896c9d56e05fb62e670624be7fa951878e6d84cc9eff"},"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":"af4c2d17701492ec0c62e4348c5bfad536649fd264eeefcae58f6866e5ddfb85"},"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":"67843bc274cd1f0c87385f28207eb16fbae286dd92fabac60e09428b9084228a"},"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":"f5e0b7269c26501119d9465e617d59ac47dbfacbaa8cd5dc1b7898fc23a9cc6d"},"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":"36bf71eca47cdedda6d4e85d4f4d377f5c9d6e1fc2af6776a95fd9fb55f68b26"},"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":"44c317430907d60c1cad8a035ec5c50085b6276ea90dd5b43f7fcaffa1c1929a"},"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":"7d064d6b6be0570ca10372d9fd3f795872c0fbd6ff40f212e29d41c99a562e54"},"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":"6a52549b8ac582c76087c21d852a80f1fc658060a24753d1a3675cf79d19579e"},"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":"3735a0d8614baad9fba984d7c104c0cd10db273543ec1272b6214e66c4245de2"},"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":"f197cdfede0bcb1a575d4a591ee2731a5aacfcd6cf3e780eb6d9b5f8241432ef"},"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":"96f38dea7d05fab97def762dfddccb8cdc7f08362b5a3d1bd36eece59eb47ec5"},"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":"6125f0c99823f46e0d4799d645745f4c7c87d3af21fa4b7ed26207258280d731"},"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":"d4417554de5f5e9808e9e0b138199f42e95a88a7f60296eeaa0efc1313346786"},"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":"9386f7517428ebeb8b9336a80c85f0b52f6fa46f20a1feb9612e7ac33f7d28e6"},"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":"637fc9b689eb242d7d5bad2e9e3344ce94fb7f3dc7a2a05f41b73272d3a7b31a"},"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":"f1e85d7a09df03e983136f5124fca1fa83bb490ae1e1d2c389d2946affee0816"},"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":"1fb00706944df483d4dfb5944eea6b6edd02af6f6995db7144fb87104a3c0bb7"},"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":"fe12555fa427da3cc3bd4efa45e5f94ca9ca0811d5fe9818e6fb365158b9eb8c"},"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":"ab8a94067010c30ad273ac5dda8693535fd45572fdebd755b9a1daa9637db3ff"},"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":"9c01743e177857594ef7ea72b874320b755e7b3ae77b5ce0c48f93c9b9d0eaeb"},"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":"2c14520f60f4c7f4eff493755b99d5bd0920570725750755b7090d0b836736d2"},"taxa":[{"id":"CWE-774","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e56b7b83a7b6b665595dff0abb85ed77119b3ffa83fd8844bf182ac47be8bee5"},"taxa":[{"id":"CWE-774","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a7c832e0f6ef6ff44472142464650e3b89c6dd3f974d49d746c8c26bbb11f4c1"},"taxa":[{"id":"CWE-774","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7bcc0b90a6a23407b3e550ddb5d9912104eee7d56e051255bb53ef77089cb656"},"taxa":[{"id":"CWE-774","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0081a5a0e5c6b12a5cee0c766b2cd07438c414f1620d2b17ce624dfb3543c89d"},"taxa":[{"id":"CWE-416","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c677f350d319e6cf364c51795a2ec01c0602aad765341cb6ca225a5169f97148"},"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":"cded31596eb35fff79d94d211536b443a65a88a3a04ef6b11f8a71ef564f97c6"},"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":"81f78dda73fad571b222a7c74714428da83ea415f7e8bea1b1037a210a83c6b3"},"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":"c350c387a8133ada5ab63d1a37984bd8a7e7baf32b5b0b4f52b2aed4176be27f"},"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":"4b14ee415142f419255d09cb7e5970b223d36bf91a5e0a9c5d8c0d45d5e55e46"},"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":"38c561d683574ca48052819793bbcf1057aea2f91bda788cb0424cb22ff6598d"},"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":"bdfb2e8e34cc8af3475c8d51f8e73d334e865e458d970b4ea0d672bc3a2ecebf"},"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":"147e899b2d23d87572a52d1dc5c72b5a86bcfa6e36fd4d94db28756f0b701c8d"},"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":"33a85ba4e9c73bb44f11a42b3d9f624debe21c6ba92148c7cc34d29a1240677c"},"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":"61c9ec34d09d8be11821115c4b9599e55034076065de4326a1f95e26a9c06431"},"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":"4a0faba4c669ae506e15ea12acb917781b3c202548cfffba1e03c4307c5f1eae"},"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":"af661396b2c99494c16ece6a277887f3d025cdd7da646b778d60c96033fa606c"},"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":"9420a314bb433f869e266e9024ab54be4f2c87f24e5941a2e7ecd573b42cecd6"},"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":"6b7debe42f407010c4882e3e5bb39d3b3dbf78494791d216ce15c4dcfbe73204"},"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":"e3c597c87db419ffc5300efe31d1a212a033689ad587029ae7876b33133e4798"},"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":"dc8bbc61dbd4356afc968ad6b09de61991fe5597b0c17fa3b7c5f1d962f9e293"},"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":"639a069a564690d25c2603bf2be6ef2cf0d53dfc8da4accaccce47674e2393e9"},"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":"bad50cf2ce19c5be3c3e86ad935b4e634061b170a44890acf83b8776ce6a56aa"},"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":"fed6ccaef6f74f2f8146ba868c54538cbdae1a8405f0b962480e6500d9eb1391"},"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":"5f8703e6d544b6ce087deff98fb2ac30739f53abd6b49acade1d3e0bb198b78f"},"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":"1651f2224a08673d036037d03d872045585566d0bcf95df4f695e264ad946b55"},"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":"7bb777018e4c3ea4e3442bb1b7e9b087f8535bfd6ffe519e8e109369997d07f9"},"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":"2fd5eb521ed4f335ddec65a4b83324c4212cd0531252eea2dbb9fd86059cf20e"},"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":"043cc028ef139c9864d9307b377ed1b65ef79e0af41c42b905ecd4f57dc5fc7d"},"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":"74eac42614a2e06f234b54966cda4a83a309dd75a66dc655bc2680c1f85e3529"},"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":"1396d0e9340cca0947a9f83b5f219d29020388d56692ef479f4ab48cea223b0d"},"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":"137fd79e881b379005cddf1a19c236d798d90c6f6fd413c5b1dfae57d9cca492"},"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":"4b4b6655e792f9820c122ffa4198232ffd4a7c496453faf7ff553c44b8bf17d2"},"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":"4b4a0402a19f6c7b3762ff1e0e71c56d1b0d7372b6aea5a0789a02b5368fb846"},"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":"4b827929a60fda1082c1a25c26cc7a04f333b351a1a338f1db5f0f13a3d0f6f2"},"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":"4a260fdf8c8990ade035d6688c788ffcedea8a02d3d4b2ae6b8ec33b009f0b4b"},"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":"12807c2aaf8a2e144e2e91a3d089a0fda43a34fe180bbfd62bba821b8fc277f7"},"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":"80960eaac0f5315c5f4a2b3596e6bff04d47fbf28887fc17fc9827145a735c6f"},"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":"9e7baef95c4710a7b3ddda97bae06bfa7d56ab691bce119a74392081ce0c8cfb"},"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":"f9788438cc9d55cc36174a30315780bdc75fa59e652bfdbe90769a612ee934c1"},"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":"c139f2fa4155514746f2d40ab54dc630fbd7f3edb2d54c3091701e978f11ca9f"},"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":"6a92fc412dac36a47f9fa4ecbd2b7c89ad395f98042461257921192536e2e365"},"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":"318a95025cf2c05316f9289d80fb20a8322f1b2475237b09613a9dccbff22a86"},"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":"6fb1f60b52e56ca07921470af050b1a70a5f126434793fb1871b73ce086ea73f"},"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":"c94eda9a57935b2223a276c45b2b90f871a1fdc2120d7d99090a737ebab16baa"},"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":"572be599f77b9a21ed07a3eb197bc4c1dffb0df28996aafee6d7895eb3cc2897"},"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":"0e4ac80d7642659a026b1d4d489725c14b156f41f548574b40f3f12e9218d5aa"},"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":"9335631e056c3801fdbadfc5c6232339199381f61324be24e30f9969b1bf51a3"},"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":"616a09e24704a2032f196c8d5bdd918171291a3fc42801687a051b816d004157"},"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":"297084cc696aa47add1b1f01a99c109d9eeeb04710610e2bf4e0800650eca5fb"},"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":"9f91654eb1592a7c58ea507a594a483d301da344e68a801552875e92e4f26ed0"},"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":"732a14668dddb55a965f8d64b50693317fd89d7df3840582546fadbda21346d3"},"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":"9bb55ea4728bcdceb20d7e3c88d2f34d49709bcc4ac5e0ba3c958e7964904b06"},"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":"50694fcf105e1730ccc6e1c9eb02622e02dde78b3c8c58c619b73bd32134fafc"},"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":"eae023353557a9d147fb76b12e9ea0a06498a65fb8dae3f20cee146a7f0d34d2"},"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":"2ed8464d0c9d9849379d232458df77cf66fa0aa24e0db02c86c244c3ce4e5ca1"},"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":"d094faabfdfca1485352b3f4c470cff08c1b3de3249126a197df289329f5ebc0"},"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":"caa4ed64efb6383d198399f75ff573eb399c6355dcc3769660b56873d8741a58"},"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":"065a4f9fa82d4f588b34f9d1836200c9f5cee03437f7000d03eaef926dbe4e21"},"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":"d0832ed80cac89ccb1a559db58f435a93c67f72889ef2de2e80be385671ef32b"},"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":"5b1a96046ea964ec7023c7736c69a57ec6e3fef0ab6bb21f3f6c6de69eed2e84"},"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":"25ebc5c34a512fd5e9f8d9ff63a7abe829ef13bbc9f3cfd13fcd17667a067f5f"},"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":"6e9165ee6f75ae29e05deac65e992c94dd72291dd9dd0669a11a1e48add8c926"},"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":"537208098a3025b17b66ad78303668f54abd34a9929d22ef775117d7e11ba9a4"},"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":"b4f45b911463f7193619b2d80cc7a918bf5ece6e3c80858aaaa2b039d765f6e0"},"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":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1717f9cdb130c889d57c139b9304445d0029b6c8c173d1910f2a9afa03ad815f"},"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":"6f8938d9316bc219e64bd4791c967aa93d0848eca84309d84d418fd6205678e3"},"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":"68b185b855d07dfd8c2b9a56be35e387d64139540a3cd2ac9db4d3691b74e1a9"},"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":"e825413beefa60092bdd82a6f22bace774a498d2166604b6d1241f145ce8000f"},"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":"c32b26fb264c81abece0ea4014ae9ccf0e66560878755ebbf3ccc5f99648f506"},"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":"66eb0eaa3dafae9034b783d7b84dbc681619eedafdd68426b95d0a175e83e106"},"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":"652373cfe63b37ae192ce65d3068a0c8ef30064baa853bc65b458294ebc064ba"},"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":"b13bf072594a6be4c519d06452f5406f4bafc2ee0601fc85489f31a09cf8d0db"},"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":"8fd6790f6fa557f1f720adfd0af1ef200fd7e00f701c67ff8f41e3d05e2b3ff3"},"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":"ea5bed24f857609733a3139e90d72a2476b13cfc0213f15be1042947a1c225db"},"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":"f5375d4dea2261809069fe611a13edb790e824acd4d0a727171d6bbb91435bc1"},"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":"b801df5685b13f630a8b6534249c887330b7eb5c9e8df2097faf737ca90c03de"},"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":"2ced76013759f3ef030071fa856de79e670190c91da6875ad4d87fe7d87d1ff4"},"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":"6c376fb8990ec320d176fc7fc036c28f2c2a0a3c628eceb50fc92c0afbc1922d"},"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":"84e13658b54c8903640544239b071d9a512e6cff0ce177f86d89a89744e7e5bd"},"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":"edaea104881dc73232b924b681c8c6a023777d90f6d86531f1ae6e15d13b40b7"},"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":"9ba146049e0baee7e35fde382e78926cc557fc45652224c107bd97512cf0494d"},"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":"15365ac1dec61b7165654b6200779c567c83f47864ad8cd4d7f67c93ef0cdbe3"},"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":"713120be144760134b63dae1b660691a2838f584db301564aedf6e857b34fd7f"},"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":"efcde7614d3a38f516eb5247281185b8fccec393a7a7d2419324939f113afb06"},"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":"d17e13c0d294d31c690d924d440e7383116bb75d75c733ff9ef814c53c11c107"},"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":"37e38b7c8e5f95b8a8c9c08633b0a26cb17c9abe91266ffb2d290b2ea9068004"},"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":"2af0cbd98d76389f4ae0d18f27be6b7844bc76196059b582000cdda6ef20defe"},"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":"d3dfe72c348c28a5e5cc2bcfb218911cf27ec46d09dd5e13fc0643787609c1b2"},"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":"4e68f73f82fecb6aafa773c236157b9f1806d46330a666a90d8171f920cc7bb8"},"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":"7db9fb4f4ac29b95acf5a64c3431269113cae257990efe8484996d6d018c9765"},"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":"d46bb4176140a418d9338886d49326beadc39e616eca2ce5b5377b0182ba8610"},"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":"bf69f3e90c95049d280052f84844a95eb99af4560d16cf18929978c21185f43a"},"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":"afda78a718d23a04401f12ec6aabbaddefcd147d183e933ecec96d1ed194dd07"},"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":"2569cf0525fc817e9e503abf057027ab640eae2e6654bdaf866328dc6495bdee"},"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":"e60d2a4a9232909a7c933c643e61b3121bce9ab8d3d2f72a5c775a16d69e1870"},"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":"3c61a070393a3ff390e036d445465c751d889900b6e3d70cec382fa8809d79da"},"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":"fc6f620a826da44695d1cbbd383211e684bc14462bb5f2284d1f42cdd42be359"},"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":"adecf6483b3ac0fc0b86af758f036feac247f50c774d24d1a449c44bec2c92b7"},"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":"57c293dccbd8567b6cec7cb070e785bc7dbd3ad6e93ab2897522b737466e68b9"},"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":"686dbb47b39c49db34ce2eb5e7eb8829589b4895e48218b0259509b9a669fd4e"},"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":"15160901e76ff25aca95d0490d8fe392457b7204e614214960498d878680567f"},"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":"3f844b845e6c33a9c7ee18b02a14b1a137ac1d9cc842ab08ab131e780a3eb52c"},"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":"6a30ee1a67f989b4e26cdf965678f0d0954745444f0aa11ccab4b2622ace29fc"},"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":"8a6601ff3c16e7f9ff7a378f4a79ef3eda1b3ae6f8281d0006e1967bfb234e12"},"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":"fb2fffa7dd75c56f431de946c36e12709122bce69b82a62353c8d553a621b813"},"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":"1410a06f5578ded55e21354c0386d25f2b0537cf1dd8f171ed7314341916472f"},"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":"699d77bd1339541dfdbe3a05bd5354034874a3303a0d932f989e2c7fab8da498"},"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":"253b39c42280ca0177f986a83e92cdf1d66aa39c8637ea412574fe55add502d9"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05213e96e6a577234f8446180762a68e50a4dd4392d69721b7d7447ef9f283c5"},"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":"1a1dc1c41203c18be16e025a74c8d28cca7c27de9df5202c4cc59db9847fbd62"},"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":"1ccad4ad76511a5de2b8d24b85b0aee3bb3fbbe620f78f4137e481ae384b7dbb"},"taxa":[{"id":"CWE-328","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":"81fc0f8bf2c61f9a81d5ea1f1b65629b3f319a83ac5447380a6d39b057f31581"},"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":"534a8a2017ad47224e80e7d51eef4b98bd9f96b868a8f8606b5d3c9f2d388c57"},"taxa":[{"id":"CWE-338","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":"ffd65dff3820ffdcd55112c6fc9900bcb2d71296296c7d60bcf975cb79ef6496"},"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":"32aeec6b6a9b90c4a31a486e06bc0d378fb2ba74dab70cc09d08b2194cb76426"},"taxa":[{"id":"CWE-22","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"97c513e9a694cb2a1c9e10c9a0ea23161184f9e62e54e64327fb89b582d893cf"},"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":"de02d639e3bfef959756bcf24898f3340c40af46271519951fd23f615a83c805"},"taxa":[{"id":"CWE-22","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"f95f5524b235795bfe840b5b5a76ea241ea933eaa3eba5fd9e2a91a568e2f7b0"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fe6827bafcfb83d8e03c2716a1eba29fcf328e315813b5d7dfad43750487adb"},"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":"966799940dcafe871efc7f7dee19025a2c032af9b850f00ba39da7bee146851f"},"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":"ce205cbc21e8ddd7a5dcebc1b9d79468db66405afab98993cdbc49873d98e78a"},"taxa":[{"id":"CWE-327","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfed141f490d11f916173ce5424e9a503457298a79d1e32c9fa9c6d2d3928a1e"},"taxa":[{"id":"CWE-338","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":"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":"5bd39c8547b37b210b533cf53b45c16ca7323ff5135803999b27f3c231f0956c"},"taxa":[{"id":"CWE-242","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":"236a4e32dcb0296bd53bfee1c9ce33a0890b975dc6f6f30bda82802216a58172"},"taxa":[{"id":"CWE-242","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":"45e2eb9bee598a374fcec5f2373705c8869958d5dbe742f36e824dc5ef377f6d"},"taxa":[{"id":"CWE-242","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":"c63ba453087fde15073089d4cd6ae0fce34aa8ce56058a66d3a026999cf3aa0d"},"taxa":[{"id":"CWE-242","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":"2a4fe79f26daad9644c7e5f7d83d125b4bf7117dc2e76596da59b56bd8dcb737"},"taxa":[{"id":"CWE-242","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":"0599abf674b38e4d1f67d7e85216a6289af883e64e2d9d0b38513b9a843cb611"},"taxa":[{"id":"CWE-242","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":"57843c5e5371cc0a97a1de2516de7666156e9fa744e08506ae76d950f983d21e"},"taxa":[{"id":"CWE-242","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":"2cc2797a6b689dfdfad2a7cda195f146aa443ac5bf74e9f1d8063ebcbd122aa2"},"taxa":[{"id":"CWE-242","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":"85fccc92d520c9de415b199c7c9259370c7f4d32d54f27a3e726b73042c26148"},"taxa":[{"id":"CWE-242","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":"d4e3a8217365d58950823b36dc25f6274bb3eea0ab58997926c8d3e1ce8fdf59"},"taxa":[{"id":"CWE-242","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":"369879e44845f94b69620e0c6f085fdc3e20d666a76eff75c7cec1f046ce3cd5"},"taxa":[{"id":"CWE-242","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":"cd7456e0c1f738cda1e90f57ace0f6a4107a244401c4432259fa8d188b15ad97"},"taxa":[{"id":"CWE-242","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":"579c4d2fdb62aec72aab7796e8d12252e414799e2fed5453c521919e9fdee343"},"taxa":[{"id":"CWE-242","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":"4cc5e06199d3695fd55d499d86fbc1434cf93f9e302ebea35dac4530abbd2784"},"taxa":[{"id":"CWE-242","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":"0ba41cea80f1ea7e8d083016011831d4a1030dcecdf879fd68a1750cb94b90dc"},"taxa":[{"id":"CWE-242","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":"9b1e6f4d0f7395d8b09170a95b8569d007632e123c1d2fb3e867914e2d7e543c"},"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":"e28b7e50cee49b747da2212a65fa4928c49168d476b488211c20eb4f008ed369"},"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":"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":"8edd85248b7d86b72d7d5a8b8586f307797f18849c631b04c0fca1398c02acea"},"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":"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":"26a8736e20b298f84819ed789f316ac38971815774f8eb58ece42380ae877fb5"},"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":"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":"ccc14677d0e7115a955b228983e1cdba33442cbc3d3a26545b61ea246221d389"},"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":"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":"bad9930da4a00b8d26d48a2c113c50ebc768e8800ccba88cdd8f65625afb93ed"},"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":"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":"cae38576c31846aec7b57dc7a856752c51fa643b77540f62ab25c853e1dce92b"},"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":"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":"7f0b4080e9eabc5ec06a88525a12c23b88017575287dbcb0ca217a60a40f2f8c"},"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":"a8e704f23a30e004b132e225260e2ea66dbe6c8e1571c38e6121c1a291ac0613"},"properties":{"dependency":{"package":"activesupport","version":"7.2.3.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4bb21bfe4dacebf32c74969b01bdfd4143dcc202111d99f8d1abd5eb6de9eec2"},"properties":{"dependency":{"package":"SQLitePCLRaw.lib.e_sqlite3","version":"2.1.10","advisory":"[GHSA redacted]","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5eb7159f20ea5846ba7b91c2d4f597a24a2a719a878bf372026bd85d040e11f8"},"properties":{"dependency":{"package":"image-size","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8710da57ff8bcc0b96bd06d737481aa3a4ae1f0c06aa9db9f5e0662837def61"},"properties":{"dependency":{"package":"body-parser","version":"2.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ffa73e9f0c983197ba684e023f2a3c6e8cfda20bd21ca9c1f20a2845b7e5539"},"properties":{"dependency":{"package":"joi","version":"17.13.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"938f7aac03b1dbadaf31915facbc7ef9eb41e7340450ddebf2210496e9c2c6a0"},"properties":{"dependency":{"package":"zod","version":"4.3.6","advisory":"[GHSA redacted]","aliases":["[CVE 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":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.98","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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","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":"904cd12f65d71ca63d739c739b4c100bf718e7d129ce5630aa4dba7fa6968b6e"},"properties":{"dependency":{"package":"bitmaps","version":"3.2.1","advisory":"RUSTSEC-2026-0247","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":"ab113f4511e48d081edf02734f13997952fa6a37abe69cb57e9ba1799ef70f7c"},"properties":{"dependency":{"package":"bitmaps","version":"3.2.1","advisory":"RUSTSEC-2025-0167","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":"ca383df8f93c1fcb449201c7c47b9fc487e55acf31a9bb60212d29fe36dde189"},"properties":{"dependency":{"package":"block-buffer","version":"0.12.0","advisory":"[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":"c4a0c58aca13bc848c37d4c3d5bcb90f8e046f8df5b386f5a3743d0625ad8dae"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","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":"109eb8c2be00952287a6643744da7dcc2c9a7a6618d7cac60ea6539c1687dfd6"},"properties":{"dependency":{"package":"ctutils","version":"0.4.2","advisory":"RUSTSEC-2026-0385","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.12","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7b3f5e73f54279d8a385f3ccb6ce6659725cab3121019062bfd36c6500f66d85"},"properties":{"dependency":{"package":"libsqlite3-sys","version":"0.35.0","advisory":"RUSTSEC-2026-0459","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0502"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.16.4","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":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.9.5","advisory":"RUSTSEC-2026-0186","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":"705e8761c5e609601c0419d94a8bad1aeb6aee434f48ec4660c92e8bf534c9de"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.17","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0340","RUSTSEC-2026-0343","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.14","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f33134b914692cd6c5f119efdf542f3d6c34c918da971c9cc600e5d39c46efde"},"properties":{"dependency":{"package":"rkyv","version":"0.7.46","advisory":"RUSTSEC-2026-0235","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.0.7","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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29657cae34dd8cde614417a5e63194c90262d7543de5763d566a22c44f87c6e9"},"properties":{"dependency":{"package":"scc","version":"2.4.0","advisory":"RUSTSEC-2026-0205","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.47.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":"2b5cc6a78fe02a95b2f6755616011982ae866dcba8c2aeaae7b037f36ce19be5"},"properties":{"dependency":{"package":"unsafe-libyaml","version":"0.2.11","advisory":"RUSTSEC-2024-0449","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.7","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ceb9040e13548b3df718b94867858f8e5659519eb178fbf2fd0e4e23343e0da"},"properties":{"dependency":{"package":"yaml-rust","version":"0.4.5","advisory":"RUSTSEC-2024-0320","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5245aff38cedf62f5e5099eb1587f1673d8a0eceb08a205ad1a41da122a23294"},"properties":{"dependency":{"package":"stdlib","version":"1.24.10","advisory":"GO-2025-4155","aliases":["BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"bindings/go/driver_db.go","line":626,"symbol":"url.ParseQuery"}}}},{"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":"4df9fd18e03b2ec0c7ab62d34a6480d9ef487ca0ec0535aee3c235e94a8e9987"},"properties":{"dependency":{"package":"golang.org/x/sys","version":"0.38.0","advisory":"GO-2026-5024","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":"ec25c8294e92899f62ec438528264fe4f6adeb85a557aab1d7a5f2b9a0e37c85"},"properties":{"dependency":{"package":"golang.org/x/sys","version":"0.38.0","advisory":"GO-2026-5024","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":"b2066dc0c9cb1cd5f9a29bc77e82c78e54d2fdbda39cb6dcea4894e07650656f"},"properties":{"dependency":{"package":"golang.org/x/sys","version":"0.38.0","advisory":"GO-2026-5024","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":"bee28f496d17fbd90ae8232884c0c2fc9a9f8cfdac1d953de64ac8d3242d5066"},"properties":{"dependency":{"package":"addressable","version":"2.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"4f50d2b2ccb0c5cf4b9da84b93b1efc6590b14a953c56d01aeb0593b9590605c"},"properties":{"dependency":{"package":"stdlib","version":"1.24.0","advisory":"GO-2025-4155","aliases":["BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"serverless/go/driver.go","line":145,"symbol":"http.CanonicalHeaderKey"}}}},{"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":"3ee5faf5dca4324f9dad0687211eceaf0c3676563dfee58922d45c9b81b6e538"},"properties":{"dependency":{"package":"stdlib","version":"1.24.10","advisory":"GO-2025-4155","aliases":["BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"testing/stress-go/main.go","line":376,"symbol":"http.NewRequest"}}}},{"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":"57098abecbd4990ca287574460865b3bcc40cb3674813e8e4b23fded516bc3a0"},"properties":{"dependency":{"package":"golang.org/x/sys","version":"0.38.0","advisory":"GO-2026-5024","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":"dc8fb1a5fbb5c7247ec8cb8e39542b45d769302fb321c5f2834d3d38b60da1ff"},"properties":{"dependency":{"package":"golang.org/x/text","version":"0.14.0","advisory":"GO-2026-5970","aliases":["[CVE redacted]","[CVE redacted]","GO-2026-6629"],"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":"12eb4279b785b98d999a0fa4a99c809dd24f1bf0e233325ca3b4e8d5b2f551fa"},"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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b50dad4c894a88be5b3bb8e20bc2d02644b688f1d1afc3ab6889dfbcd925aedf"},"properties":{"dependency":{"package":"node-forge","version":"1.4.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA 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":"fbfbc09c028126f4bce6c5cc1aca7a7d5b59dcd3a510560ea132a2974f707275"},"properties":{"dependency":{"package":"glob","version":"13.0.7","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":"f87bd8d2b2bc8642ea695f3f5cdec9bafd301cb34f40b3b5e945dbf113faae08"},"properties":{"dependency":{"package":"deepmerge","version":"4.3.1","advisory":"[GHSA redacted]","aliases":["[CVE 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":"1910cd39a1a57392fdb9b6de245964080227a955dc5e25746ad7c10d04235921"},"properties":{"dependency":{"package":"fast-xml-parser","version":"5.11.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"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":"840a99498fa612e174803b3136237daf1999e3946d01401ebce356f08defd292"}},{"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":"509f3f7cf2a956bc7d7d9184ba90801af6a29335b6e53f143fa47c2cab578d4e"}},{"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":"80b222aff3f4f90e710d9401a599950fa6a9ea0c8d984ed9f3eb65d6bc9f7f82"}},{"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":"1d2646e03f564a062336b42012d3055da1fc9bff1db60e0896b93258900fe575"}},{"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":"2e5e3692abb3ecdfefd9cfda998049b75e1c737849867d5aa36940085253ffad"}},{"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":"9b27e59f8f6fa0ea2f2e4ed9a37565dd24cdec6a0c35ebf8b98c2d7abc18f837"}},{"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":"8a1d1cb94bce37cfe0a7959bf957100d7dc95b7a7516004b57ad26ae4b1f921d"},"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":"d26061fdb838fe47de72cc21e24805291b43cc0a2701668ce3853a33efb64daf"}},{"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":"ff05c652acfd77c31d80a09b1993e109930f00bad38ae2a266db713263a6e974"},"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":"b5f1e7377791de6aaed165880f32920532ba032900d59d3f68d2af137c672141"}},{"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":"2e910934653e100f5925cf05bd3b43432a47c469d438f818618f970911a2e136"},"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":"a91d60d44951f467100ea31a74f2675730c87c281d2d32835d0c604ddb0a9b59"},"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":"3501bdd82394f0409b81d7eab8dd7740b4d872c24ca62eed431403bc07e9c5c9"}},{"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":"cff1e74552469c4625cb75232e8c44a5d6596a6a8d3627a69a727bc09f3a0748"}},{"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":"08e94b7da34a1a8f03f56bdb886c6050c61251dc3d8b12c535855df24d2d18fe"},"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":"d4aaf864dd6bb342686c0daa6b6e180aaaa2240fb233393128b9b1b197bb093a"}},{"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":"9e13f3346f4b7f91b7305b6c2d1a4473d1d84e934800a051996f541e07d94296"},"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":"278b66687e905668ac85172924035de64b0372d1723ea1bb98e0bbc088dad650"}},{"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":"5c305ea6388a3e698b82980ac8c20d25904f8cc0ef556f312506b665c81c09db"},"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":"ba1d0f03dd72c48487fdfb259d48c9bacab9c280999c9108db8cd0030dc3a28a"}},{"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":"53536858fe62c136833d9f1a7b22db9ba91ccc3eac0f5cd92e890ef3cf8a834d"},"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":"0d6149a108df7e8d1b87420f4ac3891a8ee70be567619109bbe7f52ac3709c46"},"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":"c3f9a4b7ad2a0ba116b93107ef61828f6c04498fb44ab0ec6bbb06a3c2742768"},"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":"617f6a75d52a1a21eab2083ad73994e48c44d497ba61b5074574db5c020f33b6"},"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":"04b269089c6db39140a5d455b5b9993138bd6a5830052b6be44471e3cd5399de"},"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":"aa8c08318f83d8533c8c88dfb87824658b8f77978b2fefa396012c6d59e50901"}},{"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":"cfa8910bf6d4ac8c10553e4d7b2ee419bbaa8677aa3faf1c97fca58917c051ef"},"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":"de9990fce2b449fc090cf98b2834edf5b32fee569b445dc9cb764f7b7a37773a"},"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":"07af904213350aeb53798abda7de7b362e2bbef1a1c410a3f6ed48d56dafbe71"}},{"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":"ac9c07dee847bd3ff0704507ffe0a358d88cf60100088e400fbbea2efdd3a630"},"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":"0aa1c913702792a31d84e07c22111291ae53c0ffe9c160cf87c14b33990f7117"},"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":"f0630f410606b290b5ba72582e5ccd01787874347c5192d4c39a722e0a75719f"},"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":"39a3e95307774763766a32d4c4b3e4512be425ba4deb6fb93d6605f181d5fbd2"}},{"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":"914abd5ec82f5e56939b8871b5eeaa2742e6d6b5dc983a9f9703e9cf3758161f"},"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":"58bc157dcf8a6e55e05384db1c14cf8894b9393205c015e3fdefbba10d44f270"},"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":"3b1568673c97a5ce9b1ec5a08dba083d705b7ca92047378b6f33333438b27491"},"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":"3260ff93174f49ae10f5552a0329814b77c91960ca91a54cd36b784f53bff409"}},{"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":"cd1e1916692d4d5f458efae18df368376314f217f352881cf1d4fa6cc083eb6d"}},{"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":"71bf0e7f35c3bef929185fd83d8146bbf0590e965986385a0444bb41733fea23"},"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":"008825ef68cc2841fef33a3f9f8acc7739daa939baa31b940b7e22956bf1813d"},"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":"a0253cdb433485d93f1259fe935cad7c5df0486a99bae72ae65dbbacb158f6f3"},"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":"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":"c8d9e8dea76346a025fdfc27902d6a3e52e59aed79f1cbb538da7ca7a0cd5179"},"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":"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":"c8fabc3976c8b044562b70ba3683fad9c3470ac613f97d07fda341fdcfa04d33"},"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":"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":"05836be219829ad71de843a69bdb2e4939172177ee15ccb3f18c905ae68d2f85"},"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":"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":"387d5649f28d119aebda802435fc0679e9960949a66f24cd3651dcbbc3d9c7ca"}},{"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":"598c21d412b05c3e65d84272045d9c603a81aae12d483bd5d163500998ec8546"}},{"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":"d42c284528ee342f39dbfb4bc6a626ca7f028de54c8c9b7bdc5f0bcabc7d47e3"}},{"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":"83664dd18fb647a5d09beb54007168276b2042438d22cf7f7bbbe04760282199"}},{"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":"extensions/fuzzy/src/translit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a173bb6d5a3f477e80d2484c07b7f3974379d3738d17709c05283fa48bbd2a"}},{"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":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a958461d55b0c8ba14811696877f7b77c573da7331fdbdb5c18bb2afdcdfcc3"}},{"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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4DatabaseMetaData.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a210e550714cfb27027ea058351d19bfe78d691beac9bb1a07ed526bb8b2d36"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 23 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: bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java, bindings/dotnet/src/Turso.Serverless.Client/TursoSession.cs, bindings/java/src/main/java/tech/turso/jdbc4/JDBC4Statement.java, bindings/dotnet/src/Turso.Serverless.Client/HranaProtocol.cs, bindings/java/src/main/java/tech/turso/jdbc4/JDBC4Connection.java, bindings/dotnet/src/Turso.Serverless.Client/TursoServerlessConnection.cs, bindings/java/gradle/publish.gradle.kts, bindings/dotnet/src/Turso.Platform.Client/tools/OpenApiTitler/Program.cs (and 15 more) (26 orphaned of 746 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; 746 of the 977 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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4PreparedStatement.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4631633e4fa55c25230cbc114f1908a3eb63f58c28d7f327e3875c4814aaefc0"}},{"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":"bindings/dotnet/src/Turso.Serverless.Client/TursoSession.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"598f9110c9f3dcc6142d7d521a0f95c87f931fee58544e153d5e15bf5ee51f8b"}},{"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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4Statement.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8148d7993c7430dea6189f1bd36565e2cbd3bd2bd19c5510f80d2afdc659ac4d"}},{"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":"bindings/dotnet/src/Turso.Serverless.Client/HranaProtocol.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d729243eab19e4ce6b2594a7fddecf6628f8062b56b8e30ba247175578d6d508"}},{"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":"bindings/java/src/main/java/tech/turso/jdbc4/JDBC4Connection.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfdf96f976ac195e8f62a4433e1fbec75a00f3c5f6b995f62b3bf3cd85a098f"}},{"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":"bindings/dotnet/src/Turso.Serverless.Client/TursoServerlessConnection.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed84edb7c5e16e724a813b1c28e9ac5df9e41f4ec12f19a24b14934f019d978"}},{"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":"bindings/java/gradle/publish.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"221b1c8ea5d685dcc4635a4cb660070eb9c0f37c363ba09d8414a3f0ec7367de"}},{"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":"bindings/dotnet/src/Turso.Platform.Client/tools/OpenApiTitler/Program.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"525d78b9e483cc8a8c2823427eea2e6f01ace4074f1eb20265404e82b9442a5f"}},{"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":"extensions/fuzzy/src/editdist.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"796a9e612c4b546390b5c913835ce02ccd7c4f918c7361ff3b983b2dc80e4409"}},{"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":"bindings/java/build.gradle.kts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5a7ae43795eaaed912730b668bad6090f9618ef8461190da0100a6534e94c4"}},{"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":"bindings/dotnet/src/Turso.Serverless.Client/HranaHttp.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"820ecc0ad752b857b9ffc202bdaa346cc84fde7564254f277f2fa49a6a66329d"}},{"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":"bindings/java/src/main/java/tech/turso/core/TursoResultSet.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d17835e9fc23b9a1a84510b9fa890d5f165af1e1e64baa2196cd4e7f8ca6d5"}},{"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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBlob.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133c83c4827076bc0433a898868fed5bc783a96fdcf99f32cd7ba654796e9608"}},{"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":"bindings/dotnet/src/Turso.Serverless.Client/TursoResultSet.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52719b4ed9f8b1825f2c900c1611b6d2899dc79972855a9ebfb971632b5d9a2a"}},{"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":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Update/Internal/TursoSqliteUpdateSqlGenerator.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbe6f5a1e47bf50851cf0c0cdba69ff7677739af2e728da8e6fa21e160bc699"}},{"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":"cli/dot_command.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dbc41ecf9770c2bba550b770fdc229e10af40189175ab1cafa3b82b5fa810c"}},{"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":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteParameterCollection.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6de829656dd21c3427f5ae94eb3ccdecfea07a2269816fa1e43b5b7ff809834"}},{"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":"bindings/dotnet/src/Turso.Data.Sqlite/Properties/Resources.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"773e7ff8ad877b69e43d8e1eb2198c800ccf0fba38440c5003eb1f84548ab266"}},{"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":"bindings/dotnet/src/Turso.Data/TursoParameterCollection.cs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9058538c0bfa524b4490b0c3e6ddfdde78ad0f75e687206b12dcb1b44dcc8c15"}},{"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":"bindings/java/src/main/java/tech/turso/TursoErrorCode.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7718cd792338afe8c90521ad78921c6e294bae51cac15eff4d44c65f7d09260"}},{"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":"extensions/regexp/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"009f4fec1092b25e5cc36e3eb61680d38074b465e23f728d0f5c3c336341b4ab"}},{"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":"bindings/java/src/main/java/tech/turso/core/TursoTransactionMode.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a98fc12979d08634ac7ecc16d4502703e2a3638acf82d19c947af087dad1b4"}},{"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":"bindings/java/src/main/java/tech/turso/JDBC.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"205a844e293812a3fd3884b02689baa47af5ef7255347160f94e402382d268e1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mcp_server.rs \u2194 fmt.rs: \u0060cli/mcp_server.rs\u0060 (context cli) and \u0060sqlite/parser/src/ast/fmt.rs\u0060 (context sqlite) sit in DIFFERENT parts of the tree yet change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006072994fdb\u0060 postgres: support CREATE POLICY and DROP POLICY; \u0060bfb83820\u0060 postgres: store GRANT SELECT in the relation catalog; \u0060be1ae01d\u0060 core/schema: introduce relation change hooks \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/mcp_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"228d5c8a38b2e716b023270359af70a2b12cd63984126edca3268f5ae32975d4"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lexer.rs \u2194 mod.rs: \u0060testing/sqltest/src/parser/lexer.rs\u0060 and \u0060testing/sqltest/src/runner/mod.rs\u0060 change together 67% of the time (10 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006021cba21c\u0060 testing/sqltest: compare the SQLSTATE of errors with @sqlstate; \u0060d91a4bd8\u0060 test: snapshot parenthesized join bytecode; \u00603b7441c3\u0060 testing/sqltest: add matrix test cases verified against a bundled SQL\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/parser/lexer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae2b5140ba8230e7d30630ec88ea24bb6d38d514dadd080bade02df4edd2a6a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: lib.rs \u2194 journal_mode.rs: \u0060core/lib.rs\u0060 and \u0060core/storage/journal_mode.rs\u0060 change together 56% of the time (9 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060b80c92fb\u0060 core/mvcc: gate more stuff under passive mode; \u00600087f04c\u0060 core: allow custom allocator for MVStore; \u0060e20e71e3\u0060 Fix ROLLBACK TO restoring row versions but not fully restoring tx-loc\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b5436ab1c1d62725f637f040ecde47f55e507dc838aa9a603b395c7a559e43"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: delete.rs \u2194 update.rs: \u0060core/translate/delete.rs\u0060 and \u0060core/translate/update.rs\u0060 change together 54% of the time (25 of the 46 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are \u0060510b6fc6\u0060 core/translate: apply row-level security policies to writes; \u0060e2311e55\u0060 core/translate: build the conditions of policies per command, as Post\u2026; \u0060f16b1fd8\u0060 core/translate: compute a policy\u0027s scalar subqueries once per statement \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/delete.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f2f0218d226345eee1597123e434cc8d7c6e84564de807d36f3849f4874355"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cli.rs \u2194 rust.rs: \u0060testing/sqltest/src/backends/cli.rs\u0060 and \u0060testing/sqltest/src/backends/rust.rs\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006073afdead\u0060 Make \u0060WITHOUT ROWID\u0060 support experimental (at that commit the files were still \u0060testing/sqltests/src/backends/cli.rs\u0060 and \u0060testing/sqltests/src/backends/rust.rs\u0060); \u00604ff9617f\u0060 tests: enable vacuum in sqltests backends (at that commit the files were still \u0060testing/sqltests/src/backends/cli.rs\u0060 and \u0060testing/sqltests/src/backends/rust.rs\u0060); \u0060009c8a9b\u0060 Remove experimental flag from triggers, enable by default (at that commit the files were still \u0060testing/runner/src/backends/cli.rs\u0060 and \u0060testing/runner/src/backends/rust.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98bb46ae6f67deecd74a1eec8f0d06fa804c3fb57f94d615bcdbfb1663ac118"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: fmt.rs \u2194 parser.rs: \u0060sqlite/parser/src/ast/fmt.rs\u0060 and \u0060sqlite/parser/src/parser.rs\u0060 change together 50% of the time (19 of the 38 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 19 shared commits counted here, the most recent 3 are \u0060bd4ac33d\u0060 postgres: check the TRUNCATE privilege for TRUNCATE; \u00605819f3dc\u0060 postgres: enforce BEGIN READ ONLY and READ WRITE access modes; \u0060b30b1ee1\u0060 parser: parse LATERAL subqueries in FROM clauses \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"sqlite/parser/src/ast/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3229566374415474a8426dcde83af31f5e1422c5ab497d2870fed526fb34272b"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: connection.rs \u2194 journal_mode.rs: \u0060core/connection.rs\u0060 and \u0060core/storage/journal_mode.rs\u0060 change together 50% of the time (8 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060b80c92fb\u0060 core/mvcc: gate more stuff under passive mode; \u00600087f04c\u0060 core: allow custom allocator for MVStore; \u0060e20e71e3\u0060 Fix ROLLBACK TO restoring row versions but not fully restoring tx-loc\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/connection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8d7e03c9194551e88455854ac85722a5379c11119e0b5c2b482049170be435"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mcp_server.rs \u2194 util.rs: \u0060cli/mcp_server.rs\u0060 and \u0060core/util.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006072994fdb\u0060 postgres: support CREATE POLICY and DROP POLICY; \u0060bfb83820\u0060 postgres: store GRANT SELECT in the relation catalog; \u0060be1ae01d\u0060 core/schema: introduce relation change hooks \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/mcp_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bad07b2acc5d95afbaa6f7ba88d15bd7d74e09c41c974b604209e624b51afea"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mcp_server.rs \u2194 mod.rs: \u0060cli/mcp_server.rs\u0060 and \u0060core/translate/mod.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository\u0027s 10,000 most recent commits rather than its whole history \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006072994fdb\u0060 postgres: support CREATE POLICY and DROP POLICY; \u0060bfb83820\u0060 postgres: store GRANT SELECT in the relation catalog; \u0060be1ae01d\u0060 core/schema: introduce relation change hooks \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cli/mcp_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bb1e5463b5c0b4b0aa932b2d56d484200c2b781e6f2e727c2461d8299742b9"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"23242335439540a7f0752c9def5c038b557d1cb0f8e6f7b448b5f69adcab3c1d"}},{"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":"334eba97a492819a73f1bc2a065b89608d821da99f390030204d0026e461411b"},"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":"c4e0122ff5e0b635bfd8a95820cb60011186b5f24c36a516d1ceb8dc8bb366b0"},"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":"27a7a0cb2454ce0ee533168e6eefee92566fcdd50660fdc65c8444b42c7c163f"},"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":"6325a2848e2b4f3c731e245a83e76ee9f684734a2e8420a0ba78cd9509485be7"},"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":"2db1a1b80b792ef85406835cd58dca6ec21a4e74d4359b5e2c199e9be95b3e5c"},"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":"bf771b21e3b58bc52e0b53c1fd3ef001293d7fda2b1cc74ec7d8edb8611899ef"},"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":"c40dbb8efaf8852d3fc2babbc615f89dfa1503cf977e13cae96a33bbb8b51720"},"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":"b16d34b847e5749707d827b2176881c57a843a3f69413591c0d74d4f572630d4"},"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":"9688113b47236ac591d9289469d37df6f51233cccff470e68d28aea36504dd56"},"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":"10f11c8d728b257f2ba20b3371087ef408805508a21dd7835123117a23d06fa8"},"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":"2eb00cac7acb7bdd75626b2e2ccd015d00dbad555323fe33b10c212db0970858"},"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":"00a2e1e3f278cecc95f5ff4da11abc4d616cc5f9e4d203aec98b3c7730732afc"},"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":"7d21ee86e15adad520ecd59225a97c31a1b9e3b2ea3e1c5238912bb9e1c846be"},"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":"0c0b68a0ce07f1147f820aa7d947a9fc68488736c838db9ef79025fcb0b60581"},"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":"ce302dc7797048423f169ce6aa2e6c129aa86eb04258e2700904e66b8e4388b2"},"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":"8d53820db4f8fa0936afc6bb90284008173570201e8039d67e267738908b9d21"},"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":"1b3856dc48c94a2ef2fb1ec98294eb281aa479096b2de4ad945576786b374c23"},"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":"42173afb9f1eeeee5f5731ca1ce0f516d4a62d8ab8f60596e965af0029e35332"},"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":"3c5ef3a9ced11df447624532943eeb0e361d921160150ba4362b095ddeb7815b"},"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":"96e2a7bc0403fe7846bc719f94ea9a3c2f03ca3bd8633bd259d8ba8554af3abe"},"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":"adc4aa008248254b183a1c059567006a51bcaf0cc251e111121d73dc26c3aa1a"},"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":"0384608494be4abc4cde0bad49d653871ff9fe9ceb013d86f3b164fe03752b89"},"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":"525387c9bf533861339de9bffe86cc9b8e24511f79d415eb46e8afffc3dd25ae"},"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":"425f225b7a472daad3179639ce765fbe60e33c791eaf8d1b963fd1e28d7c20b8"},"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":"acf2bfab54704ada202a247df310a4bc395851eaeb11f8297c2aeb57062bd23e"},"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":"9f864108be45f0912cb1062daf420f526c410318955c88e8ab6157b8f4e2ed76"},"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":"fe274ba5adebde25ca0b3db842e44cbb1aaeb7cfecfbb7215cd452596ba1f4c2"},"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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.88: rust-toolchain.toml declares Rust 1.88 as this project\u0027s toolchain file, and Rust 1.88, superseded by 1.89 on 2025-08-07 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2025-08-07 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"476678a1ee3431d0d7d6fee2467e49852f5ae540b5afab9dd2c9822ddc2f8ee5"}},{"ruleId":"AX3","level":"error","message":{"text":"Namespace dependency cycle: The namespaces Turso.Raw \u2194 Turso.Raw.Public depend on each other. The lightest dependency in the cycle is Turso.Raw.Public \u2192 Turso.Raw (Turso.Raw.Public.StartOperationDelegate \u2192 Turso.Raw.TursoStatusCode, 4 type pair(s)); cut that one first, e.g. by moving the shared type to a namespace both can use or inverting it behind an interface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Raw/Public/TursoSyncBindings.cs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"358321b5fa78d8e4656d67d04209e09cc6338512992518be07c659a92d9369d1"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: SortedChunk.read: \u0060SortedChunk.read\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":"core/vdbe/sorter.rs"},"region":{"startLine":760}}}],"partialFingerprints":{"codehealthFindingId/v1":"11df6d3d0f0362b438d0f3bbbc9cd499980608d086980796ea483d04e7b17991"}},{"ruleId":"C1","level":"warning","message":{"text":"No data-protection/encryption: No data-protection or encryption usage (ASP.NET Data Protection, AES, column encryption, PBKDF2) was found \u2014 sensitive data at rest may be unprotected. If TDE/KMS/vault is delegated to infrastructure, ignore."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3674448ef29fbd006d82bb49ec9615cf1ee508105aa1d952555aabaf3e10a9f9"}},{"ruleId":"ED4","level":"error","message":{"text":"Dual write (no outbox): Schema.handle_schema_row: \u0060Schema.handle_schema_row\u0060 performs two independent DURABLE writes \u2014 a durable state write (\u0060dbsp_state_roots.insert\u0060, :4378) and a second independent durable store write \u2014 in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/schema.rs"},"region":{"startLine":4281}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb81cbfd4c4750a3947aa9b49a78192b2d85dd76b839a745b8f8d2b12874e97"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 12 public types in \u0060Turso.EntityFrameworkCore.Sqlite.Query.Internal\u0060 are marked as implementation by their own namespace, folder or name: \u0060TursoSqliteQuerySqlGenerator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQuerySqlGenerator.cs:8, \u0060Internal\u0060), \u0060TursoSqliteQuerySqlGenerator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQuerySqlGenerator.cs:8, \u0060Internal\u0060), \u0060TursoSqliteQuerySqlGenerator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQuerySqlGenerator.cs:8, \u0060Internal\u0060), \u0060TursoSqliteQuerySqlGeneratorFactory\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQuerySqlGeneratorFactory.cs:5, \u0060Internal\u0060), \u0060TursoSqliteQuerySqlGeneratorFactory\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQuerySqlGeneratorFactory.cs:5, \u0060Internal\u0060), \u0060TursoSqliteQuerySqlGeneratorFactory\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQuerySqlGeneratorFactory.cs:5, \u0060Internal\u0060), \u0060TursoSqliteQueryableMethodTranslatingExpressionVisitor\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs:25, \u0060Internal\u0060), \u0060TursoSqliteQueryableMethodTranslatingExpressionVisitor\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQueryableMethodTranslatingExpressionVisitor.cs:25, \u0060Internal\u0060), and 4 more. While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Query/Internal/TursoSqliteQuerySqlGenerator.cs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d0588fa252363ff06df53a95138ae8505414171ca4a82d9cf94689073db5a2"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 9 public types in \u0060Turso.EntityFrameworkCore.Sqlite.Storage.Internal\u0060 are marked as implementation by their own namespace, folder or name: \u0060TursoSqliteDatabaseCreator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:14, \u0060Internal\u0060), \u0060TursoSqliteDatabaseCreator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:14, \u0060Internal\u0060), \u0060TursoSqliteDatabaseCreator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:14, \u0060Internal\u0060), \u0060TursoSqliteHistoryRepository\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:284, \u0060Internal\u0060), \u0060TursoSqliteHistoryRepository\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:284, \u0060Internal\u0060), \u0060TursoSqliteHistoryRepository\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs:284, \u0060Internal\u0060), \u0060TursoSqliteRelationalConnection\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteRelationalConnection.cs:15, \u0060Internal\u0060), \u0060TursoSqliteRelationalConnection\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteRelationalConnection.cs:15, \u0060Internal\u0060), and 1 more. While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"253f23ed5af6ec4d30c0b2b8747bc66390bd6b81a95bc952ad76d4ca655c6aea"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 3 public types in \u0060Turso.EntityFrameworkCore.Sqlite.Update.Internal\u0060 are marked as implementation by their own namespace, folder or name: \u0060TursoSqliteUpdateSqlGenerator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Update/Internal/TursoSqliteUpdateSqlGenerator.cs:10, \u0060Internal\u0060), \u0060TursoSqliteUpdateSqlGenerator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Update/Internal/TursoSqliteUpdateSqlGenerator.cs:10, \u0060Internal\u0060), \u0060TursoSqliteUpdateSqlGenerator\u0060 (bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Update/Internal/TursoSqliteUpdateSqlGenerator.cs:10, \u0060Internal\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Update/Internal/TursoSqliteUpdateSqlGenerator.cs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3c9e069557684bcf15007db2747a56db280e2ae8534933d44d798603fbc88b"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Data.Sqlite.Properties.Resources\u0060 (bindings/dotnet/src/Turso.Data.Sqlite/Properties/Resources.cs:3) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.EntityFrameworkCore.Sqlite(net8.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/Properties/Resources.cs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ae413e7f262ce5d4754ec74dac3a49bc688b5477b4b5cc6402e4cf1f103cc9"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Data.Sqlite.Properties.Resources\u0060 (bindings/dotnet/src/Turso.Data.Sqlite/Properties/Resources.cs:3) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.EntityFrameworkCore.Sqlite(net10.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/Properties/Resources.cs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"173e486a4166a09879dc0585a412bc8272ef6d69ac426d8bcaf0a0134a1e568e"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Data.Sqlite.SqliteBatch\u0060 (bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:9) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.EntityFrameworkCore.Sqlite(net8.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a26a02b75f21f2cb96b06ecd4e740f3fa3abc8c76c4b6d918c4634035a933a6"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Data.Sqlite.SqliteBatchCommand\u0060 (bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:471) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.EntityFrameworkCore.Sqlite(net8.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5aacd72a278adf1762a945bb87529004ea97a2a25915916468cbe36b15e4174"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Data.Sqlite.SqliteBatch\u0060 (bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:9) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.EntityFrameworkCore.Sqlite(net10.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bf3e6e4f030109e1d4b513b92a0a12f2f220f3f51d3c75968f5423844eb5b6"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Data.Sqlite.SqliteBatchCommand\u0060 (bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs:471) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.EntityFrameworkCore.Sqlite(net10.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fbcbd0ab11262c65c013bbfa2b960759da1ada2716bb8fdf8dfa03e99d0876"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Data.Sqlite.SqliteBlob\u0060 (bindings/dotnet/src/Turso.Data.Sqlite/SqliteBlob.cs:6) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.EntityFrameworkCore.Sqlite(net8.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBlob.cs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2322458872a29c567808b597dbd6b432dad90040b97eb9ef982a8b99b66658"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Data.Sqlite.SqliteBlob\u0060 (bindings/dotnet/src/Turso.Data.Sqlite/SqliteBlob.cs:6) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.EntityFrameworkCore.Sqlite(net10.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBlob.cs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38c5f70dbb85674fc2435bd2ddfc7ca885b6fc1d7026b3d0b9eef2a5d059b40"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.TursoConnectionStringBuilder\u0060 (bindings/dotnet/src/Turso.Data/TursoConnectionStringBuilder.cs:9) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.Data.Sqlite(net8.0)\u0060, \u0060Turso.EntityFrameworkCore.Sqlite(net8.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnectionStringBuilder.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaa11683565a1e61e00c55f39a188dfc8bddc7e6c518cd10499e49a49125e8f"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.TursoConnectionStringBuilder\u0060 (bindings/dotnet/src/Turso.Data/TursoConnectionStringBuilder.cs:9) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060EncryptionExample\u0060, \u0060Turso.Data.Sqlite(net10.0)\u0060, \u0060Turso.EntityFrameworkCore.Sqlite(net10.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnectionStringBuilder.cs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e28aa08e803f44fb3a0bf6530ab4411a289cb9ca1281315584ea87ef08e572"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.TursoDataReader\u0060 (bindings/dotnet/src/Turso.Data/TursoDataReader.cs:14) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.Data.Sqlite(net8.0)\u0060, \u0060Turso.EntityFrameworkCore.Sqlite(net8.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoDataReader.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fe749be4263db83d12e488a45fa8cdc9d6d47b096cfa8f2c38a7c8bc51b0ce"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.TursoDataReader\u0060 (bindings/dotnet/src/Turso.Data/TursoDataReader.cs:14) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Benchmarks\u0060, \u0060Turso.Data.Sqlite(net9.0)\u0060, \u0060Turso.EntityFrameworkCore.Sqlite(net9.0)\u0060, \u0060Turso.Tests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoDataReader.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"dffa3bbd2f443d31968dc1d6045b05900613055910d2bd58e4a1ddd5f4cb64da"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.TursoDataReader\u0060 (bindings/dotnet/src/Turso.Data/TursoDataReader.cs:14) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060EncryptionExample\u0060, \u0060Turso.Data.Sqlite(net10.0)\u0060, \u0060Turso.EntityFrameworkCore.Sqlite(net10.0)\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoDataReader.cs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c887f37429add2b85dfc239ebbae8cdfefb65b9db7e00759e35afb9603378b"}},{"ruleId":"P10","level":"note","message":{"text":"Public type used only inside its own library: \u0060Turso.Platform.Client.ErrorResponse\u0060 (bindings/dotnet/src/Turso.Platform.Client/obj/net9.0/TursoPlatformClient.generated.cs:6504) is public, and the library\u0027s own code uses it, but no other project in this repository uses it (read: \u0060Turso.Tests\u0060) and no public member of the library exposes it. Consumers outside this repository are not visible here; if they rely on it, it is API and should be documented as such."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Platform.Client/obj/net9.0/TursoPlatformClient.generated.cs"},"region":{"startLine":6504}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8015160e44872cdd91d856dba466c6303b8319e9c2e70214ec22b670732982"}},{"ruleId":"P12","level":"warning","message":{"text":"CI test gate excludes suites by filter: \u0060yarn workspace @tursodatabase/sync test\u0060 drops 16 test(s) in 1 file(s) (e.g. \u0060bindings/javascript/sync/packages/native/remote-write.test.ts\u0060), and no other gate runs them before merge. Run what it excludes in another job before merge (a complementary selection), or remove the exclusion."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/napi.yml"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d843cf9bbe72dfe5da95e686d75f4faa51052b7e7789d0d7b07a54d70a990b"}},{"ruleId":"P12","level":"warning","message":{"text":"CI test gate excludes suites by filter: \u0060yarn workspace @tursodatabase/sync test\u0060 drops 16 test(s) in 1 file(s) (e.g. \u0060bindings/javascript/sync/packages/native/remote-write.test.ts\u0060), and no other gate runs them before merge. Run what it excludes in another job before merge (a complementary selection), or remove the exclusion."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/napi.yml"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f39fa8714196aaab04fc2a123067032b13b9b97a68fde3fbdfd9289987c4073"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060bindings/dotnet/samples/MobilePackageConsumer/Android/AndroidPackageConsumer.csproj\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/samples/MobilePackageConsumer/Android/AndroidPackageConsumer.csproj"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e36ded04710e0c10b2e6bc8303c5bfb6da539b8afa66d87a960afe99094f34"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060new HttpClient(new UnexpectedHttpHandler())\u0060 builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller \u2014 a build step, a CLI run, a UI thread \u2014 with no way out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/samples/ReplicaPackageSmoke.cs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf93c0d084d7caf89e22a3e728bff6bbde6f71d6697febd46dab38677d4bb2f5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060new HttpClient(handler)\u0060 builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller \u2014 a build step, a CLI run, a UI thread \u2014 with no way out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0cec1cf11f3e9fe64e952d7fa230a6bad640ee312abcdbf7b2e8e6e5f119f3e"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060new HttpClient()\u0060 builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller \u2014 a build step, a CLI run, a UI thread \u2014 with no way out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoRemoteClient.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4422ecfc9cdde8928e5220fb5940edf8c3c15bf548e35a3f26346a4da89dac5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060new HttpClient { Timeout = Timeout.InfiniteTimeSpan, }\u0060 builds an outbound HTTP client, and what is applied to it does not bound it. Its \u0060Timeout\u0060 is set to \u0060Timeout.InfiniteTimeSpan\u0060, which removes HttpClient\u0027s own bound rather than setting one. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller \u2014 a build step, a CLI run, a UI thread \u2014 with no way out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5430b0b89801bc72d72e5621463147870266da3fc43ebc53be2a5ec20917da3"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060new()\u0060 builds an outbound HTTP client and nothing bounds it: no timeout is set on it and no retry or resilience policy wraps its calls in the type that owns it. This codebase ships libraries/tools rather than a service it operates, so the failure lands as a hung caller \u2014 a build step, a CLI run, a UI thread \u2014 with no way out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Serverless.Client/TursoServerlessConnection.cs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fba30e7f476431f441e440f7a98f6ed5078c7cf49dac06f5e02a1603f993fd"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by a CREATE TABLE statement (no migration path): a CREATE TABLE statement here creates the schema at runtime, and this repository keeps no migration history \u2014 there\u0027s no upgrade path for an existing production database. Adopt a versioned schema-migration mechanism (with EF Core: \u0060dotnet ef migrations add\u0060 \u002B \u0060Migrate()\u0060 or a migrations bundle) so schema changes are versioned and applied safely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Benchmarks/Benchmarks.cs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cff27159658dc6cbe51a7a877887c3d488dfa010e810969ab1701bc428c9c65"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by a CREATE TABLE statement (no migration path): a CREATE TABLE statement here creates the schema at runtime, and this repository keeps no migration history \u2014 there\u0027s no upgrade path for an existing production database. Adopt a versioned schema-migration mechanism (with EF Core: \u0060dotnet ef migrations add\u0060 \u002B \u0060Migrate()\u0060 or a migrations bundle) so schema changes are versioned and applied safely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/samples/ReplicaPackageSmoke.cs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da00855287c8f9b1263171ea8c2ae4853a195d3b396240139128e2db744f162"}},{"ruleId":"P8","level":"warning","message":{"text":"Schema created by a CREATE TABLE statement (no migration path): a CREATE TABLE statement here creates the schema at runtime, and this repository keeps no migration history \u2014 there\u0027s no upgrade path for an existing production database. Adopt a versioned schema-migration mechanism (with EF Core: \u0060dotnet ef migrations add\u0060 \u002B \u0060Migrate()\u0060 or a migrations bundle) so schema changes are versioned and applied safely."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/dotnet/Encryption.cs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"434b18bc154c91746596bbb663d2e4d47e4096f59e47483ac4eed8f5fa6b008b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060spawn\u0060 is async and calls block_on \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/rust/src/sync.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"048c628bc8f72e5c259e58eb12fc1771eab4b7d36e8425e5e1efb56931068e7a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060run\u0060 is async and calls block_on \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"perf/fts/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"511d28160eb1443d6cb2a81b32f4ee252b74e8dd34177285d3af8bd2f44862a8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060analyzeCorruption\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2271b30eefc5a0d6234af57eda44531497fbd14e8cccdf76924d44c9d811d9e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060analyzeCorruption\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ab8823d38dc2fe17ae0eadb60317f2475d007379ba112188e198ed81bea7ca"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060runPythonTool\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc5154f743c43fb10f73dfa52621ded24e15fd26079ea896df7f282e9eef421"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060preserveCorruptDatabase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bf4b2f7e395ee2af69c14d3333c9fb99ab57dd8c17d425efb2e13bcb877ffb0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.mkdirSync\u0060 in \u0060preserveCorruptDatabase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45182009064b5e3efadc3bae35db2ab098643808f0e7dedeafc205624c3c89c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060preserveCorruptDatabase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95ad134d281849a0ca3d28ef400e43681fc4af43b248c327b0698fcfd0e1bf7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060preserveCorruptDatabase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b8a4f673cb6a9e28de7a025e87bfa0c8844ef85dce279d538bb883d6c9ece7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.existsSync\u0060 in \u0060preserveCorruptDatabase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef307005b686430b3428a0d21412b515615b2133872b4f10033856647d22793"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060fs.copyFileSync\u0060 in \u0060preserveCorruptDatabase\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddba570e216a80457aef64800ec3f320905691d638575c5c303ffc53eb4274f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: 19 blocking call(s) on async work (.Wait()/.GetAwaiter().GetResult()) \u2014 these waste a thread and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2dedb76432d7d4f359386b5c37564c0f3de368182a77e31aa8af9ba73f9a4def"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"25aacc973c6f6d7492e17930fa4637221d9607c9a9a00d8c17cfe9561ad003da"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bc99aa563acb210cf41580af8f3bb597e2fc37a45eb08a838dd80978ad9e2f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter() .GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad42d286ed4a8ed785c8362ac2b95805dffd0fd4bf494c7bbd8d526e37c04f52"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoAutomaticSyncCoordinator.cs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cc0093bc985bf2e28e36f8cf30c61156040209b66e200fa8f93b85446c9084"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoBatch.cs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f20b0b388a5183dc4cdb16d5dfca9bd6082ca0aaef04888b37ca722d488de64"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoBatch.cs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b423092d1035d7776f996a7c62f5316bee4943e9fdf17de74a1affc41c1dacd"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoCommand.cs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"41034db5574e43b38fb5e5a6a2ccc676e4445d7d58476e06a21e4115db6edc61"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoCommand.cs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c37d4db2074b49d25ad89251a3dc98c5d8c7ed6c9b934005aa9a5f9db732781"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7b15b59d5c5b09a9ae2325f677854238334e8fc597d1ad7a79f9e174c7cf53"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter() .GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3eff584893985f5bd1c93f88459745a8bc916d079836517114c52d4e26d49c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter() .GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2a3a5d7167ef22cafb867dd794afeeea057972867f46fa4b8365c0a7238399"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter() .GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a477b9aa32c623f41888739ca50c22fb1db7d4a5c247e6d3154104ca70123a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c363a89a44b0d073aa48dc1a94e7b33c544838e545511630099a2bc80ed305b9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter() .GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"9597dec883422b98117dd1395ffa3bd012fea7edca043695923ece8e224af360"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba64f3c4f5418dbd389d1163002072c1a80c1496d43a3140005f920b9983b9b8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter() .GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62dd86b166a24e037a4ae2481ca5b39e3921a45c77126a2cb673d2dbfbcb082"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoConnection.cs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2057c1060f1df8e61437d445e8a674a4743b67eccf0487ca3043290a323288"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd08e805ef8a173c62616d45a26cf3b1ebe18a3eb173dbc38d7ce7ef770ee0f3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060.GetAwaiter().GetResult()\u0060 blocks this thread until the async work completes \u2014 it wastes a thread-pool thread for as long as the work runs and can deadlock wherever a synchronization context is in play (a UI thread, or a caller that has one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab75bd6bc8ed51ed30658a5f8c9c57917fba87ce4c4c3ff89635a387bfb6f6e0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = state.Batch\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"553b4e6f322d82e7c6aeab9a7a1f2c38eb77011da10dfc2389c9552339336a4c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await ExecuteDbDataReaderAsync( CommandBehavior.Default, cancellati...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6b1a803a0cae32b5779d6f3cb1a65028aba849a2c3a28f1891e6c69fe659ea"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = state.Batch\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6269d342ecb63cea466f6e853a307879311745a94962c1a96a0d1aed2d84692"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = state.Batch\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c91eb51f1a61ff4c3c6c399bbbb334317ea7541709596703b799079af58808"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await state.Batch .ExecuteReaderAsync(behavior \u0026 ~CommandBehavior.C...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2fa5124d77499f88db8f5d954c9e4b7ce2f262974487af4785f0f29dd102c5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await ExecuteManagedAsync(\u0022ExecuteNonQuery\u0022, CommandBehavior.Defaul...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3ea4fafbaecc518209f340577ad8f6ec2225e6ee4f6eadc158c2de9e89b567"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await ExecuteManagedAsync(\u0022ExecuteScalar\u0022, CommandBehavior.Default,...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57aa43ed0f2b272318da55eebe06c455c178f6901659419e90228319e7821d1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await command .ExecuteReaderAsync(CommandBehavior.Default, cancella...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b6e6a12307593ea95d419d3f9d44d313a7d0c971704edb0d4d0429cb3b8c4a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = new global::Turso.TursoCommand(_connection!.ManagedConnection) { Co...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7342d75a6b10551d01ea717be1c18ee28796c5e6d316b12c0a6ff40c48f2eb99"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await ExecuteDbDataReaderAsync(CommandBehavior.Default, cancellatio...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoBatch.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bce4e599350bf9ba1dfdc52db82069188f6a80a480a604c222f131f0bc59472"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await command .ExecuteReaderAsync(cancellationToken) .ConfigureAwai...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoBatch.cs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1eadd4e766539eb390e3958000009839f793f9dcf9cf05f30962beec86008ad"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await ExecuteDbDataReaderAsync(CommandBehavior.Default, cancellatio...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoCommand.cs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c99f217433535b2dc33a9ba7c5f5e32082618e47dd1112ba3a337e253cf93c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await ExecuteDbDataReaderAsync(CommandBehavior.Default, cancellatio...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoCommand.cs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5acfbfcb732c0d619cb9637e2a2cf429a494dcc3ee431a2cc77828cd72667d2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = await response.Content .ReadAsStreamAsync(cancellationToken) .Confi...\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b66c962df63b01691cc68960073027a24fe3e6f09732ef0a25cc20a260c9ae"}},{"ruleId":"PF3","level":"warning","message":{"text":"Awaits without ConfigureAwait(false): \u0060await using \u2026 = connection.CreateReadOnlyConnection()\u0060 resumes on the caller\u0027s captured context. In library code that context belongs to the host application, so a host that blocks on this call (or runs on a UI thread) can stall or deadlock \u2014 append \u0060.ConfigureAwait(false)\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c931af80edc5faa52221edf6f3ef904b784588d1ebc77a2e4d8390e9d81a3396"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (7 clone groups): 7 of the duplicated blocks reported below have copies in at least two of the sibling directories bindings, serverless under the repository root. 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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6bcb6ada48bc3a0620f39624c9ac57f6c94d92dcdd5885c7e038d207c1cd3f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 2 sibling directories (5 clone groups): 5 of the duplicated blocks reported below have copies in at least two of the sibling directories packages, sync under bindings/javascript/. 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":"bindings/javascript/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5971bb992fe5ee06e6ff64910311b250b27825df14c77344933f020871103f5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (179 identical lines \u00D7 5 files): bindings/javascript/sync/packages/native/promise.ts:1 \u00B7 bindings/javascript/sync/packages/wasm/promise-bundle.ts:1 \u00B7 bindings/javascript/sync/packages/wasm/promise-default.ts:1 \u00B7 bindings/javascript/sync/packages/wasm/promise-turbopack-hack.ts:1 \u00B7 \u002B1 more site(s) not listed \u2014 these 5 files are line-for-line copies of one another \u2014 179 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":"bindings/javascript/sync/packages/native/promise.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65875262ff216e7bdca262fac5086bddb54591b9fa748a2f03d6806bc6aeced5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (90 matched lines \u00D7 2 locations): testing/simulator/simulator-docker-runner/github.ts:28 \u00B7 testing/sqlancer/sqlancer-runner/github.ts:5 \u2014 the two spans are one implementation copied and then locally edited \u2014 700 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":"testing/simulator/simulator-docker-runner/github.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f09ba74e3f441fc46c9883b1d150703a219ec81410804529af4204f5b076d46"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (65 matched lines \u00D7 2 locations): testing/simulator/simulator-docker-runner/slack.ts:27 \u00B7 testing/sqlancer/sqlancer-runner/slack.ts:33 \u2014 the two spans are one implementation copied and then locally edited \u2014 437 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":"testing/simulator/simulator-docker-runner/slack.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff5a7abf1bbfcbfbfc42ebe4bfba7d3b8196fbe65c4e3319f9757c3ae753da5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (51 matched lines \u00D7 2 locations): serverless/javascript/src/connection.ts:186 \u00B7 serverless/javascript/src/connection.ts:652 \u2014 the two spans are one implementation copied and then locally edited \u2014 464 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":"serverless/javascript/src/connection.ts"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa78e81c2ef3a78e0fc0be2fa9e85bd2ea5bd5933661d29a187954c6196ee02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 3 locations): bindings/javascript/packages/wasm/promise-bundle.ts:5 \u00B7 bindings/javascript/packages/wasm/promise-turbopack-hack.ts:5 \u00B7 bindings/javascript/packages/wasm/promise-vite-dev-hack.ts:5 \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":"bindings/javascript/packages/wasm/promise-bundle.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e170cbafd97676abd634840f275d5074ae19da955b5e6077f54d1d89f8e6c8ae"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): bindings/javascript/packages/common/promise.ts:548 \u00B7 bindings/javascript/packages/common/promise.ts:1012 \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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"836e967a36b6602778ec1698951f337d184fd2d38badea9d2ab4e018eddc913d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2 locations): testing/simulator/simulator-docker-runner/levenshtein.ts:7 \u00B7 testing/sqlancer/sqlancer-runner/levenshtein.ts:8 \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":"testing/simulator/simulator-docker-runner/levenshtein.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70a7ad1bb790c28023e9afb612e7bfe08f85a989081a1bcc75abeba9ac551b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2 locations): bindings/javascript/packages/common/compat.ts:45 \u00B7 bindings/javascript/packages/common/promise.ts:94 \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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0c22b70bca0a27f2a476fb57ca44f5f89c422741e30a2ba6eebb42a340a310"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 4 locations): bindings/javascript/packages/wasm/promise-bundle.ts:18 \u00B7 bindings/javascript/packages/wasm/promise-default.ts:22 \u00B7 bindings/javascript/packages/wasm/promise-turbopack-hack.ts:18 \u00B7 bindings/javascript/packages/wasm/promise-vite-dev-hack.ts:18 \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":"bindings/javascript/packages/wasm/promise-bundle.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cf89260b1db7c8a813cef66112b5a4997257a162ef7abbc8e7af504f1fa2ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2 locations): bindings/javascript/packages/common/compat.ts:5 \u00B7 bindings/javascript/packages/common/promise.ts:15 \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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b026b693902956222127051e9e6938a204734f4ae7bb21e9f906f1734840fd18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2 locations): bindings/javascript/packages/wasm/index-vite-dev-hack.ts:6 \u00B7 bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts:14 \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":"bindings/javascript/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92fa5cd58bdcecb705f98062c2830b42153694eae9d1d02973283e9007de80e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): bindings/javascript/packages/common/compat.ts:202 \u00B7 bindings/javascript/packages/common/promise.ts:628 \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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a519e0241f0fceb14deed9cab503e173b75227af8d250407cd10308f81cd54"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): bindings/javascript/packages/common/promise.ts:128 \u00B7 serverless/javascript/src/session.ts: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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18009380e9aca640fc9373c2fe33ca3918b5376250c581a0d1f6fa24abc38de"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): serverless/javascript/src/session.ts:215 \u00B7 serverless/javascript/src/session.ts:729 \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":"serverless/javascript/src/session.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"650e778cba5e43645f9372bffdda630c5259a8c66d93d04dda47be441aeec4d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): bindings/javascript/packages/common/promise.ts:671 \u00B7 bindings/javascript/packages/common/promise.ts:972 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a66544fc4e75af9606448402ad28402e9c94719cdd4bdaa8eac73f715c36a52"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 3 locations): bindings/javascript/sync/packages/wasm/index-bundle.ts:11 \u00B7 bindings/javascript/sync/packages/wasm/index-default.ts:9 \u00B7 bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts:11 \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":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a436787ff58471794bd7235b42adf96eb6894754ce5589f08d04edf093ca9da7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 9 locations): bindings/javascript/packages/common/promise.ts:380 \u00B7 bindings/javascript/packages/common/promise.ts:448 \u00B7 bindings/javascript/sync/packages/native/promise.ts:285 \u00B7 bindings/javascript/sync/packages/wasm/promise-bundle.ts:295 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ac68442522fb66296f6167f25f6c7a6afb13c3d55760c0222cb4841109e9a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): bindings/javascript/packages/wasm/index-bundle.ts:5 \u00B7 bindings/javascript/packages/wasm/index-default.ts:3 \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":"bindings/javascript/packages/wasm/index-bundle.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2054d835aed96b30b3ac67e04009b5f76b271014f11b2fb27c374906daf0ff33"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): bindings/javascript/packages/wasm/index-turbopack-hack.ts:6 \u00B7 bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts:6 \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":"bindings/javascript/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f7856953e454ef85c3926dd5f738433b39a56ca074e56152d56ad9a2bc80c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): bindings/javascript/packages/common/promise.ts:1224 \u00B7 bindings/javascript/packages/common/promise.ts:1267 \u00B7 bindings/javascript/packages/common/promise.ts:1305 \u00B7 bindings/javascript/packages/common/promise.ts:1343 \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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a23c4b0e750236cfd7f423e089c7617fdf5c32adb4df7739feee67de07d237"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): bindings/javascript/packages/native/compat.ts:5 \u00B7 bindings/javascript/packages/native/promise.ts:5 \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":"bindings/javascript/packages/native/compat.ts"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1e120b4faa89b79a4a8ce98e2081e227be62b595cae1c61fcc7d3e307e0ece"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): bindings/javascript/packages/wasm/index-default.ts:6 \u00B7 bindings/javascript/packages/wasm/index-turbopack-hack.ts:8 \u00B7 bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts:8 \u2014 the 3 copies are spread across 3 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":"bindings/javascript/packages/wasm/index-default.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e107609287d67a2949627988b54e1b5c1e5e48319a03c1c5840fa7dde2bcd6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): bindings/javascript/packages/common/compat.ts:443 \u00B7 bindings/javascript/packages/common/promise.ts:1232 \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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c07b087debf3c9afcb2d5cd7291e8675150b61021315dea90dbe231daf8964"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): bindings/javascript/sync/packages/common/run.ts:298 \u00B7 bindings/javascript/sync/packages/common/run.ts:312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/common/run.ts"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8006a03152cbeb1994a2b7bc7a21e3339cffdd8697c6965fad200c50f44a55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): bindings/javascript/sync/packages/native/turso-server.ts:100 \u00B7 bindings/javascript/sync/packages/wasm/turso-server-setup.ts: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":"bindings/javascript/sync/packages/native/turso-server.ts"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fb614782db0a78d1802c99271a94eb9f6168d9f0735d3d195f4fa152922235"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): bindings/javascript/packages/common/promise.ts:945 \u00B7 serverless/javascript/src/connection.ts:627 \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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"0685c6b01891298c7882934f8c0ef3fcbeb93dcbed1e999601e60e63607af6df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): bindings/javascript/packages/common/async-lock.ts:17 \u00B7 bindings/react-native/src/AsyncLock.ts:28 \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":"bindings/javascript/packages/common/async-lock.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b89ce6f963a4886c2abb06deb4db30e1def4165a3837bcf062679fb310bac0b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): bindings/javascript/packages/common/promise.ts:1264 \u00B7 bindings/javascript/packages/common/promise.ts:1302 \u00B7 bindings/javascript/packages/common/promise.ts:1340 \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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":1264}}}],"partialFingerprints":{"codehealthFindingId/v1":"244f7a46b2d3f3cc6222d51b5258f252772949aa172bee01c246af462cfa14b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): bindings/javascript/packages/wasm-common/index.ts:48 \u00B7 bindings/javascript/packages/wasm-common/index.ts:66 \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":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4764aebf2b42deff2c39119176362f9564aa32be9f7782cf1daf19ac1e01e2bd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): bindings/javascript/sync/packages/common/remote-writer.ts:88 \u00B7 bindings/javascript/sync/packages/common/remote-writer.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":"bindings/javascript/sync/packages/common/remote-writer.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"523519562d88d204066f74a5629092c2c300db869259f5e391acc82dffdd0d99"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): serverless/javascript/src/compat.ts:284 \u00B7 serverless/javascript/src/connection.ts:26 \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":"serverless/javascript/src/compat.ts"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd03ac81c5c89617c8b696fdb43799425a70b9347c5051631741b82348d98dac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): testing/sqlancer/sqlancer-runner/logParse.ts:107 \u00B7 testing/sqlancer/sqlancer-runner/logParse.ts:121 \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":"testing/sqlancer/sqlancer-runner/logParse.ts"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9499e60176d860b09a359bbb21602e8fe97908021e4c504384badcc112a87fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): testing/sqlancer/sqlancer-runner/logParse.ts:160 \u00B7 testing/sqlancer/sqlancer-runner/logParse.ts:204 \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":"testing/sqlancer/sqlancer-runner/logParse.ts"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6ec94385e545c62ce1fa05d37d4dad64aec711ffc7a2c5872b7c9354e360158"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): bindings/javascript/packages/common/compat.ts:288 \u00B7 bindings/javascript/packages/common/promise.ts:806 \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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c805aeb679579cca7327fa0be748733ea920445f35793a09b3b8e5393fe1037"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6 locations): bindings/javascript/sync/packages/common/run.ts:189 \u00B7 bindings/javascript/sync/packages/native/promise.ts:32 \u00B7 bindings/javascript/sync/packages/wasm/promise-bundle.ts:21 \u00B7 bindings/javascript/sync/packages/wasm/promise-default.ts:21 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 copies are spread across 6 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":"bindings/javascript/sync/packages/common/run.ts"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"1556022ae79dff6ad626b927c51f70e643c5c5b5213f2a6c7df6c741cbcd936b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): bindings/react-native/src/Statement.ts:128 \u00B7 bindings/react-native/src/Statement.ts:238 \u00B7 bindings/react-native/src/Statement.ts:279 \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":"bindings/react-native/src/Statement.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e527833a2cf201f7940c378892754ee0cafbe705259ab0393ed1bec16bf15d8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): serverless/javascript/src/session.ts:394 \u00B7 serverless/javascript/src/statement.ts:273 \u2014 the two spans are one implementation copied and then locally edited \u2014 79 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/javascript/src/session.ts"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"10e665a61982ea043907679c495e2b99bfd9655491c6c78feb8224dc36ec503b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 10 locations): bindings/javascript/packages/common/compat.ts:174 \u00B7 bindings/javascript/packages/common/promise.ts:387 \u00B7 bindings/javascript/packages/common/promise.ts:455 \u00B7 bindings/javascript/sync/packages/native/promise.ts:292 \u00B7 \u002B6 more site(s) not listed \u2014 the 10 copies are spread across 8 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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa40de5702f957f6300ef38183d0cdcd2a026432d7bbbff51d00f209618a8517"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): bindings/javascript/sync/packages/common/remote-write-statement.ts:66 \u00B7 bindings/javascript/sync/packages/common/remote-write-statement.ts:81 \u00B7 bindings/javascript/sync/packages/common/remote-write-statement.ts:93 \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":"bindings/javascript/sync/packages/common/remote-write-statement.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"95830dcee8800f3e183d55446d5e3708e031c141b54aa7cdb5ecd56ff6a0ead8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): bindings/react-native/src/internal/asyncOperation.ts:87 \u00B7 bindings/react-native/src/internal/ioProcessor.ts:307 \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":"bindings/react-native/src/internal/asyncOperation.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b539b3e4e60f95536a9d631a0565bd03ffd0b4fea524194f867516c2188e1fbf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): bindings/javascript/packages/common/compat.ts:124 \u00B7 bindings/javascript/packages/common/promise.ts:307 \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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f2ed7973a5cf2728a5e7ffc6a6311e6c4e8d844b0f0a30ed38022f9fd7b02e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): bindings/javascript/packages/wasm-common/index.ts:60 \u00B7 bindings/javascript/packages/wasm-common/index.ts: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":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"00132bd743c23d9ac1d118ccfcaf9ade6c220e2a23d2d90a2cf72f6f111aea43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): bindings/javascript/packages/wasm-common/index.ts:215 \u00B7 bindings/javascript/packages/wasm-common/index.ts:225 \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":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59f89c1082663be2fdb21c2020db003ff16ce2b381188f07cd21c8bc09e1296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): bindings/javascript/sync/packages/native/turso-server.ts:41 \u00B7 bindings/javascript/sync/packages/native/turso-server.ts:61 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/native/turso-server.ts"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b725f95b5f04b078e003ab13f8286b6d94c814c8857707924d36bad1c453a640"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (8 matched lines \u00D7 2 locations): bindings/javascript/packages/common/promise.ts:889 \u00B7 serverless/javascript/src/protocol.ts:124 \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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fb3e3c19f80ae639e0d712c8b18b3c3eba3200d0683b70e2f6775b4e493935"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): bindings/javascript/packages/wasm-common/index.ts:316 \u00B7 bindings/javascript/packages/wasm-common/index.ts: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":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1067c44ac4fbf8af06d9d7969ee559584f9e76556c28c39cbb7d5f8b43d759d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): bindings/javascript/packages/wasm/wasm-inline.ts:1 \u00B7 bindings/javascript/sync/packages/wasm/wasm-inline.ts:1 \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":"bindings/javascript/packages/wasm/wasm-inline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a891bb40928973f71387a5484f77d35e3662feb71f9f6a11eae68460ade16ebf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): bindings/javascript/sync/packages/native/turso-server.ts:29 \u00B7 bindings/javascript/sync/packages/native/turso-server.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":"bindings/javascript/sync/packages/native/turso-server.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d098d0255f1cc96d3a9bf132289640dbaad15b186c543b89daa5fc6e199f2654"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): bindings/react-native/src/Database.ts:287 \u00B7 bindings/react-native/src/Database.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/Database.ts"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c7252def66a112be029d1568703c5fff3428ee0be2e6c44457bc1db8a24518"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): serverless/javascript/src/protocol.ts:306 \u00B7 serverless/javascript/src/protocol.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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"44004bc876559d909ee7f76d730436e012d14659271c47613ba4e8776be42d57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): serverless/javascript/src/protocol.ts:369 \u00B7 serverless/javascript/src/protocol.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/javascript/src/protocol.ts"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1691476974a066f0f99981ff9f4aa0cbef5c43102d9ed384e872d3d2955ec9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): bindings/javascript/packages/common/promise.ts:779 \u00B7 serverless/javascript/src/session.ts:533 \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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f52fba90ecf4d6c1b200059a91894057835f0a505ececc023e430577c42c9e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): bindings/javascript/packages/common/promise.ts:1216 \u00B7 bindings/javascript/packages/common/promise.ts:1298 \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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"731c3c44e2e911a423e4d1db44c379157939c5b378ba392248935b4736dab171"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): bindings/javascript/packages/wasm-common/index.ts:328 \u00B7 bindings/javascript/packages/wasm-common/index.ts:336 \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":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c56e4727b2390e646f99f2ed039117733411b49b350adc67fd4b2904b549c93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): bindings/javascript/packages/wasm-common/index.ts:386 \u00B7 bindings/javascript/packages/wasm-common/index.ts:394 \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":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba42ed72dc40c896345a74456c23172eefe7fc9346258a6407b409604eba680"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): bindings/javascript/packages/common/compat.ts:17 \u00B7 bindings/javascript/packages/common/promise.ts:27 \u00B7 serverless/javascript/src/args.ts:38 \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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e4c567c1914d35774d122c8b8404d8ed5ca308c239d4833f72d6b027df980c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 6 locations): bindings/javascript/packages/common/promise.ts:462 \u00B7 bindings/javascript/sync/packages/native/promise.ts:299 \u00B7 bindings/javascript/sync/packages/wasm/promise-bundle.ts:309 \u00B7 bindings/javascript/sync/packages/wasm/promise-default.ts:309 \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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d95c860390a7185263f8be0f7aff8bf84f9456c3fd40931717f76429ac08ec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): bindings/javascript/sync/packages/common/remote-write-statement.ts:88 \u00B7 bindings/javascript/sync/packages/common/remote-write-statement.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/common/remote-write-statement.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"639c8aee2eefeff7a7537f350e2762faeb899b6ead2efa368d7406036e6a1b66"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): bindings/javascript/sync/packages/common/remote-writer.ts:126 \u00B7 bindings/javascript/sync/packages/common/remote-writer.ts:132 \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":"bindings/javascript/sync/packages/common/remote-writer.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"898c3e27d8e992f786390bfcca227bedbae60c015f8b1dd1c8deb42876a610b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): serverless/javascript/src/connection.ts:656 \u00B7 serverless/javascript/src/connection.ts:667 \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":"serverless/javascript/src/connection.ts"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3049a4cadefa8812ba53dc7e809e9def4aa611985dadf5d80a3ae41b71571a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): testing/simulator/simulator-docker-runner/logParse.ts:36 \u00B7 testing/simulator/simulator-docker-runner/logParse.ts: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/simulator-docker-runner/logParse.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"157b904f4c81ceaadc1861a51899921b06ee094490c47176787c35cf342bdd67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): serverless/javascript/src/statement.ts:148 \u00B7 serverless/javascript/src/statement.ts:169 \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":"serverless/javascript/src/statement.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b068d6812375e392ae54590e90692ae30e18808055c2e4b1846eb6aa20472171"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function transition (cyclomatic 37, cognitive 17): transition has cyclomatic complexity 37 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":"bindings/javascript/turso-sql-split.mjs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e596ff8a075aaab2151db1fd1739113e18977466b4be6d476ba9620cdc1bd14"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeOpLocal (cyclomatic 29, cognitive 47): executeOpLocal has cyclomatic complexity 29 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":"serverless/javascript/differential/parity.test.mjs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e093dd0784f5b8cf38546a539cd8541d26848b21a4d9da0f5ac9e4a4b943398"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function batch (cyclomatic 27, cognitive 31): batch has cyclomatic complexity 27 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":"serverless/javascript/src/session.ts"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e9c3fce79f37ed2bf4ba10ed0dfd624028c28b13ed4ae07af1cd10038a822d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _buildOpArb (cyclomatic 27, cognitive 25): _buildOpArb has cyclomatic complexity 27 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":"serverless/javascript/differential/parity.test.mjs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2420f445e7dc122e38f79421404c2482959dedd2af4bf2d05b8d1a3b06b02692"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 26, cognitive 54): (anonymous) has cyclomatic complexity 26 and cognitive complexity 54; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/javascript/differential/parity.test.mjs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"e259873c63292cd70905bf259c472de51b7ceef458bc9292c7de06638cc0229b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function process (cyclomatic 25, cognitive 44): process has cyclomatic complexity 25 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/common/run.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dbef3eb7aa2f5bd1ad26b62ceef4cf855746a1d9dac8d92b472def06931052"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nextToken (cyclomatic 25, cognitive 44): nextToken has cyclomatic complexity 25 and cognitive complexity 44; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/turso-sql-split.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd70d6f29a6f2a06f765f99eee2dd53b898cf0d67b1e4aefb28f34e57612eb2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function batch (cyclomatic 21, cognitive 36): batch has cyclomatic complexity 21 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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"445fe28de90b032a347160a0abb32f1814a59d6ed7b66dc7dae9ee9bca48cba9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 20, cognitive 28): (anonymous) has cyclomatic complexity 20 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":"serverless/javascript/differential/parity.test.mjs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc140e1036a5c0c050cc95591954c6229b7db1a4435edba516a7e6fe786fa61"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 19, cognitive 52): main has cyclomatic complexity 19 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":"testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.ts"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"913ecc1e72bb11670acacbc6d1ab58403455a4dabae5cc3d8903caf2be83fddb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function cellsEqual (cyclomatic 19, cognitive 19): cellsEqual 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":"serverless/javascript/differential/parity.test.mjs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d58a8acd4e7230b2d05189c27172e3743da7a6c43fe09e4c0048ca64b14d59e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processHttpRequest (cyclomatic 17, cognitive 23): processHttpRequest 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":"bindings/react-native/src/internal/ioProcessor.ts"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ba3a0c352648eea5f0366d1a31d13a1ab42c4f530d446a9203cb48aa73634f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSql (cyclomatic 17, cognitive 15): buildSql 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":"serverless/javascript/differential/parity.test.mjs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d09f574c7941c539fde8f207a0b725f38f9696ca229ac2c5aea6ea226454bd6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encodeValue (cyclomatic 16, cognitive 20): encodeValue 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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b50c13eed7156d85bb731cf5d9cbe44f60bcb1b08d0ed0cee8ab12c622a470"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeBatch (cyclomatic 15, cognitive 25): executeBatch has cyclomatic complexity 15 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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":734}}}],"partialFingerprints":{"codehealthFindingId/v1":"d544bae9274b946181ca2746bda26a2de6f6de562a46e5a5913223267a4b91a6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function processCursorEntries (cyclomatic 14, cognitive 21): processCursorEntries 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":"serverless/javascript/src/session.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"898909396355e445ad16374a28b7f7f9acb7937b7f6a134d0c9a4b244eb26b28"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function _buildValueArbs (cyclomatic 14, cognitive 13): _buildValueArbs 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":"serverless/javascript/differential/parity.test.mjs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"835f9814d54c85f19eedfab6fe4699555cb37f591968fb01d69a516715d61659"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function iterate (cyclomatic 13, cognitive 19): iterate 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":"serverless/javascript/src/statement.ts"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"20024f3d046451789858a03734e9fe1837993facc5c3e14b1dd645933142f7d1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function trackAutocommit (cyclomatic 13, cognitive 18): trackAutocommit 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":"serverless/javascript/src/session.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a95d31d3a073e94b70a44cfdb74336fee62595fc06d0c99c3a20a3902ba1665"}},{"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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba28bcb89a6b97492680a790290eba14a0cc5ff57361f33471080fc310ddcff6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function extractMismatchInfo (cyclomatic 13, cognitive 15): extractMismatchInfo 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":"testing/sqlancer/sqlancer-runner/logParse.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"838dbb8b222895e109e63f60061fd8e2dfa51c5aaa5df02cffc45405e817f3a5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function normalizeBatchBindValue (cyclomatic 13, cognitive 14): normalizeBatchBindValue 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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f422f21ea7c87be2cd1e3aecd2cdf6ac8c5842ac33874110ddaa97586595f0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function executeCursor (cyclomatic 12, cognitive 17): executeCursor 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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"2edf3e5a491e5c2424e64bb236ec0338c30dfc0a911dc93fa51f07ea65925d03"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 12, cognitive 16): (anonymous) has cyclomatic complexity 12 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/simulator-docker-runner/docker-entrypoint.simulator.ts"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"038ee38fdeaf56686495d06379bb34d6aa6b2b6a5d00a894ddb4942e67504b73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 12): constructor 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":"bindings/javascript/sync/packages/native/promise.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ed58bfbdd6a16b4b6a361becb677ec734b93dbfc536663b45634a25e24f279"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 12): constructor 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":"bindings/javascript/sync/packages/wasm/promise-bundle.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ead11b85d7c452abd97b78492ac633074da67f318cdfead8c83570f4e07e47"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 12): constructor 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":"bindings/javascript/sync/packages/wasm/promise-default.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5397078372dd9135b7210bf3cf766ce0208804a72e433313945bcf96551547ed"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 12): constructor 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":"bindings/javascript/sync/packages/wasm/promise-turbopack-hack.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"234e969df61c4cc7aaf8645ba13f73fbdbe2d3c3558e36d545941e73316f8c26"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function constructor (cyclomatic 12, cognitive 12): constructor 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":"bindings/javascript/sync/packages/wasm/promise-vite-dev-hack.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c6ccf0e478e80d6557d5958dcc57831b908892be918c261e083003c3dec50b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function compareResults (cyclomatic 12, cognitive 12): compareResults 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":"serverless/javascript/differential/parity.test.mjs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a84937c11b215048e45ba11ccd3912a783588feb3b2f09f91c1b59758e8a37a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validateConfig (cyclomatic 12, cognitive 11): validateConfig 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":"serverless/javascript/src/compat.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6342fd5d9085478a10231fec32f6ac8b30a1d738f890d0feb5e61d212bec5c8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function all (cyclomatic 11, cognitive 15): all 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":"bindings/react-native/src/Statement.ts"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a41f45c53b12a12febf29833add325a698e381a5d83adddbd4f9f2425e3681a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function formatValue (cyclomatic 11, cognitive 14): formatValue 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":"bindings/javascript/turso-sql-runner.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c566d97d3117518f56dc193b70d50dabc3d2ae2bf8e0dfbf57276ac54df2b13d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodeValue (cyclomatic 11, cognitive 12): decodeValue 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":"serverless/javascript/src/protocol.ts"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"018a5c99be476782ce680969e712503216b9da39c91046ae2cbb1c51907404be"}},{"ruleId":"R3","level":"warning","message":{"text":"bindings/javascript/packages/common/promise.ts: 1305 lines of code: bindings/javascript/packages/common/promise.ts has 1305 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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f755ff225c030af1877e64910c2e7122e69a84928604ec1987870c7809bf39"}},{"ruleId":"R3","level":"warning","message":{"text":"serverless/javascript/src/session.ts: 731 lines of code: serverless/javascript/src/session.ts has 731 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":"serverless/javascript/src/session.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b69dd30e636cda364f6bd7f6bab6cdeaaacce4d2aa71116637d8f14c9848f38"}},{"ruleId":"R3","level":"warning","message":{"text":"serverless/javascript/src/connection.ts: 725 lines of code: serverless/javascript/src/connection.ts has 725 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":"serverless/javascript/src/connection.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91421192bae1625a8cd7863c1190a12745b9191ae7f670f01282d008f3d0893f"}},{"ruleId":"R3","level":"warning","message":{"text":"serverless/javascript/src/compat.ts: 563 lines of code: serverless/javascript/src/compat.ts has 563 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"serverless/javascript/src/compat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c7666f136e0836dbc1aa999003719cbf1fd447426db46ada2e537eb9baff2f7"}},{"ruleId":"R3","level":"warning","message":{"text":"testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.ts: 549 lines of code: testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.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":"testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0a97f44dc51ddd7f91d166845ca865eb4f77f2ed161e6e7ad96d9785c4973c"}},{"ruleId":"R3","level":"warning","message":{"text":"bindings/javascript/packages/common/compat.ts: 508 lines of code: bindings/javascript/packages/common/compat.ts has 508 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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae003cd1e42f75486c03c8a6ce3198c9f2ad36fd63f334a7a12c279eaa030087"}},{"ruleId":"R3","level":"warning","message":{"text":"bindings/javascript/packages/wasm-common/index.ts: 457 lines of code: bindings/javascript/packages/wasm-common/index.ts has 457 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef03a9d7f9cf195db4a42301d3ea18c50b72324738aa2846b114e9daef482ec"}},{"ruleId":"R3","level":"warning","message":{"text":"bindings/react-native/src/Database.ts: 447 lines of code: bindings/react-native/src/Database.ts has 447 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":"bindings/react-native/src/Database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c55a3833246706aa86606522641a5b771c05fc91860dece638e09100b5f5a1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/docker-entrypoint.sqlancer.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86faa7a67a25f9581c7ae6450c437718949052aa4585ff52fb36598b19f01ea1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/Database.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc71102edd79f497754d94ea3c8ac184a5e666e28c446d66a5c7a9518bd352e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/Statement.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b91ff1d1b7f1ac82d202bd244208b699b2e0bf3b6b7a77c066761f1ecd3f63"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/types.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2772e3b723d92d373fec2abcc0ebff93efa8bdc14e46eb45bdebf24099ed4afe"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/promise-bundle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5021f788f3698ab5c1edfbe3b2dd726cefed98ae6d89d47e648443a47ab697"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/promise-turbopack-hack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3952b648389d665b4d3e74d73d6fd478915906425c1ffc33790d75dc34691416"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/promise-vite-dev-hack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7d1a46d123e3870ebf087ee2503e8d050a9120646e4561678bee334e0de47e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/logParse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a753da276102089cfe8b5fc187d6449426e81fd3876ce954b944c41f34dbffd"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/internal/ioProcessor.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"796217fae26b577e962f9fb7c1bb3c8f7024a8b051fe254e43364920bc05fc7a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/github.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebafcf9ac385da70386f32c9f83f449d3e1df97bdfe955423d4fbdd7a5a0dc64"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/corruptionAnalysis.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d6663bcc569923469cbf647a827260697b0cb67b7092d7654c9f868256994e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/simulator-docker-runner/docker-entrypoint.simulator.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"395c6e6d7a854d4d13b0e426fbec4e6f4011b808ea185392b0cd725b0df268fb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"deff7139713e567bc4021f39ed589979f9843f32310e8becb9f56d8bc0efcad4"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/simulator-docker-runner/github.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fe08fb843f423a22596a411ceb5f98fd8172558faae8b69ae9d43c69d416ea"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/slack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c194d71ed48bad226ba0ce9c37789c5ab53d6e5296add6517648752c30af2d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/simulator-docker-runner/slack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e71957778122438732eec9daf500809f677fec0c13e001186bf327bdd91d46b"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/internal/asyncOperation.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2146b794f56482c05233bf56ac68ebf82cbaf1459c349940086b8d51229dc0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/turso-sql-runner.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"906262c53ee5eb91053fd358cdc4645e8dac61104052d6e8cbcded406131b282"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/promise-bundle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf85f2b4952303510dfbd7446ac8e16a75f57a235a7ba26baf1d78cc833e29d5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/promise-turbopack-hack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"476ebc2c1153d2ce6579a3120a91ca7fcf93d25632bbaecadb7753978cf9a184"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/promise-vite-dev-hack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c71a1dceaca2a29f4cc342b41d521b1953e2013c501adf511f4ebb0f3de5b98"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/simulator-docker-runner/logParse.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e68c217d2e3945558eba1df6ed28cd801b4c62ebe5f2ac63610d34aaf53f791d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5aa2a095eba293cebd2f6ac2b356a6dae72fc7816d31e83cbf6a414ac30b9eb"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/sqlancer/sqlancer-runner/levenshtein.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c966616087be57146f7e38f9f15420d6fb5e4d51cf13dfb53715d659e4c3ad1f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/react-native/src/AsyncLock.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"333a6919cce2dae291e61f212118c31b6b6509deaf7a46624f4b6c62f1660045"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2799b7841bdb02edf972b0f27775d67983f5aca6343f90961e0ea43f9c65bae"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e8c19162ec4fe8b6697ea8a069989f13fbe2ee409bf8d064926e6c0a0cbbb1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4e99e8f43328474800524326a9d9e8049182060fc010b62ec5e80d6c6947c3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c777650a6e7a6bccac646d5a8c5f99905d50635b123eebdbdb10339c755e53"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-bundle.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0048c11bd1ec046598f0bc25853d059e6a134fa47af8725d7c454e90e832f991"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/wasm-inline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c7a20e61ee86e431e2f8a008d01b26190fdba81dad417053221fe9c7a4ce3a"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/wasm-inline.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7ef54f5aa0eca2daaef5441859bf36e8236b709b8d9abc7b348c85918b1d66"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/scripts/inline-wasm-base64.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdee0a9b40d8c0cd17640cd2eb72e13b99bc22776bd273aeaf2e766afcec61dc"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/simulator/simulator-docker-runner/random.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"571d7fb17b7a9dd70e1aed7282010aba9303471dba534f646d322cfeff623e51"}},{"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":"bindings/javascript/packages/wasm/index-bundle.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbea8210e9fcec195339a915386c8c5bd0ced699de707026456fb8e995e6d90a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Opfs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-bundle.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f01b1ce668dc579a98ba294f3db9e14681d0ba062c71363b724ba218be3a81"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpfsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-bundle.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef88fbeb42daabf7933e38d4b7108f79844b4d5dbc991a52ed314ad993b2409b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Statement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-bundle.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"135aa46d8c161945e76c182415420787cf1795611843be2c7df2b32418d83398"}},{"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":"bindings/javascript/packages/wasm/index-default.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f339a268cefb74c6669878d575b1160a2d26ac16539242c8ea7e066c7bb8bc"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Opfs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-default.ts"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0701835a618d928f3b2d837aba3f7ea1323a536220c60ed14399bc429e1bf80b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpfsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-default.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab0c5a503c8a2accfacebe24ed00b97bc291cc74174701c30ff6856d5328b27"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Statement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-default.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dce4ae7eadc3de0204df9dee8e8bd59c0fa774f6c749e586d68b17aedfdd23"}},{"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":"bindings/javascript/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"320053ade0713e6aac8084ec002fca3c81199024299b9d533584b6e77c19d2cd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Opfs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efec5bc1312a9feda970d1de1f5eba154f78636ba021399fd260c5110483a02"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpfsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"1198165f8853cad623d52eec65a54c3317e1c05ccbd83c5004b5396635c0f6fe"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Statement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7689ccdbfef7f55ff11bb1f4abdd2dbdccd87408a2e3b4c1857ff8b7c6dfc7bb"}},{"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":"bindings/javascript/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf2fffb68d3a025b8116ffa40f805d87ba6a2e1863430d207b700be01ff2942"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Opfs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cc665c4676ef9c13f6b3bff10ace0d26ec9d87285fb5e35c0accdced106986"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpfsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06bb95ed8e8bfe0e020f3d6698973180365c2e93dbd51a9c8855e79d2e72485"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Statement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"046475527564c1520a3b90c56a89ecefc46aa3fc1bd6cc466822611c832388ec"}},{"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":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed31e1fc3335bf6b889ff69c2a73a91909bc9a317a744fe7d1cc473090680e7c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Statement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33a57eddcab7b7b4d5ec09ea29d472563147da762f7a5a95156aa1bfe96128b"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Opfs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed182614673cfc9928ce78ef4f1112f106350d2e4862b1777bd1fbfb26997bda"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpfsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"691420b90c934334963b9d530961b162040e72821bed72744d53b786de720d5e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027connect\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"89151f50b16a29a3d2611f0fd105a55d8d215a947f732a7ea9b8fc1ce92e0e0d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GeneratorHolder\u0027: Nothing imports THIS copy of \u0027GeneratorHolder\u0027 \u2014 but bindings/javascript/sync/packages/wasm/index-default.ts:24 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep bindings/javascript/sync/packages/wasm/index-default.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e229e3aae06d8c989cb5775e8e587b6ee6555f8bab9f1af51eb0980ac4efb2d"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsDataCompletion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6638480ddfb2b46e64b136569a83d472608b9fadeab149f1405c1bee711ecda"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsProtocolIo\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"342f05111a225667269c05f4fc6ea1831099f0ca8a0005613babfcf19bb374a0"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsProtocolRequestBytes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ecc07f893efc9920ed36c56467560f488b5fddcc880c641c19f8a829a20ec7"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DatabaseChangeTypeJs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-bundle.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a9ea2678cd561a7651afc30d35a498938179ac44a9c1a8229b9ea5a3c54c36"}},{"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":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cdf512d0a309a8d7af1671c032af2c6e8c4591df8e61b69d2cf92d90bf63153"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Statement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8cc792974eadde753815951bd702c0a983328bf5bad36dfabe59615aa8c008"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Opfs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee44d91f90520921b7f0df48c097b58ce9a96bd4c665615e43393756b57f58f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpfsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c334ca70ab1a2d4c24da8b09fc6eea6791a3ccd334b9db532b1a8e7cae9e4da9"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027connect\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0729e4fe26b60ce1b1df9130a4aa18e757549ca7920aaa312557aa8114a1c08c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsDataCompletion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4bf1d92d4ec44c318f50f343be66074198efb04b3ed43f578cfa71ca2a7910"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsProtocolIo\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"968a2f4a3b53a21a219819e20df24a9279bcabe10a39c9554efca8a031eea593"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsProtocolRequestBytes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b368b29f945ef790a8f2d615d161976c2fe26b1fb9c93b01e51f1e69cfa9c8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DatabaseChangeTypeJs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-default.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d72e79af0204a05592602257fa4e9196770bbb2f6c301be702034af9cd1c74e"}},{"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":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a0f768526019c80629c3d133f714566b3fe52c6bbb50f694d46c3b05c8cffd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Statement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"6072b346b1995df05a5f5802740107f117a82c02415ef8f09b5573758d3863ae"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Opfs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8858a43e2cd1834bd83b68e52a003ebb3a6c606e64b2de62daa53e94ae6c095e"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpfsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c350fe854eaf5fb98200beada0eff90ec241119d50c7f7acb85590ee0f2e0277"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027connect\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4163231af4e99851c4065f9273ad8932b9a2452ce046d0b1a6c082c7adbf6dc5"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GeneratorHolder\u0027: Nothing imports THIS copy of \u0027GeneratorHolder\u0027 \u2014 but bindings/javascript/sync/packages/wasm/index-default.ts:24 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep bindings/javascript/sync/packages/wasm/index-default.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b48adaa65b35e65ef43d9e47de689f6105ac8e263dbbbbd81e6c70a29196b4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsDataCompletion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd469b3388579330aa7be2c9e42bd5803f279193b32e32463e096493c551ec0a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsProtocolIo\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efd2c153e460d707931422e3ac7e1035cd31ff42e1a3f1791c0e739fc82f513"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsProtocolRequestBytes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"f553a66b63c25417907ee4a15e8193e7ebeefb9781307b94fbd5bb79013af15c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DatabaseChangeTypeJs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-turbopack-hack.ts"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1675e8f95b3c345bf90aeb7acfb976829de565026c943a3aab931c0632c6859d"}},{"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":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"eed4c74fcdc39affcb5e7338b3a0d07c49ee0fc200eeb07b669598ae3aa84fc6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Statement\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2879f1094264215cf85f5de10d6aa1a4b29307a69f408c19ef9e1de9b5ea118c"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Opfs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8abefb094c4b26382844a7d842217275a5560364ecb7c5e09ba0eca8260024"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027OpfsFile\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad283293d6654c7d5adee7e5b710c67524501b228a05bafd4bde857ff617a0ed"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027connect\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"713f91d6f84bfb9c7aede07d6e36b84e48b5547c951eb0ac591010283ea1055f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027GeneratorHolder\u0027: Nothing imports THIS copy of \u0027GeneratorHolder\u0027 \u2014 but bindings/javascript/sync/packages/wasm/index-default.ts:24 in the same directory exports that same name, and it is the copy every import site resolves to. Grepping the name therefore finds live callers that do not reach this binding: it is the dead half of a duplicated pair, left behind when the API moved. Delete it here and keep bindings/javascript/sync/packages/wasm/index-default.ts\u0027s, or, if this one is meant to be the survivor, repoint the importers before removing the other."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27d6747f2c4d0736e1cdd86440182f0e973d21101f6a3a2f1afc931e072e779"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsDataCompletion\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25d3eccdbc15a92e9a1308878078aa2222f54f8c30ff1924b787d96d917a323"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsProtocolIo\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac39e9d5d5548c34898d469b92e1a6dcd59b4247e30f8fa101a2687ef6261f26"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027JsProtocolRequestBytes\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e301f54720d0dd559339c668937c6250c3c8ce434aa9a79fcdd14cba365ece8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027DatabaseChangeTypeJs\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/sync/packages/wasm/index-vite-dev-hack.ts"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3515d2bccc9efe1deacb4738071454922781d98599748b7c501b55670a29a4e8"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027intCompare\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":"bindings/javascript/sync/packages/native/promise.test.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d20ad6267fcb9928c542ae8b54888d0d1e8b3d621c0966883d23713497f9280"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#io\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":"bindings/javascript/sync/packages/wasm/promise-bundle.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb98c3831b73a7582c84f05d55130f72b45857f98fb5062d429f97d6e9ebe18d"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#io\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":"bindings/javascript/sync/packages/wasm/promise-default.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"885470bcf68bbe140e1c4ef36fc126d527cfc977be5488fc81944ac3ef67b880"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#io\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":"bindings/javascript/sync/packages/wasm/promise-turbopack-hack.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4541f273d397c601a927628e4937f7d14bff40fb3e9deae25636a2852988ddbd"}},{"ruleId":"R7","level":"note","message":{"text":"Write-only private field \u0027#io\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":"bindings/javascript/sync/packages/wasm/promise-vite-dev-hack.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"8683a70d0a46e01228e3a2bb644a1a6db8b9fbabdf3a8651b9a495c111f85108"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027intCompare\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":"bindings/javascript/sync/packages/wasm/promise.test.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"bada66ae72d52bf6fe60ab4c41185b3525687f3c64e49467fb4e78a47fd0de70"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027async\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":"serverless/javascript/src/session.ts"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e8c0c8d98292eef2ddc0fa5befe6a578fab1f5928baf7b0451b918fa8d48b6"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@emnapi/core\u0027: Declared in bindings/javascript/packages/wasm-common/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":"48b1da16e9a429e956a30b081876a9e8673049e59d04d628910725d1c95d5e92"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@emnapi/runtime\u0027: Declared in bindings/javascript/packages/wasm-common/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":"c95b500015afa818e7b3c512bc0418842cddcc5cfc83d6516979c70c48eeb903"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027@libsql/client\u0027 in production deps: Only test files import it (first: testing/conformance/javascript/__test__/compat.test.js:40) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/conformance/javascript/package.json"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b14dbf7c7ce6a3d48bae573fe38a1a900889740ad5d5b44ae9b828924b15c7"}},{"ruleId":"R8","level":"note","message":{"text":"Test-only dependency \u0027better-sqlite3\u0027 in production deps: Only test files import it (first: testing/conformance/javascript/__test__/sync.test.js:974) \u2014 move it to devDependencies."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"testing/conformance/javascript/package.json"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4075891d33f284b197b6417d53b2c504ee8da97d329a27806afbdfeda336e5"}},{"ruleId":"SC1","level":"warning","message":{"text":"NuGet dependencies are not locked: No packages.lock.json and no central package management \u2014 restores aren\u0027t reproducible or pinned (SSDF PW.4.4). Enable \u003CRestorePackagesWithLockFile\u003Etrue\u003C/RestorePackagesWithLockFile\u003E (commit the lockfile) or adopt Directory.Packages.props. Advisory \u2014 never scored."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0a97b4f69ccac509400ece7eedefb06d3ede0522cd4d8bcb5c068bea719545a6"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: testing/differential-oracle/fuzzer/docker-runner/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":"testing/differential-oracle/fuzzer/docker-runner/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb712d7ad2025415fb8333a76be362b60e114d480625eea1abef84a6ae540d33"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: testing/sqlancer/sqlancer-runner/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":"testing/sqlancer/sqlancer-runner/package.json"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b4c94d9fe12b7a7372e7dba32757a19488f9dac61a966df6a375b346119f4f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_isolationLevel == IsolationLevel.Serializable \u0026\u0026 !deferred\u0060 appears character-identically in 2 files \u2014 bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs, bindings/dotnet/src/Turso.Data/TursoTransaction.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteTransaction.cs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0be56e24ec531aba472841963998f9a0e21cffeb52b154a968666b5fc360ccb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_transaction is not null \u0026\u0026 !ReferenceEquals(_transaction.Connection, connection)\u0060 appears character-identically in 2 files \u2014 bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs, bindings/dotnet/src/Turso.Data/TursoBatch.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b457f15b406fec3f543aaf6d86fcab3e6b5cbe21ebedfbf5edc0802b5b715dc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060upper == \u0022TIMESTAMP\u0022 || upper == \u0022DATETIME\u0022 || upper == \u0022DATE\u0022\u0060 appears character-identically in 2 files \u2014 bindings/go/driver_db.go, serverless/go/driver.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/go/driver_db.go"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"21de301660f281695c3045bfd839d16e8ced5a7c8203e9116109b0f3926830f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u002B 1 \u003C sql.Length \u0026\u0026 sql[index \u002B 1] == closing\u0060 appears character-identically in 2 files \u2014 bindings/dotnet/src/Turso.Data.Sqlite/ManagedSqliteStatement.cs, bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteRelationalConnection.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/ManagedSqliteStatement.cs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58404432115821cb2ea2fb20775c3845900342a0dc9bcf50b56d32c08c4c7af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index \u003C sql.Length \u0026\u0026 char.IsWhiteSpace(sql[index])\u0060 appears character-identically in 2 files \u2014 bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs, bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteRelationalConnection.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteConnection.cs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2dd871f75bfc7c8bb66203df7d7297c0ab0cacac0d8cc3ca71dc06224862f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bindParameters.length \u003E 1 \u0026\u0026 isQueryOptions(bindParameters[bindParameters.length - 1])\u0060 appears character-identically in 2 files \u2014 bindings/javascript/packages/common/compat.ts, bindings/javascript/packages/common/promise.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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"070c392745d7aaa956729979da2211e9857e4a07121872a24090ef1e2f16faa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060entry.error?.message || \u0027SQL execution failed\u0027\u0060 appears character-identically in 2 files \u2014 serverless/javascript/src/session.ts, serverless/javascript/src/statement.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":"serverless/javascript/src/session.ts"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ead4109ab68544c6316c09a4b1ef8affef22be6c6df369a9b3ae9667ee6cb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060keyword !== undefined \u0026\u0026 TRANSACTION_CONTROL_KEYWORDS.has(keyword)\u0060 appears character-identically in 2 files \u2014 bindings/javascript/packages/common/promise.ts, serverless/javascript/src/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":"bindings/javascript/packages/common/promise.ts"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63dafbdd62986d0d57f44d2b4e0017c5e90a9d2be6b68d114bc87b2942d6098"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060options != null \u0026\u0026 typeof options === \u0022object\u0022\u0060 appears character-identically in 3 files \u2014 bindings/javascript/packages/common/compat.ts, bindings/javascript/packages/common/promise.ts, serverless/javascript/src/compat.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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4479f55eba684f1344cc5309ce032e8e11b0e1e88d27c7833bcca43d216855"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060opts.remoteWritesExperimental \u0026\u0026 opts.url\u0060 appears character-identically in 5 files \u2014 bindings/javascript/sync/packages/native/promise.ts, bindings/javascript/sync/packages/wasm/promise-bundle.ts, bindings/javascript/sync/packages/wasm/promise-default.ts, bindings/javascript/sync/packages/wasm/promise-turbopack-hack.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":"bindings/javascript/sync/packages/native/promise.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"39af456ee2c2593c0872105f5cfad4732767b038e200a4d4c67d4dff26c37415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.GITHUB_APP_INSTALLATION_ID || \u00220\u0022\u0060 appears character-identically in 2 files \u2014 testing/simulator/simulator-docker-runner/github.ts, testing/sqlancer/sqlancer-runner/github.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":"testing/simulator/simulator-docker-runner/github.ts"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8156148b6da4bf76e1112d831f4cc3b6c5a868ea906e49b82b413b5ec7ec1e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060process.env.GITHUB_APP_PRIVATE_KEY || \u0022\u0022\u0060 appears character-identically in 2 files \u2014 testing/simulator/simulator-docker-runner/github.ts, testing/sqlancer/sqlancer-runner/github.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":"testing/simulator/simulator-docker-runner/github.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c91adda99125fd5aafd6489564dcefec80a73d61eab4776f1403a34ea6c3c261"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stepResult === STEP_ROW \u0026\u0026 row === undefined\u0060 appears character-identically in 2 files \u2014 bindings/javascript/packages/common/compat.ts, bindings/javascript/packages/common/promise.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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0d00b52a96f570e6d462d25276fd0cd9400069ed964e2446532103288197ac4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060this.name != null \u0026\u0026 this.#worker != null\u0060 appears character-identically in 8 files \u2014 bindings/javascript/packages/wasm/promise-bundle.ts, bindings/javascript/packages/wasm/promise-default.ts, bindings/javascript/packages/wasm/promise-turbopack-hack.ts, bindings/javascript/packages/wasm/promise-vite-dev-hack.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":"bindings/javascript/packages/wasm/promise-bundle.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4378c5cfae3cfa583c798826d782a535e0b3d2138ef8c15d98bc4c31fc32b776"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typeof opts.url != \u0022function\u0022 || opts.url() != null\u0060 appears character-identically in 5 files \u2014 bindings/javascript/sync/packages/native/promise.ts, bindings/javascript/sync/packages/wasm/promise-bundle.ts, bindings/javascript/sync/packages/wasm/promise-default.ts, bindings/javascript/sync/packages/wasm/promise-turbopack-hack.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":"bindings/javascript/sync/packages/native/promise.ts"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1a0f95d13627a3871e0138a59051da6b306f7d702acafddf076934071e2023"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value != null \u0026\u0026 typeof value === \u0022object\u0022 \u0026\u0026 !Array.isArray(value) \u0026\u0026 Object.prototype.hasOwnProperty.call(value, \u0022queryTimeout\u0022)\u0060 appears character-identically in 2 files \u2014 bindings/javascript/packages/common/compat.ts, bindings/javascript/packages/common/promise.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":"bindings/javascript/packages/common/compat.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c7145ebc7373b784ea03e1cf37feddeb7dc8d28e26886b4d2e2481ee6affce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060normalized.Contains(\u0022REAL\u0022, StringComparison.Ordinal) || normalized.Contains(\u0022FLOA\u0022, StringComparison.Ordinal) || normalized.Contains(\u0022DOUB\u0022\u2026\u0060 appears character-identically in 2 files \u2014 bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs, bindings/dotnet/src/Turso.Data/TursoDataReader.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":1471}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe8792c1a4189395f0ccffccbe3eb151e7edf867944209c144fb56b901c6474"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.db or Path(__file__).parent / \u0022crashes.db\u0022\u0060 appears character-identically in 2 files \u2014 testing/sqlright/crash_reports/collect_crashes.py, testing/sqlright/crash_reports/query_crashes.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":"testing/sqlright/crash_reports/collect_crashes.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6a9623945c189be399cfa94e93c52109c6433383d87b3b8af822ff37cdcc37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == \u0022-\u0022 and i \u002B 1 \u003C n and sql[i \u002B 1] == \u0022-\u0022\u0060 appears character-identically in 2 files \u2014 bindings/python/turso/lib.py, serverless/python/turso_serverless/dbapi.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":"bindings/python/turso/lib.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db0cfc0d42542e97da18713cea1ab0d83f9c1135156b89b08413df1793fee9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c == \u0022/\u0022 and i \u002B 1 \u003C n and sql[i \u002B 1] == \u0022*\u0022\u0060 appears character-identically in 2 files \u2014 bindings/python/turso/lib.py, serverless/python/turso_serverless/dbapi.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":"bindings/python/turso/lib.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"71a730b94b7671fd9c985f680ab2c6ac4079336c7948d18765195dec81df414d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dtype == \u0022BLOB\u0022 and get_random() % 2 == 0\u0060 appears character-identically in 2 files \u2014 testing/antithesis/stress-composer/parallel_driver_nested_savepoint.py, testing/antithesis/stress-composer/parallel_driver_savepoint.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":"testing/antithesis/stress-composer/parallel_driver_nested_savepoint.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"790a15311b14099494cc60e59013aafa2d3cbd55313e0d73232f6155ca09c62b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(rf, type) and issubclass(rf, Row)\u0060 appears character-identically in 2 files \u2014 bindings/python/turso/lib.py, serverless/python/turso_serverless/connection.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":"bindings/python/turso/lib.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce3730e1eadc3ff47f86fb42150c94ed5961e719dedefeacd7eda82f255f2f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(statement, (tuple, list)) and len(statement) == 2 and isinstance(statement[0], str)\u0060 appears character-identically in 2 files \u2014 bindings/python/turso/lib.py, serverless/python/turso_serverless/connection.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":"bindings/python/turso/lib.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f2ed60c7141f260376cd4062bbe9d442d24380fd1f7f034f7e26c2d894ce54"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._keys == value._keys and self._data == value._data\u0060 appears character-identically in 2 files \u2014 bindings/python/turso/lib.py, serverless/python/turso_serverless/dbapi.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":"bindings/python/turso/lib.py"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e539dab4a963eef2cd6d2f6fb5f7359d00a799a0f6fbb35a520a65ad26f33c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reader.FieldCount \u003E 0 \u0026\u0026 await reader.ReadAsync(cancellationToken).ConfigureAwait(false)\u0060 appears character-identically in 2 files \u2014 bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs, bindings/dotnet/src/Turso.Data/TursoBatch.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteBatch.cs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35a08463df4d13bab0da8f98a530e8413eb1d1f98211aa0bae105e43cb6d254"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!files.contains_key(path) \u0026\u0026 !flags.contains(OpenFlags::Create)\u0060 appears character-identically in 2 files \u2014 core/io/memory.rs, core/io/memory_yield.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":"core/io/memory.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed22e4e9302d7ad1ddd0e4698939fda3309ae4aa150303f767695d2e70a2143"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!is_tbl(ns.as_str()) || !has_col(col.as_str())\u0060 appears character-identically in 2 files \u2014 core/schema.rs, core/translate/index.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":"core/schema.rs"},"region":{"startLine":9037}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f2e2b91500f9e7975c1e5c8eb282cf424e738dd8178e3d91dbbb7d5b31cf1b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!order_by.is_empty() \u0026\u0026 filter_over.over_clause.is_some()\u0060 appears character-identically in 2 files \u2014 core/translate/planner.rs, core/util.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":"core/translate/planner.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"62068c054ba30dcee11efa9efe716683537eb18465ab74c9cb9050cad61b412a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!stderr.is_empty() \u0026\u0026 (stderr.contains(\u0022Error\u0022) || stderr.contains(\u0022error\u0022))\u0060 appears character-identically in 2 files \u2014 testing/sqltest/src/backends/cli.rs, testing/sqltest/src/backends/js.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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3644ef31787c152d69bd8d17c980b7786cacff3a590ffacd250ba69b1d43bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(d1.is_nan() \u0026\u0026 d2.is_nan()) || (d1 - d2).abs() \u003C 1e-4\u0060 appears character-identically in 2 files \u2014 core/vector/operations/distance_cos.rs, core/vector/operations/distance_l2.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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a7f37ff03079e240d54852d751acc37c57795aa649636e5ad2319f111d1803"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(d1.is_nan() \u0026\u0026 d2.is_nan()) || (d1 - d2).abs() \u003C 1e-6\u0060 appears character-identically in 3 files \u2014 core/vector/operations/distance_cos.rs, core/vector/operations/distance_l2.rs, core/vector/operations/jaccard.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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"4473854f51ad68c40a9e2f178d1217538d978bbc437e8f056c5c93ea8e593c8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(d_f8.is_nan() \u0026\u0026 d_deq.is_nan()) || (d_f8 - d_deq).abs() \u003C 1e-4\u0060 appears character-identically in 2 files \u2014 core/vector/operations/distance_cos.rs, core/vector/operations/distance_l2.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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"792fcccb4cb21e8b0dc40f38d46a6012914b3411e94dfaab365410fdd44883cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060database_id != crate::TEMP_DB_ID \u0026\u0026 resolver.has_temp_database()\u0060 appears character-identically in 2 files \u2014 core/translate/schema.rs, core/translate/trigger_exec.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":"core/translate/schema.rs"},"region":{"startLine":2369}}}],"partialFingerprints":{"codehealthFindingId/v1":"7723fcdfa53f91deb5c1650adea074dc98c66e5047bfc9d77c6142bc715b915e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060database_id == MAIN_DB_ID || database_id == TEMP_DB_ID\u0060 appears character-identically in 2 files \u2014 core/attach.rs, core/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":"core/attach.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"03a09f31be49728bdabd3dab5639f4c950a967816d3d5f8ae32ec4df189dbc94"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err.contains(\u0022no such\u0022) || err.contains(\u0022already exists\u0022) || err.contains(\u0022not exist\u0022)\u0060 appears character-identically in 2 files \u2014 testing/concurrent-simulator/lib.rs, testing/concurrent-simulator/multiprocess.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":"testing/concurrent-simulator/lib.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"e756104d62dfac1a367caecdf353c8e3ee33266335c06aaea13e0fb464427d85"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060extension_size == 0 \u0026\u0026 extension_record_count != 0\u0060 appears character-identically in 3 files \u2014 cli/sync_server.rs, core/mvcc/persistent_storage/logical_log.rs, sync/engine/src/database_sync_operations.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":"cli/sync_server.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9d37487ef03a49f62e1718162ea24ef5d45c104178056e1c4c1f7067c637ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060first_row.len() == 1 \u0026\u0026 first_row[0] == \u0022mvcc\u0022\u0060 appears character-identically in 2 files \u2014 testing/sqltest/src/backends/cli.rs, testing/sqltest/src/backends/js.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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"327fc2a375618f8f6d6c4847f6846e07d397be1b570282687dbef97c77310e44"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060frame_magic != MVCC_TX_FRAME_MAGIC \u0026\u0026 !has_extension_header\u0060 appears character-identically in 2 files \u2014 cli/sync_server.rs, sync/engine/src/database_sync_operations.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":"cli/sync_server.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"351f9cc8a0a5456e8afe9bdbfb88ce35afd63066293d5165b036572c583b82a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index.index_method.is_some() \u0026\u0026 !index.is_backing_btree_index()\u0060 appears character-identically in 2 files \u2014 core/translate/index.rs, core/translate/schema.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":"core/translate/index.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"7448fa480e673b48950745eafd2b52c2dda41f065117608b77696d2999973c4e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060program.trigger.is_some() \u0026\u0026 table.virtual_table().is_some()\u0060 appears character-identically in 3 files \u2014 core/translate/delete.rs, core/translate/insert.rs, core/translate/update.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":"core/translate/delete.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c8bae111f34b8e236c5d260b36934f43c0bf25ecc048bd674bc4f80fad761c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rowid_only || rhs_table.index_is_covering(index)\u0060 appears character-identically in 2 files \u2014 core/translate/optimizer/access_method.rs, core/translate/optimizer/multi_index.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":"core/translate/optimizer/access_method.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"a08f5c24250530f713533acbbf6520c26a85d1ceb3d938369d9400fbf8e8b746"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.contains(\u0027.\u0027) || s.contains(\u0027e\u0027) || s.contains(\u0027E\u0027)\u0060 appears character-identically in 2 files \u2014 core/translate/expr/custom_types.rs, core/translate/schema.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":"core/translate/expr/custom_types.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e906195941b6334ee125edef788c54eb5845b1cbd9b85704de39484b0999d268"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.buffer_setups \u0026\u0026 !self.setup_buffer.is_empty()\u0060 appears character-identically in 2 files \u2014 testing/sqltest/src/backends/cli.rs, testing/sqltest/src/backends/js.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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4909b1b1d17e84f1407ec78bd2bd1611672807b6baf65dfe6df2874d5064c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sql.starts_with(\u0022CREATE TRIGGER\u0022) || sql.starts_with(\u0022CREATE TEMP TRIGGER\u0022)\u0060 appears character-identically in 2 files \u2014 testing/differential-oracle/sql_gen/src/generate/stmt.rs, testing/differential-oracle/sql_gen_prop/create_trigger.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":"testing/differential-oracle/sql_gen/src/generate/stmt.rs"},"region":{"startLine":1892}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9013d386459b7e9ba460bcf9e98689c6ba42f0b50ca713833dee287e02f0a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sql.starts_with(\u0022SELECT\u0022) || sql.starts_with(\u0022WITH \u0022)\u0060 appears character-identically in 2 files \u2014 testing/differential-oracle/sql_gen_prop/lib.rs, testing/differential-oracle/sql_gen_prop/select.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":"testing/differential-oracle/sql_gen_prop/lib.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd6c70ae9e1155d579c545fc37b7347b113ac52cba9ce832436edd81b3e51fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subquery.correlated || rerun_for_target_scan\u0060 appears character-identically in 3 files \u2014 core/translate/emitter/delete.rs, core/translate/emitter/update.rs, core/translate/insert.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":"core/translate/emitter/delete.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"941fdfd6d307a9da2b482b3513a87ca9759ae2359dd3a5f19bcbff5eda457322"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060table_name.eq_ignore_ascii_case(crate::schema::TEMP_SCHEMA_TABLE_NAME) || table_name.eq_ignore_ascii_case(crate::schema::TEMP_SCHEMA_TABLE_N\u2026\u0060 appears character-identically in 2 files \u2014 core/translate/catalog.rs, core/translate/pragma.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":"core/translate/catalog.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1ac71751935a23661c0919db6bac35c6113ecdef116af93cc5e3b52e0acf91"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060v1_pos \u003C v1.idx.len() \u0026\u0026 v2_pos \u003C v2.idx.len()\u0060 appears character-identically in 4 files \u2014 core/vector/operations/distance_cos.rs, core/vector/operations/distance_dot.rs, core/vector/operations/distance_l2.rs, core/vector/operations/jaccard.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":"core/vector/operations/distance_cos.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"00932b3d1ced70b400f60cec15c68f6aa92a74114aeab7403c48181c9187fec9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value \u003C seq.min_value || value \u003E seq.max_value\u0060 appears character-identically in 2 files \u2014 core/dialect/engine.rs, testing/simulator/runner/env.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":"core/dialect/engine.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"de004ebae4928190df1dac0aa9543a6b8c3a194425d3c26ada473dc3edf3ce24"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060virtual_table.readonly() \u0026\u0026 !allow_dbpage_write\u0060 appears character-identically in 2 files \u2014 core/translate/insert.rs, core/vdbe/execute.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":"core/translate/insert.rs"},"region":{"startLine":3594}}}],"partialFingerprints":{"codehealthFindingId/v1":"c536482fec42df6661a5757934baa9e7cbd66cfd893bda537a0e0a63c2d9c28b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.Equals(\u0022ON\u0022, StringComparison.OrdinalIgnoreCase) || value.Equals(\u0022TRUE\u0022, StringComparison.OrdinalIgnoreCase) || value.Equals(\u0022YES\u0022, St\u2026\u0060 appears character-identically in 2 files \u2014 bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs, bindings/dotnet/src/Turso.Data/TursoCommand.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteCommand.cs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"0111f3bea2431c5c3bd2471f95bf403e7e310dc7722047b0978f0e607393300e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.ValueType == TursoValueType.Text \u0026\u0026 value.StringValue.Length == 1\u0060 appears character-identically in 2 files \u2014 bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs, bindings/dotnet/src/Turso.Data/TursoDataReader.cs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data.Sqlite/SqliteDataReader.cs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aaf53f40e3ff9e37320416945f1ea37d8e2e13c624f51c2f30bfabe871eef18"}},{"ruleId":"X5","level":"note","message":{"text":"Null-forgiving operator (\u0060!\u0060) suppressions override nullable warnings: ~0.6 \u0060!\u0060 suppressions per 1k syntax nodes \u2014 55 suppression(s) across the 84677 syntax node(s) in code where nullable warnings are ENABLED, which is the only code a \u0060!\u0060 can suppress anything in (a \u0060!\u0060 under \u0060#nullable disable\u0060 is inert and is not counted, and its file\u0027s nodes are not in the denominator). Each one tells the compiler to trust you about null, suppressing the very safety NRTs provide. 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":"4ae9a4afaefbfeb512a0b9a87d1bd44cd285ab1e804e4b89c8cf80f255687dfd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060HandleFullReadAsync\u0060 swallows \u0060FileNotFoundException\u0060 into \u0060return Task.CompletedTask;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.Data/TursoSyncDatabase.cs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f66897b89cfc72292fa7f20c09d44743ef6b2f923d0d18fd1857cab2014a28"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060Exists\u0060 swallows \u0060TursoSqliteException\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2689e3286f0cf19272c131daf42e30ad4f8da02fc8fb21803f4de8703e9392f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060ExistsAsync\u0060 swallows \u0060TursoSqliteException\u0060 into \u0060return false;\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let validation throw."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/dotnet/src/Turso.EntityFrameworkCore.Sqlite/Storage/Internal/TursoSqliteDatabaseCreator.cs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38bd2457d2e7959661365a2b3baa309ac13d040501c526449c8ddf8af50c696"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sqlite3_db_readonly\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":"bindings/c/src/lib.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"6496c7981d8de7c0326feaffe12fbf44504fd92bbaaf4336460a9dec98e2ace9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060database_readonly\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":"bindings/c/src/lib.rs"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ab48364fbd622d7cd7df9b51fc0666f503dd3862512e5896a2923de8538792"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sqlite3_bind_parameter_index\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":"bindings/c/src/lib.rs"},"region":{"startLine":1968}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e648af88e48968bd005953a64855174ce6c75df80fdaddebf3387e6bc42c3d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060from_env_or_default\u0060 turns every \u0060Err\u0060 into \u0060Self::default()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"core/translate/optimizer/cost_params.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0678a71a9e51adefd48ca7d567ac16de473cc1198abc5b813881b94ba7881f4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060transliterate_str\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":"extensions/fuzzy/src/translit.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b5ad49b1dab38a3cef718acd78cfeba210560378db895bcfdbd9c446947749"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060turso_connection_last_insert_rowid\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":"sdk-kit/src/capi.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa823a0132bcf218146b679c34039aea997a1b293f6ba538df07e60ad8f0a6e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060turso_statement_n_change\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":"sdk-kit/src/capi.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd07f908d092ab07046b77d641ba8208d4d3bb26dc9cea1290a6e93f843a7f3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060turso_statement_column_count\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":"sdk-kit/src/capi.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a58d826e4c59783f3ee6f1f38a88b5bbf2c6c47dc50b1579ed493d020831e0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060turso_statement_column_array_dimensions\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":"sdk-kit/src/capi.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1a84f9754586d54a710edca6b54c7254ef2aa123cf48d17c2626c736941edf"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060turso_statement_named_position\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":"sdk-kit/src/capi.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b5965c3053c751efe3da2b450378c8cde0d3b5d7354f4f179c8eaf85cdae52"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060turso_statement_parameters_count\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":"sdk-kit/src/capi.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51c7df4d7ee91f800e7aa2c6aa6f10187c2e0c5f7e4abf69ce76798c446015b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060workerImports.lookup_file\u0060 swallows every exception into \u0060return -1\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1127c551ec2a83e111fcdb61daab23905010f3fa03007f17d5798d21a273f333"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060workerImports.read\u0060 swallows every exception into \u0060return -1\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"693ee8aae5c9e8f2dfd87ef8f027b25fd329b0cfcf7c343987194e7287c0ad15"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060workerImports.write\u0060 swallows every exception into \u0060return -1\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"3434b5be6cd2783dd8f27b8de558a0fe77d0e4c38ca73fdc6ba90bcc5b1f467e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060workerImports.sync\u0060 swallows every exception into \u0060return -1\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d17e35549c72157e4b35aad6a5a0ba4dbdbc568db325eb98f71a07aae2e211f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060workerImports.size\u0060 swallows every exception into \u0060return -1\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bindings/javascript/packages/wasm-common/index.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f31e3118b01cbcf813e6fbe1a810c39de3452e0ae9a94699712286dd87c91e72"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060file_name.starts_with(\u0022tursodb\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060file_name.starts_with(\u0022tursodb\u0022)\u0060 also satisfies \u0060file_name.starts_with(\u0022turso\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":"testing/sqltest/src/backends/cli.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"b011d27c1030b3a35fdfd94273675270d080b938c285470cfb67a426f0abdb54"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060where_part.contains(\u0022NOT IN (SELECT\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060where_part.contains(\u0022NOT IN (SELECT\u0022)\u0060 also satisfies \u0060where_part.contains(\u0022IN (SELECT\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":"testing/differential-oracle/sql_gen/src/generate/expr.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f4a19a44c9fe3f239f2b109414037e8b99dcef1436ccc248d9f274e4452533b"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060sql.contains(\u0022 NOT IN (SELECT\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060sql.contains(\u0022 NOT IN (SELECT\u0022)\u0060 also satisfies \u0060sql.contains(\u0022 IN (SELECT\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":"testing/differential-oracle/sql_gen/src/generate/expr.rs"},"region":{"startLine":1079}}}],"partialFingerprints":{"codehealthFindingId/v1":"93339cb17ba4f1b5fb32bec3686975ebc3c2291cac669ecec2e0f92a66c8dc5d"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060eidx.expr_sql.contains(\u0022LOWER(union_tag(\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060eidx.expr_sql.contains(\u0022LOWER(union_tag(\u0022)\u0060 also satisfies \u0060eidx.expr_sql.contains(\u0022union_tag(\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9b1e7d6f32fe64bb9347ed281faf7e19df61b6675ac342fb204210d8e5301fd"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060eidx.expr_sql.contains(\u0022LOWER(union_tag(\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060eidx.expr_sql.contains(\u0022LOWER(union_tag(\u0022)\u0060 also satisfies \u0060eidx.expr_sql.contains(\u0022union_tag(\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bd844e4bf58cad7e28afc3b92113149f1be1cac2473f90207664e0a532408e"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060eidx.expr_sql.contains(\u0022LOWER(union_tag(\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060eidx.expr_sql.contains(\u0022LOWER(union_tag(\u0022)\u0060 also satisfies \u0060eidx.expr_sql.contains(\u0022union_tag(\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":"testing/differential-oracle/fuzzer/custom_types_fuzzer.rs"},"region":{"startLine":1633}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2fe168df603b74a1125493d5c3992601268f798fd1566658b976910101db1a"}}],"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-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-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-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-22","guid":"b68d9ca7-bdde-d057-a6cc-9f8b1e739552","name":"Improper Limitation of a Pathname to a Restricted Directory (\u0027Path Traversal\u0027)","shortDescription":{"text":"Improper Limitation of a Pathname to a Restricted Directory (\u0027Path Traversal\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/22.html"},{"id":"CWE-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-250","guid":"52ee12e8-390a-7351-b1e6-388afa694e54","name":"CWE-250","shortDescription":{"text":"CWE-250"},"helpUri":"https://cwe.mitre.org/data/definitions/250.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-327","guid":"e51910ff-67b5-3c51-aa3d-92837d9eab90","name":"Use of a Broken or Risky Cryptographic Algorithm","shortDescription":{"text":"Use of a Broken or Risky Cryptographic Algorithm"},"helpUri":"https://cwe.mitre.org/data/definitions/327.html"},{"id":"CWE-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)","shortDescription":{"text":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)"},"helpUri":"https://cwe.mitre.org/data/definitions/338.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-416","guid":"5033f6dd-9f76-b45d-8413-c4eaaa64ba48","name":"CWE-416","shortDescription":{"text":"CWE-416"},"helpUri":"https://cwe.mitre.org/data/definitions/416.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-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-774","guid":"1f106c99-e661-f652-9f44-6c215ac7b404","name":"CWE-774","shortDescription":{"text":"CWE-774"},"helpUri":"https://cwe.mitre.org/data/definitions/774.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-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"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":937,"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."]}]}