{"$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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D40","name":"Network Egress Confinement","shortDescription":{"text":"Network Egress Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D40"},{"id":"D41","name":"Kernel \u0026 Syscall Confinement","shortDescription":{"text":"Kernel \u0026 Syscall Confinement"},"helpUri":"https://codehealth.canine.dev/dimensions/D41"},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXA1","name":"Runtime unauthenticated reachability","shortDescription":{"text":"Runtime unauthenticated reachability"},"helpUri":"https://codehealth.canine.dev/dimensions/AXA1"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"AXH1","name":"Runtime security headers","shortDescription":{"text":"Runtime security headers"},"helpUri":"https://codehealth.canine.dev/dimensions/AXH1"},{"id":"AXI1","name":"Runtime container hardening","shortDescription":{"text":"Runtime container hardening"},"helpUri":"https://codehealth.canine.dev/dimensions/AXI1"},{"id":"AXR1","name":"Runtime accessibility (rendered)","shortDescription":{"text":"Runtime accessibility (rendered)"},"helpUri":"https://codehealth.canine.dev/dimensions/AXR1"},{"id":"AXS1","name":"Runtime exposed surface","shortDescription":{"text":"Runtime exposed surface"},"helpUri":"https://codehealth.canine.dev/dimensions/AXS1"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"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":"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":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"SQLPlanner::plan_expr (cyclomatic 136): SQLPlanner::plan_expr has cyclomatic complexity 136 (threshold 15). Of this number, 113 points are the body\u0027s own statements and 23 belong to 2 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"553cf710930dee39ed388a7f05b47c0d516f050ddb98f2231c5c2e573644a78e"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_core::utils::supertype::get_supertype::inner (cyclomatic 125): daft_core::utils::supertype::get_supertype::inner has cyclomatic complexity 125 (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":"src/daft-core/src/utils/supertype.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1858767261160a5397bf7ea0a5e88cc81da424e60352fdf06620c8cac3bfe329"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_local_execution::pipeline::physical_plan_to_pipeline (cyclomatic 81): daft_local_execution::pipeline::physical_plan_to_pipeline has cyclomatic complexity 81 (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":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"144431cc527aa691371bc6c81b381c2a171a5fc8bfc4e97a7e835ddf584bc1b4"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordBatch::eval_expression_async_with_metrics (cyclomatic 73): RecordBatch::eval_expression_async_with_metrics has cyclomatic complexity 73 (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 shape REPEATS in the file: one other method here (RecordBatch::eval_expression_internal) 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"debef2d420cf8a7eba73a67261459f15bc581caebb1c7895f22176738347ef31"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordBatch::eval_expression_internal (cyclomatic 73): RecordBatch::eval_expression_internal has cyclomatic complexity 73 (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 shape REPEATS in the file: one other method here (RecordBatch::eval_expression_async_with_metrics) 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcdebd0e0f65d6873d355ef4f4364b650abe9d7cce84fd2a68d61341901a67ff"}},{"ruleId":"D1","level":"warning","message":{"text":"DataType.infer_from_type (cyclomatic 64): DataType.infer_from_type has cyclomatic complexity 64 (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":"daft/datatype.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6af621e1e7284cbabf6bd1b8d072732fbbb10ca2d13265241de4ed4d3751709"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_sql::schema::sql_dtype_to_dtype (cyclomatic 56): daft_sql::schema::sql_dtype_to_dtype has cyclomatic complexity 56 (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":"src/daft-sql/src/schema.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7cf69425d9c67ed2ec42fc9cd72219c22e3a355f25c3cd05a09cad8a58b5c2"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_core::series::from_lit::series_from_literals_iter (cyclomatic 54): daft_core::series::from_lit::series_from_literals_iter 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":"src/daft-core/src/series/from_lit.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5235e47fdb476beea6b245864cb9444d7b820c4f0fd5b62a2595aa8f95dc07c2"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_local_plan::translate::translate_helper (cyclomatic 50): daft_local_plan::translate::translate_helper has cyclomatic complexity 50 (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":"src/daft-local-plan/src/translate.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c480062b747312a4f1a4404fb79b24d3ee4bf3c309ed04cfe53eaffde3b700"}},{"ruleId":"D1","level":"warning","message":{"text":"DataType::fmt (cyclomatic 49): DataType::fmt has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-schema/src/dtype.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5cda4d0e460aba132eb2404c9d682c10baa8b7297d46032cf17e48605e8e21"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::to_field (cyclomatic 47): Expr::to_field 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed571ce4a6deef10a5c8d964b6d2a34f3b67f3330103547932f7bd2f8c68a50d"}},{"ruleId":"D1","level":"warning","message":{"text":"Literal::into_pyobject (cyclomatic 46): Literal::into_pyobject 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":"src/daft-core/src/lit/python.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f8b4daeb9aeb286419a2f23a690b74f77b468e3c03476125f604f764724650"}},{"ruleId":"D1","level":"warning","message":{"text":"PushDownProjection::try_optimize_project (cyclomatic 46): PushDownProjection::try_optimize_project has cyclomatic complexity 46 (threshold 15). 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, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0e44bdac50781f5bf324fb1e1fdb7d0b86611132654977f67f441c8ed76b9b"}},{"ruleId":"D1","level":"warning","message":{"text":"GlobScanOperator::try_new (cyclomatic 46): GlobScanOperator::try_new 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/glob.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca9ae48d4ba1d705dc0c9affb03967d74438a088f9ed726d9dc6859a835e178"}},{"ruleId":"D1","level":"warning","message":{"text":"Literal::from_pyobj (cyclomatic 45): Literal::from_pyobj 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":"src/daft-core/src/lit/python.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b951c8d5eae7ef17cad6776094c89a9508043b25530dbdca6336cd09196e786"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_scan::expr_rewriter::rewrite_predicate_for_partitioning (cyclomatic 44): daft_scan::expr_rewriter::rewrite_predicate_for_partitioning 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":"src/daft-scan/src/expr_rewriter.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a4560ddd88ba0f7b63299622b674df011cfb5a0306fdb4bbd291081f68c12f"}},{"ruleId":"D1","level":"warning","message":{"text":"page.QueryPageInner (cyclomatic 44): page.QueryPageInner has cyclomatic complexity 44 (threshold 15). Of this number, 37 points are the body\u0027s own statements and 7 belong to 5 function literals 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":"src/daft-dashboard/frontend/src/app/query/page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8be8439bf0429255da17a59cc568147058d2fbf72f321c74b1e747d42edbc19"}},{"ruleId":"D1","level":"warning","message":{"text":"DataType.from_arrow_type (cyclomatic 42): DataType.from_arrow_type has cyclomatic complexity 42 (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":"daft/datatype.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"8753b8fd875f4f250d1cb7c7744cd7f5627480887ba302e4f5cfee0601aad9ca"}},{"ruleId":"D1","level":"warning","message":{"text":"PushDownFilter::try_optimize_node (cyclomatic 41): PushDownFilter::try_optimize_node 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":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d955496a2fb8b32072de388b604b01dfec8481da1e98e68f7e93a477c841e4"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_logical_plan::ops::project::replace_column_with_semantic_id (cyclomatic 41): daft_logical_plan::ops::project::replace_column_with_semantic_id 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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"67564d26865c088275754a0c8842ec0c96a0782c50ef75bf848272001a3ce44c"}},{"ruleId":"D1","level":"warning","message":{"text":"PyDaftExecutionConfig::with_config_values (cyclomatic 40): PyDaftExecutionConfig::with_config_values has cyclomatic complexity 40 (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":"src/common/daft-config/src/python.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c578f94ec353b72f55b5ce138f2c787415a96897093c8870aba5306e5e05efcf"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.write_iceberg (cyclomatic 40): DataFrame.write_iceberg has cyclomatic complexity 40 (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":"daft/dataframe/dataframe.py"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e883b8b511987faf22f23c3fb8ea504990d4b61c9e99184bf9ede93f912430a"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.write_deltalake (cyclomatic 40): DataFrame.write_deltalake 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":"daft/dataframe/dataframe.py"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ee8e5d7584aa8c35a773515c58999f61a003a601b23491adb51e154ca12d96"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoFile._frames (cyclomatic 39): VideoFile._frames 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":"daft/file/video.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fbe1b3a7d5ae8ab3c8f64dffde713b05d25d3a1a437254fe4dab0abdc950990"}},{"ruleId":"D1","level":"warning","message":{"text":"__postgres._daft_dtype_to_postgres_type (cyclomatic 37): __postgres._daft_dtype_to_postgres_type has cyclomatic complexity 37 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4cfad521ef2242b275bff7f50f787d6d0ecf414617ba0e2fdce2f0f9ed92ea"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_decoding::deserialize::deserialize_bytes_to_array (cyclomatic 36): daft_decoding::deserialize::deserialize_bytes_to_array has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-decoding/src/deserialize.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44ff6f508f2add959b52fa56d5d16e79b3442b3cafcf4205ab366ea5651d55e"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLPlanner::plan_query (cyclomatic 36): SQLPlanner::plan_query has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c256d724fc0f24f82250233c360e4de4bdd23ad17f57bdfab91e80a63f12188"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalPlanToPipelineNodeTranslator::f_up (cyclomatic 35): LogicalPlanToPipelineNodeTranslator::f_up 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":"src/daft-distributed/src/pipeline_node/translate.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfdd2a14ea191b21619f320c0df3c2bff4072c4f4625bcd472998c704633d8c"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::name (cyclomatic 33): Expr::name 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. This is NOT this file\u0027s highest cyclomatic complexity: Expr::semantic_id (cyclomatic 35) 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2258}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ce3e0a01ade4373c209cc6fdeadadf22c8676d0e78f066875189e875c690e1"}},{"ruleId":"D1","level":"warning","message":{"text":"AggExpr::to_field (cyclomatic 33): AggExpr::to_field 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. This is NOT this file\u0027s highest cyclomatic complexity: Expr::semantic_id (cyclomatic 35) 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e320ded5be188ba970e12ceb890d1a40355662254689f4366cc2797f528c61b4"}},{"ruleId":"D1","level":"warning","message":{"text":"PushDownLimit::try_optimize_node (cyclomatic 33): PushDownLimit::try_optimize_node 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":"src/daft-logical-plan/src/optimization/rules/push_down_limit.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f2474eadc3b9527510e5efe834554c795a23188bc8ec1c5d7d140d32c0fef0c"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_logical_plan::ops::project::replace_column_with_semantic_id_aggexpr (cyclomatic 32): daft_logical_plan::ops::project::replace_column_with_semantic_id_aggexpr 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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2dc04c11efef137fa915a2385bee9a9128d37d53758b1685181d52cbadc27e"}},{"ruleId":"D1","level":"warning","message":{"text":"RecordBatch::eval_agg_expression (cyclomatic 32): RecordBatch::eval_agg_expression 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac322fb76b1e1fdb719ce6f8f1fcd59725baaf0c3eb3f734b9b8af6eb7b15b1"}},{"ruleId":"D1","level":"warning","message":{"text":"DataArray::cast (cyclomatic 31): DataArray::cast 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":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71224611fa33618f2121a48f9e26396bbca1a01fb9d197bede6c74812364ef2"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_io::object_store_glob::glob::visit (cyclomatic 31): daft_io::object_store_glob::glob::visit 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":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"99e1fe91506e4b2c3871b51e72df6da07616a08e31f9d15b86a9f5e8231129ad"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_local_plan::agg::populate_aggregation_stages_bound_with_schema (cyclomatic 31): daft_local_plan::agg::populate_aggregation_stages_bound_with_schema has cyclomatic complexity 31 (threshold 15). Of this number, 30 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":"src/daft-local-plan/src/agg.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"726a210a73bb8a44a9837c365042a7ca923134d76e91dc830c47ffe7952084be"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicalPlan::required_columns (cyclomatic 31): LogicalPlan::required_columns 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. This is NOT this file\u0027s highest cyclomatic complexity: LogicalPlan::with_new_children (cyclomatic 35) 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":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"84de8d5c13a0e53a94f3bb1fc9da969827834b5f283fc53b542bfcdf00f3bff4"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaLakeDataSource._get_scan_tasks (cyclomatic 30): DeltaLakeDataSource._get_scan_tasks 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":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7e3cf467be0b99d1c7cf5e62dad4e7b843a4662b0c9585235bd17182592be5"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_recordbatch::ops::inline_agg::try_create_accumulator (cyclomatic 29): daft_recordbatch::ops::inline_agg::try_create_accumulator 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. This is NOT this file\u0027s highest cyclomatic complexity: AggAccumulator::init_groups (cyclomatic 41) 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b9490a1777f41258e6ee796f570c7b588b8a02bb0d07e43156ecd37ce38a22"}},{"ruleId":"D1","level":"warning","message":{"text":"Error::from (cyclomatic 27): Error::from has cyclomatic complexity 27 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 3 belong 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":"src/daft-io/src/s3_like.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7782da049001da6029ffa0ea78e45839816d137cfc15b619410a656c0b28aba"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.write_lance (cyclomatic 27): DataFrame.write_lance has cyclomatic complexity 27 (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":"daft/dataframe/dataframe.py"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ff8b8c8189b1c962c4b9762673a0422bd3fad70ae49ab53865b801ba92f6bd"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_recordbatch::ops::joins::merge_join::merge_inner_join (cyclomatic 26): daft_recordbatch::ops::joins::merge_join::merge_inner_join has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/merge_join.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba7c3472cf9567da52b137fd0840b9180433142a9ad8c1e5565dee60736f9bc"}},{"ruleId":"D1","level":"warning","message":{"text":"DataType::estimate_size_bytes (cyclomatic 26): DataType::estimate_size_bytes has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: DataType::try_from (cyclomatic 32) 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":"src/daft-schema/src/dtype.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca69e75b006e4ade6dbb40c5d60d20f509ef64ca9c6adc2c1738d2206c508dc4"}},{"ruleId":"D1","level":"warning","message":{"text":"_colab_compat.clean_pydantic_model (cyclomatic 26): _colab_compat.clean_pydantic_model 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":"daft/functions/ai/_colab_compat.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7edc56ef5b9279899623e736ced53cc602a5eb40ea366d881ba8e6452fc259"}},{"ruleId":"D1","level":"warning","message":{"text":"S3Config::multiline_display (cyclomatic 25): S3Config::multiline_display has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/s3.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"641755376f2cf62539ff13799e1e1bfe3ac26058e1d66feac090b12f4be9cd0f"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_writers::csv_writer::make_csv_writer::transform_batch (cyclomatic 25): daft_writers::csv_writer::make_csv_writer::transform_batch has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2d6523b9e6a1eb63dd59cd7c6bbcf6341e68dd262d2b7bbabf4abd36425f30"}},{"ruleId":"D1","level":"warning","message":{"text":"physical-plan-tree.PhysicalNodeCard (cyclomatic 25): physical-plan-tree.PhysicalNodeCard has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dafbcbdcced438d426ed4bd598311e0831c68a68936ee5ed352978dc50d5292"}},{"ruleId":"D1","level":"warning","message":{"text":"InferDataType::add (cyclomatic 24): InferDataType::add 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. This is NOT this file\u0027s highest cyclomatic complexity: daft_core::datatypes::infer_datatype::try_numeric_supertype::inner (cyclomatic 67) 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":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c1b5e8280df2898314fa5ddd105cc2f6f702c1a4ab9474b6ef60db34d6808f"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_io::s3_like::build_s3_conf (cyclomatic 24): daft_io::s3_like::build_s3_conf 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":"src/daft-io/src/s3_like.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a61bdbed1b62f55253bb56fadabf63610e63698c7fa55e93f00719c1b8948a94"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::to_sql::to_sql_inner (cyclomatic 23): Expr::to_sql::to_sql_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. This is NOT this file\u0027s highest cyclomatic complexity: Expr::semantic_id (cyclomatic 35) 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b3e02de1973f5e84d796cc94542dde1b0d130632fb9283c63f077cc6fed62d"}},{"ruleId":"D1","level":"warning","message":{"text":"PushDownAntiSemiJoin::try_optimize (cyclomatic 23): PushDownAntiSemiJoin::try_optimize 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":"src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d821dc78614a17b683b38a98f6d131eb4bd3845fa411e9f64d691b89ef4a4fae"}},{"ruleId":"D1","level":"warning","message":{"text":"WarcRecordBatchIterator::read_chunk (cyclomatic 23): WarcRecordBatchIterator::read_chunk 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":"src/daft-warc/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"4457e33ae53a856fd2b0606dffb464a287bda8f872ecf86116923d3049660391"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaSourceTask.read (cyclomatic 23): KafkaSourceTask.read 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":"daft/io/_kafka.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb2c1120666b3a21a2664d0eefa41301df33c3b185d6b02055316bbb7db157b"}},{"ruleId":"D1","level":"warning","message":{"text":"_kafka._normalize_bound (cyclomatic 23): _kafka._normalize_bound 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":"daft/io/_kafka.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23c96a41269132e08ec48e388aca89a99070974bc8b3c70ffdf47a383d21075"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_core::array::ops::comparison::compare_struct_value (cyclomatic 22): daft_core::array::ops::comparison::compare_struct_value 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":"src/daft-core/src/array/ops/comparison.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b03dec520e4a6ec7bc9b1a387c8d854ea7cd4ec70c28f6604b7e273dad8c4e"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_json::inference::coerce_data_type (cyclomatic 22): daft_json::inference::coerce_data_type 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":"src/daft-json/src/inference.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"758652138fa938968939286b6ac2e9d09501f49a33977a42c5263ced122fc71e"}},{"ruleId":"D1","level":"warning","message":{"text":"RuntimeStatsManager::new_impl (cyclomatic 22): RuntimeStatsManager::new_impl 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":"src/daft-local-execution/src/runtime_stats/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"393c3eacd87ba60b5f41ad7f0cfaaef474184137fc201e575596123fe92951e7"}},{"ruleId":"D1","level":"warning","message":{"text":"tasks-sidebar.TasksSidebar (cyclomatic 22): tasks-sidebar.TasksSidebar has cyclomatic complexity 22 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a248aff87e4cfd5a799def36b83f979d3e8779700357c00c66d89b9d7d06859c"}},{"ruleId":"D1","level":"warning","message":{"text":"IOClient::get_source_and_path (cyclomatic 21): IOClient::get_source_and_path 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":"src/daft-io/src/lib.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"1931f1ad8cd49db22569d0aaba7301fe0582f8c108d9cb5c2cb779f998a49b32"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_io::parse_url (cyclomatic 21): daft_io::parse_url 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":"src/daft-io/src/lib.rs"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f803ff3da1514085dab37900b24133cd88f6637c03329d3157ed602a395e4b3"}},{"ruleId":"D1","level":"warning","message":{"text":"RayRunner.run_iter (cyclomatic 21): RayRunner.run_iter 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":"daft/runners/ray_runner.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0d5aa359274e91df5f95f148643aea06b99b2879bb1cd8ad51c36f42fdf7d6"}},{"ruleId":"D1","level":"warning","message":{"text":"Literal::neg (cyclomatic 20): Literal::neg has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: Literal::fmt (cyclomatic 34) 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":"src/daft-core/src/lit/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"01c7f5a6981cb9f40c4b120a33ab96e93eaf537f4ea2ff0579239dbd12dde156"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_dashboard::engine::apply_query_end (cyclomatic 20): daft_dashboard::engine::apply_query_end 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":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42c17adc818678d622bb172d7350baa39b9731c3112c4fda104cc3bf1c5ff2c"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_file::file::guess_mimetype_from_content (cyclomatic 20): daft_file::file::guess_mimetype_from_content 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":"src/daft-file/src/file.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86504f2bf73febc741bca0181c1ca07fde2726379c5ef983e33e5b53d568971"}},{"ruleId":"D1","level":"warning","message":{"text":"ScanTaskSource::spawn_scan_task_processor (cyclomatic 20): ScanTaskSource::spawn_scan_task_processor 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":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c2862f2ca98bdcd7f246015ed4efe9c18979232a5ff5f72fb2bd06730090b0"}},{"ruleId":"D1","level":"warning","message":{"text":"JoinGraphBuilder::process_linear_chain (cyclomatic 20): JoinGraphBuilder::process_linear_chain 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":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9bc509ddb43b991026afcb607879842bd7e1e508fccac8c76e903866ea0737a"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLPlanner::plan_relation (cyclomatic 20): SQLPlanner::plan_relation 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f058c00d43c9b141091971a948610e7b4d3ee284445b64104a83eaab307d86"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.skip_existing (cyclomatic 20): DataFrame.skip_existing 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":"daft/dataframe/dataframe.py"},"region":{"startLine":3394}}}],"partialFingerprints":{"codehealthFindingId/v1":"49151d79ff0467f541f4fcde22d39bc8ccd30aade657ea2a297ca67a5a9c8c3a"}},{"ruleId":"D1","level":"warning","message":{"text":"KafkaSource.get_tasks (cyclomatic 20): KafkaSource.get_tasks 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":"daft/io/_kafka.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"6616e2c63a92425fa8b498bfc5ff3765dba6d7cb28b811de69add3a15fb8dab5"}},{"ruleId":"D1","level":"warning","message":{"text":"DeltaLakeDataSource.__init__ (cyclomatic 20): DeltaLakeDataSource.__init__ 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":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c850d658b6308cd6b0bb8a82ef0057b7ba741cde44ee5fc3af8a6db25d7abb"}},{"ruleId":"D1","level":"warning","message":{"text":"ProbeExecutionContext::process_probe_input (cyclomatic 19): ProbeExecutionContext::process_probe_input has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/probe.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f92e86745ee430717246f93c9d4ce410e9cb3f6e4c2f38b59ff1482ee498cc"}},{"ruleId":"D1","level":"warning","message":{"text":"filesystem._build_filesystem (cyclomatic 19): filesystem._build_filesystem 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":"daft/filesystem.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a80ae6d4ecce2b56b0413605978433448aa43410d2a2a2a3bd32a9c34f49f080"}},{"ruleId":"D1","level":"warning","message":{"text":"PaimonDataSource.get_tasks (cyclomatic 19): PaimonDataSource.get_tasks 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":"daft/io/paimon/paimon_scan.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bae054597fc04801bc714ef706c008395d4d583f34141191290a6dcfa75de8"}},{"ruleId":"D1","level":"warning","message":{"text":"physical-plan-tree.PhysicalPlanTree (cyclomatic 19): physical-plan-tree.PhysicalPlanTree has cyclomatic complexity 19 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 5 belong to 2 function literals 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":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b927b568b23f5383333843945aaa45bdc5aab676efe81a607290f2e6f547810"}},{"ruleId":"D1","level":"warning","message":{"text":"DataArray::clip (cyclomatic 18): DataArray::clip 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":"src/daft-core/src/array/ops/clip.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd16cad3b94500a607499ce9f39bd3d9ee4f7fe58a3d0565ec26253d8d79e63"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_core::array::ops::if_else::generic_if_else (cyclomatic 18): daft_core::array::ops::if_else::generic_if_else 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":"src/daft-core/src/array/ops/if_else.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f854be52f87d82f930d22a05ec746b94f72710428a5d6d94a13c04e23045374d"}},{"ruleId":"D1","level":"warning","message":{"text":"RayWorkerManager::retire_idle_workers (cyclomatic 18): RayWorkerManager::retire_idle_workers 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":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a3c571783d2b4579c45e2fa548028c8917cd60b68b47015e4a92d062600547"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_functions_serde::format::json::coerce_json_value (cyclomatic 18): daft_functions_serde::format::json::coerce_json_value 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":"src/daft-functions-serde/src/format/json.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7f2b2f12a45a7b3419ace7e047e0c1f18311ec9eded9e50ab066eb7c9989ea"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitGranularProjection::try_optimize_node (cyclomatic 18): SplitGranularProjection::try_optimize_node 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":"src/daft-logical-plan/src/optimization/rules/granular_projections.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"acea9a6c85273ff98cf017cd8845d2f532673963b33f706495a4e62b68da2c8a"}},{"ruleId":"D1","level":"warning","message":{"text":"McapReader::new (cyclomatic 18): McapReader::new 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":"src/daft-mcap/src/read.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"921c4e2e8a519cf47da70e2b45b6e05d7696114f2165f328745b8fd65b9e91ab"}},{"ruleId":"D1","level":"warning","message":{"text":"SQLPlanner::plan_single_from (cyclomatic 18): SQLPlanner::plan_single_from 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"6867151477ef402de834b0b526219378bc2dfbcda632d470565ebc04309d2f47"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_writers::json_writer::make_json_writer::transform_batch (cyclomatic 18): daft_writers::json_writer::make_json_writer::transform_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":"src/daft-writers/src/json_writer.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca3550c616e2d6c83eb4b3eb90f301a9ffa28b65661544e15b2dcdbcd2eeb39"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_algebra::simplify::boolean::simplify_binary_compare (cyclomatic 18): daft_algebra::simplify::boolean::simplify_binary_compare 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":"src/daft-algebra/src/simplify/boolean.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"665e6796741eca9da742f42d48e889744e41f10397588cbe4681f4a143939e1b"}},{"ruleId":"D1","level":"warning","message":{"text":"_client._io_config_from_storage_location (cyclomatic 18): _client._io_config_from_storage_location 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":"daft/catalog/__gravitino/_client.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"418dfc81437c19af7a10517175f3089549b93e2501f3b0255880af8b88cdba78"}},{"ruleId":"D1","level":"warning","message":{"text":"UdfHandle.eval_input (cyclomatic 18): UdfHandle.eval_input 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":"daft/execution/udf.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b069f09be391344d1050419b798f936ad5291e519d82f1736038a4ce623defdc"}},{"ruleId":"D1","level":"warning","message":{"text":"flotilla.start_ray_workers (cyclomatic 18): flotilla.start_ray_workers 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":"daft/runners/flotilla.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"9753ccf53970b7ec2600b638faa1fbcc8793b45fc634875ec0c5f310ae47ccf2"}},{"ruleId":"D1","level":"warning","message":{"text":"Func.__call__ (cyclomatic 18): Func.__call__ 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 shape REPEATS in the file: 3 other methods here (Func.__call__, Func.__call__, Func.__call__) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"daft/udf/udf_v2.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"c024b75bfdd93a1c76e2111a26fd2353dc6163d15281871f50dbbdf34b14ae16"}},{"ruleId":"D1","level":"warning","message":{"text":"Func.__call__ (cyclomatic 18): Func.__call__ 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 shape REPEATS in the file: 3 other methods here (Func.__call__, Func.__call__, Func.__call__) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"daft/udf/udf_v2.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a13ec9368e292a38c30a3882870090197b5e90e1767c4c14b9ca70f6fd090d"}},{"ruleId":"D1","level":"warning","message":{"text":"Func.__call__ (cyclomatic 18): Func.__call__ 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 shape REPEATS in the file: 3 other methods here (Func.__call__, Func.__call__, Func.__call__) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"daft/udf/udf_v2.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b86cc5c92bb07dc46562c3b352c49e4711a47cee8c2bf60d8937c94116c9651"}},{"ruleId":"D1","level":"warning","message":{"text":"Func.__call__ (cyclomatic 18): Func.__call__ 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 shape REPEATS in the file: 3 other methods here (Func.__call__, Func.__call__, Func.__call__) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"daft/udf/udf_v2.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"dada240eac0ed969c052ab6c9759726ba6130a10fff7265e9e478013c4df1fe5"}},{"ruleId":"D1","level":"warning","message":{"text":"Image::deserialize (cyclomatic 17): Image::deserialize 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":"src/common/image/src/image.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d451ab5327ad13eea43eb13e0e2d7e3377def306d9754e369191c9065a6397"}},{"ruleId":"D1","level":"warning","message":{"text":"GooseFSConfig::to_opendal_config (cyclomatic 17): GooseFSConfig::to_opendal_config has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/goosefs.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b306a38fe5c1819577f487bcbe0f91f68cbf603eb70f1a5c0f3c6d9fa3f4dc"}},{"ruleId":"D1","level":"warning","message":{"text":"StructArray::cast (cyclomatic 17): StructArray::cast 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":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"727ca874430b08ac6e4e3a2aaaf10e7891930d0027e57732f4605b7668eac530"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_core::kernels::hashing::hash (cyclomatic 17): daft_core::kernels::hashing::hash 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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae014664fa8ce7bcd0f94f03b05b9143287241fb1610dfd07e46f6abcb9161d"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_core::kernels::search_sorted::search_sorted_boolean_array (cyclomatic 17): daft_core::kernels::search_sorted::search_sorted_boolean_array 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":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"a811a8d1c5e50c9e8bca71aead4c10b4f24f2a5708a1bb603bb2d9a0cbf9d581"}},{"ruleId":"D1","level":"warning","message":{"text":"AzureBlobSource::list_directory_delimiter_stream (cyclomatic 17): AzureBlobSource::list_directory_delimiter_stream has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfc4e22ed6e390cd764e1bfcc7f983c751fcfcc410e387e126b88439888cdf1"}},{"ruleId":"D1","level":"warning","message":{"text":"Error::from (cyclomatic 17): Error::from has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 4 belong 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":"src/daft-io/src/google_cloud.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2404e64939c1486534f46df173ae57b6fabbef84843231dc4dcd6ff46d07c196"}},{"ruleId":"D1","level":"warning","message":{"text":"Window::multiline_display (cyclomatic 17): Window::multiline_display 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":"src/daft-logical-plan/src/ops/window.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc74d74d30dd52f733130cadbbe9a9fa2d043e97144410000691fb8d4450ace4"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.join_asof (cyclomatic 17): DataFrame.join_asof 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":"daft/dataframe/dataframe.py"},"region":{"startLine":4125}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34b68f4460f1aa18fdd2754909c1ee50199709f3d1468078cce645f0e45b728"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoFile.get_frame_by_idx (cyclomatic 17): VideoFile.get_frame_by_idx 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":"daft/file/video.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5d4ac7e2e0f43dd8b91bf05a3d62ecf16132a8328defb7e8445ca0a8b08dd7"}},{"ruleId":"D1","level":"warning","message":{"text":"_VideoFramesSourceTask._list_frames (cyclomatic 17): _VideoFramesSourceTask._list_frames 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":"daft/io/av/_read_video_frames.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda419e92aaf9cd8dacc99cce45a998df09cb24aa851243984333d8329076613"}},{"ruleId":"D1","level":"warning","message":{"text":"IOConfig::multiline_display_for_backends (cyclomatic 16): IOConfig::multiline_display_for_backends 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":"src/common/io-config/src/config.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebec22bae8416ad6bf21d8c8c554e65a8f8ddb7b31c6d90eac29d0b6f71b1a2"}},{"ruleId":"D1","level":"warning","message":{"text":"GooseFSConfig::multiline_display (cyclomatic 16): GooseFSConfig::multiline_display 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":"src/common/io-config/src/goosefs.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de467413c48302782ecd4e09008885d7fd523159627f7ad32c35eecb225334c"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_core::kernels::hashing::hash_decimal_inner (cyclomatic 16): daft_core::kernels::hashing::hash_decimal_inner has cyclomatic complexity 16 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 6 belong 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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"058d6ffc2dfefd771678a63512b799652f29e076847bb21ff9d4a28faba2b0ec"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_core::kernels::search_sorted::search_sorted_primitive_array (cyclomatic 16): daft_core::kernels::search_sorted::search_sorted_primitive_array 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":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdc3a150eab0bb70ebde1ee93fec842e5ea5e8513521f43fc22928041ae6059"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_csv::read::read_csv_single_into_table (cyclomatic 16): daft_csv::read::read_csv_single_into_table 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":"src/daft-csv/src/read.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"336913646278e75b35c4842805395875c71f8eb19147f2da9769ebdd54631d12"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_dashboard::engine::apply_exec_emit_stats (cyclomatic 16): daft_dashboard::engine::apply_exec_emit_stats 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":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b1455749c5ae11579ed45828a427d2c7c2b0d1bc7df55e33976c820ab7659c"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_json::decoding::deserialize_datetime_into (cyclomatic 16): daft_json::decoding::deserialize_datetime_into 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: daft_json::decoding::deserialize_into (cyclomatic 37) 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":"src/daft-json/src/decoding.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16ad59499a3df860e9a73f966c60cc2e29675726aaccaa74925c4928496cd2e"}},{"ruleId":"D1","level":"warning","message":{"text":"daft_parquet::statistics::column_range::parquet_statistics_to_column_range_statistics (cyclomatic 16): daft_parquet::statistics::column_range::parquet_statistics_to_column_range_statistics 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":"src/daft-parquet/src/statistics/column_range.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4902a5a553b7837fe67018a9a09af97796647655df6add7bc6da6e473d475a6c"}},{"ruleId":"D1","level":"warning","message":{"text":"__main__.validate_query_results (cyclomatic 16): __main__.validate_query_results 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":"benchmarking/tpcds/__main__.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6549a85cd43c7f997d34f9c1ee1cded042ffa5778e6ca9005c8987b723c51055"}},{"ruleId":"D1","level":"warning","message":{"text":"DataFrame.join (cyclomatic 16): DataFrame.join 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":"daft/dataframe/dataframe.py"},"region":{"startLine":4030}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1efa487eff9409b09f8347ca286a34fab9e4cc8841b12aa0ebd41be3ac4835"}},{"ruleId":"D1","level":"warning","message":{"text":"lerobot._decode_one_shard (cyclomatic 16): lerobot._decode_one_shard 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":"daft/datasets/lerobot.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db1703b5c4e55c11dcde642cd87fbfc573f7dc0e4dba8a82891cbf037af9512"}},{"ruleId":"D1","level":"warning","message":{"text":"HudiDataSource.get_tasks (cyclomatic 16): HudiDataSource.get_tasks 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":"daft/io/hudi/hudi_scan.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41d5c4c90500e8dcd2ff5c43adf07013fe7c5142946711d8ff17a818ba3c883"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobScanOperator::try_new (cognitive 100): GlobScanOperator::try_new has cognitive complexity 100 (threshold 15). Drivers by points: match/switch 13 (40 pts), if/else 17 (35 pts), loops 6 (21 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":"src/daft-scan/src/glob.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1f258af93caba682adaa33bb128416fa9c65efc66db5889bfb3bd0ff81b229"}},{"ruleId":"D2","level":"warning","message":{"text":"PushDownFilter::try_optimize_node (cognitive 89): PushDownFilter::try_optimize_node has cognitive complexity 89 (threshold 15). Drivers by points: if/else 33 (73 pts), match/switch 4 (7 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 45). 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":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc6c3a38d4714da29001edbe6e1e1fbd9e7e136a73ac11dc29c3d86a238af8d"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_io::object_store_glob::glob::visit (cognitive 78): daft_io::object_store_glob::glob::visit has cognitive complexity 78 (threshold 15). Drivers by points: if/else 15 (48 pts), match/switch 6 (21 pts), loops 3 (7 pts), boolean chains 2 (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. This shape REPEATS in the file: one other method here (daft_io::object_store_glob::glob) 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":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7765bdb6da991f7ab62e65197c79418aaeea3063d3d03b9bb44abe9a1857b3"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBatch::eval_expression_async_with_metrics (cognitive 68): RecordBatch::eval_expression_async_with_metrics has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (40 pts), loops 7 (14 pts), match/switch 5 (10 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. This shape REPEATS in the file: one other method here (RecordBatch::eval_expression_internal) 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9af51eca267c3fcfa3cc48bfdeb937a54393617d530fa776310b5b02fe6c33"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBatch::eval_expression_internal (cognitive 68): RecordBatch::eval_expression_internal has cognitive complexity 68 (threshold 15). Drivers by points: if/else 19 (40 pts), loops 7 (14 pts), match/switch 5 (10 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. This shape REPEATS in the file: one other method here (RecordBatch::eval_expression_async_with_metrics) 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9390c117f8a5d629683b72ef05428efac1d5b88515c935b69f0cf4d7d65760d4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPlanner::plan_expr (cognitive 65): SQLPlanner::plan_expr has cognitive complexity 65 (threshold 15). Drivers by points: if/else 20 (33 pts), match/switch 12 (27 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 30). Of this number, 53 points are the body\u0027s own statements and 12 belong to 2 function items inside it that branch. 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"9054c3e571f17ceeb4ae7ba4893409c45fdc4e157a3892032fa8d484c2eefa27"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_scan::expr_rewriter::rewrite_predicate_for_partitioning (cognitive 64): daft_scan::expr_rewriter::rewrite_predicate_for_partitioning has cognitive complexity 64 (threshold 15). Drivers by points: if/else 23 (44 pts), boolean chains 11, match/switch 3 (6 pts), loops 3 (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":"src/daft-scan/src/expr_rewriter.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ebaede63e83c22feb91bad2f96e1002a6cd85dc3a3e0de85ed7864fb53d73f"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaSourceTask.read (cognitive 64): KafkaSourceTask.read has cognitive complexity 64 (threshold 15). Drivers by points: if/else 17 (51 pts), loops 3 (6 pts), ternaries 1 (4 pts), boolean chains 3 (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":"daft/io/_kafka.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6978d6d42f7797383a030e3ccc55e52a08dd7a3e34eaf425c14fa291aece60"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeStatsManager::new_impl (cognitive 62): RuntimeStatsManager::new_impl has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (36 pts), loops 6 (18 pts), match/switch 2 (6 pts), boolean chains 2 (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":"src/daft-local-execution/src/runtime_stats/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bda2217738094d3ff2cabe30280e98d27f13c1fa603ba2438ca8e232f055751"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_local_execution::pipeline::physical_plan_to_pipeline (cognitive 61): daft_local_execution::pipeline::physical_plan_to_pipeline has cognitive complexity 61 (threshold 15). Drivers by points: match/switch 14 (33 pts), if/else 13 (24 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 31). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f49b2ff4bb26503326dce3f61b8b19c2419d8a03a85e24611c5258a5baaf30"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_logical_plan::ops::project::replace_column_with_semantic_id (cognitive 61): daft_logical_plan::ops::project::replace_column_with_semantic_id has cognitive complexity 61 (threshold 15). Drivers by points: if/else 24 (49 pts), boolean chains 5, match/switch 2 (4 pts), loops 1 (3 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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fed770546b6424f19b4f24e0972519fa4f8e8b1b5bbbcc9bc12057bf746cf6d"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.write_deltalake (cognitive 59): DataFrame.write_deltalake has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25 (37 pts), boolean chains 11, loops 4 (8 pts), error handling 1 (2 pts), ternaries 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":"daft/dataframe/dataframe.py"},"region":{"startLine":1893}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c698e7664b963014fa0373755e5a1a679bd6173d12947855e60309e55164ba"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoFile._frames (cognitive 57): VideoFile._frames has cognitive complexity 57 (threshold 15). Drivers by points: if/else 20 (32 pts), boolean chains 10, ternaries 7 (9 pts), loops 2 (4 pts), error handling 1 (2 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":"daft/file/video.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a271153a0a28bc0b9fe42b68156a321cae2056e42d75f43b0a79c351fc561f7"}},{"ruleId":"D2","level":"warning","message":{"text":"PushDownProjection::try_optimize_project (cognitive 56): PushDownProjection::try_optimize_project has cognitive complexity 56 (threshold 15). Drivers by points: if/else 24 (44 pts), boolean chains 6, match/switch 3 (4 pts), loops 1 (2 pts) (nesting depth added 22). Of this number, 53 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":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9b4b098d96aa9bcaa39637c22c812f904893ceef54d46f9c2daaae03f5e806"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_writers::csv_writer::make_csv_writer::transform_batch (cognitive 55): daft_writers::csv_writer::make_csv_writer::transform_batch has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (32 pts), match/switch 4 (14 pts), loops 3 (9 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b945147f32ad8651881fe70460b809aba85ee0577797120e1e2d1fa49d629c80"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.write_iceberg (cognitive 55): DataFrame.write_iceberg has cognitive complexity 55 (threshold 15). Drivers by points: if/else 20 (24 pts), loops 7 (12 pts), ternaries 6 (10 pts), boolean chains 9 (nesting depth added 13). 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":"daft/dataframe/dataframe.py"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"416fe2caff4bfc4dfdcdb023d93acf8f0a143027e0edf8e5c089261a84d98492"}},{"ruleId":"D2","level":"warning","message":{"text":"DataType.infer_from_type (cognitive 55): DataType.infer_from_type has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (45 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"daft/datatype.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f5b57ab3e7c8b362886b9888899ae86ce43dafff1f1fbdbb9ad55ea148179f"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaLakeDataSource._get_scan_tasks (cognitive 55): DeltaLakeDataSource._get_scan_tasks has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 4 (12 pts), boolean chains 8, loops 3 (7 pts), ternaries 3 (5 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":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d4d084c9b943c6495ab28d658fb59ece58a85d18f9073b3ddaaa02d8e4ab32"}},{"ruleId":"D2","level":"warning","message":{"text":"Literal::from_pyobj (cognitive 52): Literal::from_pyobj has cognitive complexity 52 (threshold 15). Drivers by points: if/else 44 (48 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"src/daft-core/src/lit/python.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"c00864de42ea6950aab6db65759a9f17dcb3b2b3f7a9ebfcdeeea325b81c4a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanTaskSource::spawn_scan_task_processor (cognitive 52): ScanTaskSource::spawn_scan_task_processor has cognitive complexity 52 (threshold 15). Drivers by points: if/else 8 (28 pts), match/switch 5 (15 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d45175768b19237b09d5f1262c30fb9c8fe8f60e2b5c04c4e45ad0b2cc3303f"}},{"ruleId":"D2","level":"warning","message":{"text":"AzureBlobSource::list_directory_delimiter_stream (cognitive 51): AzureBlobSource::list_directory_delimiter_stream has cognitive complexity 51 (threshold 15). Drivers by points: loops 5 (19 pts), match/switch 7 (18 pts), if/else 5 (14 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"650695db25833dd28c151fecffa9b5280130fbcc5c9a57ca54f44dcfb5422737"}},{"ruleId":"D2","level":"warning","message":{"text":"WarcRecordBatchIterator::read_chunk (cognitive 51): WarcRecordBatchIterator::read_chunk has cognitive complexity 51 (threshold 15). Drivers by points: if/else 11 (38 pts), match/switch 2 (6 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-warc/src/lib.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc299cdac6bb9ba924390f577438878c3496e6530c8e6606c544070ae4b3158"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_writers::json_writer::make_json_writer::transform_batch (cognitive 51): daft_writers::json_writer::make_json_writer::transform_batch has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 3 (9 pts), match/switch 2 (8 pts), boolean chains 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/json_writer.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"475f2b0ec42e8a9aa19f887b5e64ed7de0640dc2bcde0d8ecc79b3adcbcbe2b9"}},{"ruleId":"D2","level":"warning","message":{"text":"PushDownAntiSemiJoin::try_optimize (cognitive 50): PushDownAntiSemiJoin::try_optimize has cognitive complexity 50 (threshold 15). Drivers by points: if/else 10 (32 pts), match/switch 5 (16 pts), boolean chains 2 (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4bb8ac32f31b19c8dc796f93e02b4057f8f918363faf106cbb5ee7336be718"}},{"ruleId":"D2","level":"warning","message":{"text":"_kafka._normalize_bound (cognitive 50): _kafka._normalize_bound has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 3 (10 pts), boolean chains 3 (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":"daft/io/_kafka.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"aebcbf433e52c17b19f8b6ec07e38a9083ec8e9f2a4e39cecbea918a5eb75105"}},{"ruleId":"D2","level":"warning","message":{"text":"DataArray::cast (cognitive 48): DataArray::cast has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (29 pts), boolean chains 13, loops 1 (3 pts), match/switch 2 (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":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9917611eca82406d6028f5429ad32187fbd4adfa84c8bd527671ea681cb1ecaf"}},{"ruleId":"D2","level":"warning","message":{"text":"JoinAdjList::get_connections (cognitive 48): JoinAdjList::get_connections has cognitive complexity 48 (threshold 15). Drivers by points: if/else 8 (37 pts), loops 4 (11 pts) (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"8924519b450964e8adf45f2b4a100625d7eec4bb2ddb32a130ca12515a3f219d"}},{"ruleId":"D2","level":"warning","message":{"text":"PushDownLimit::try_optimize_node (cognitive 46): PushDownLimit::try_optimize_node has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 6 (16 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 25). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_limit.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1dbb796a401060e8bac8b68351ea307ccb014a27680d8a6de946f7f506897c"}},{"ruleId":"D2","level":"warning","message":{"text":"_colab_compat.clean_pydantic_model (cognitive 45): _colab_compat.clean_pydantic_model has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 5 (9 pts), boolean chains 7, ternaries 1 (2 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":"daft/functions/ai/_colab_compat.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0a4e2ec0e98a1304bf54f9c0a83c63d45e642501435c043c505850e7a90fed"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_dashboard::engine::apply_query_end (cognitive 44): daft_dashboard::engine::apply_query_end has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (31 pts), loops 3 (8 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"0448906b2c209e472296a42d50890f8f32b7610d9e2805a952e547c0ec67e24e"}},{"ruleId":"D2","level":"warning","message":{"text":"JoinGraphBuilder::process_linear_chain (cognitive 44): JoinGraphBuilder::process_linear_chain has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 7 (14 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"023896fd5586675da529620124fe0820039255e9730b15d028938d363b9f835d"}},{"ruleId":"D2","level":"warning","message":{"text":"page.QueryPageInner (cognitive 44): page.QueryPageInner has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 15 (20 pts), boolean chains 14, if/else 8 (9 pts), loops 1 (nesting depth added 6). Of this number, 35 points are the body\u0027s own statements and 9 belong to 5 function literals 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":"src/daft-dashboard/frontend/src/app/query/page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"402169aac0ba02e31981986e730f05acf4d53e6a463897c1e6875998fdb7b9ba"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPlanner::plan_query (cognitive 43): SQLPlanner::plan_query has cognitive complexity 43 (threshold 15). Drivers by points: match/switch 10 (21 pts), if/else 10 (18 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cff914989325fab4a9baf2a0f48c5dfa232509bdcc7ea72e92682b926631815"}},{"ruleId":"D2","level":"warning","message":{"text":"PyDaftExecutionConfig::with_config_values (cognitive 42): PyDaftExecutionConfig::with_config_values has cognitive complexity 42 (threshold 15). Drivers by points: if/else 37 (40 pts), match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/daft-config/src/python.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ae654d8957d473c7ef3ff7f3debdc7a301c36d72f85f66afc17ed39568970b"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaSource.get_tasks (cognitive 42): KafkaSource.get_tasks has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (34 pts), boolean chains 4, loops 2 (3 pts), ternaries 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":"daft/io/_kafka.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"0651ed9035a33696bec6ac071a47564e516f282e362756458237e4fe609875ad"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitGranularProjection::try_optimize_node (cognitive 40): SplitGranularProjection::try_optimize_node has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 6 (12 pts), match/switch 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":"src/daft-logical-plan/src/optimization/rules/granular_projections.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0575260150756d3d8bd78339b130983df68ddf63d0b23d82d7b1da7774b0d8"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::array::ops::if_else::generic_if_else (cognitive 39): daft_core::array::ops::if_else::generic_if_else has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 4 (10 pts), match/switch 3 (7 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/if_else.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0c55ef69b96b4ceeae392c165adf61712822e9f7688a4c07a71018793494a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ProbeExecutionContext::process_probe_input (cognitive 38): ProbeExecutionContext::process_probe_input has cognitive complexity 38 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 5 (15 pts), loops 3 (7 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":"src/daft-local-execution/src/join/probe.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"748f0a5c05531705a28976abc7af37fd27475ba019e3647c3b008bfd10cebc7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Error::from (cognitive 36): Error::from has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 8 (17 pts), boolean chains 1 (nesting depth added 16). Of this number, 34 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. 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":"src/daft-io/src/s3_like.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bac0d7753a85d0fa051e1e88770ba22e8bb12ead022e2b1530ae97305115e8f"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_recordbatch::ops::joins::merge_join::merge_inner_join (cognitive 35): daft_recordbatch::ops::joins::merge_join::merge_inner_join has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 7 (10 pts), boolean chains 3, loops 3 (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/merge_join.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a137b35096017c75f7f8274c851e107eb9dafeeece213ef89cfa2f617102577"}},{"ruleId":"D2","level":"warning","message":{"text":"lerobot._decode_one_shard (cognitive 35): lerobot._decode_one_shard has cognitive complexity 35 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/datasets/lerobot.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4cef0643c0d7ad0d1ab073e5ca0bc14925487f52b2d7369133ba3314083885"}},{"ruleId":"D2","level":"warning","message":{"text":"RayRunner.run_iter (cognitive 35): RayRunner.run_iter has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 10 (15 pts), boolean chains 1, 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":"daft/runners/ray_runner.py"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"5638fe84deb7d077d810382a944761a4bd823de6da7dbbf94b2c244bb95fee76"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_local_plan::translate::translate_helper (cognitive 34): daft_local_plan::translate::translate_helper has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 7 (16 pts), boolean chains 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":"src/daft-local-plan/src/translate.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23dfc3bca5d4e41836445c9f2bbe14283e521769e2b8cf566b4cb6584a2cd27"}},{"ruleId":"D2","level":"warning","message":{"text":"PaimonDataSource.get_tasks (cognitive 34): PaimonDataSource.get_tasks has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 2 (4 pts), ternaries 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":"daft/io/paimon/paimon_scan.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b1ca6150c47a439fb7bff7b37902a9a7828d1b61f4e09404a960387ba6e46c"}},{"ruleId":"D2","level":"warning","message":{"text":"flotilla.start_ray_workers (cognitive 34): flotilla.start_ray_workers has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (18 pts), error handling 2 (6 pts), loops 3 (5 pts), ternaries 1 (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":"daft/runners/flotilla.py"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f53d5597f273c154c04eb63ce88f100fe4973fbdbfd5367f99348a9136b113"}},{"ruleId":"D2","level":"warning","message":{"text":"ListArray::list_flatten (cognitive 33): ListArray::list_flatten has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 4 (10 pts), 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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a72abb5fc68b874960fd020f5466d9e50ae3115f4ca087c1c302c458d562a3"}},{"ruleId":"D2","level":"warning","message":{"text":"DeltaLakeDataSource.__init__ (cognitive 33): DeltaLakeDataSource.__init__ has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 5, error handling 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"fedea0d3dba29f74d01fed29159cf49c2d0ceaa8658e274cc10637158b469130"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_dashboard::engine::apply_exec_emit_stats (cognitive 32): daft_dashboard::engine::apply_exec_emit_stats has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 3 (10 pts), loops 3 (8 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":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"b738f52fd6d384801cbd41bebb18c5bfb619ac3a32ee809852e8344dceae9386"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_io::s3_like::build_s3_conf (cognitive 32): daft_io::s3_like::build_s3_conf has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 3, loops 1 (3 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09247ed09ae98c4b44fa3b4f4f733ed25598ae7861cb6ee5574df03830099fe"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalPlanBuilder::select (cognitive 32): LogicalPlanBuilder::select has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (21 pts), match/switch 2 (7 pts), loops 2 (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":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65025edcf1db1aa368c590af802a9ef719c5b1d80cc470109472a1b497dc9f6"}},{"ruleId":"D2","level":"warning","message":{"text":"McapReader::new (cognitive 32): McapReader::new has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (20 pts), match/switch 3 (7 pts), boolean chains 5 (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":"src/daft-mcap/src/read.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"777b8ad1e2acc2b0e96bc98eda86e8844a01583e3e4f4db91555de2a8bd623fc"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBatch::explode (cognitive 32): RecordBatch::explode has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2, match/switch 1 (2 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":"src/daft-recordbatch/src/ops/explode.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"588567bc020e1357c35a13188e496eb7b7991fc04ed511ca1201d16def1a7075"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::search_sorted::search_sorted_boolean_array (cognitive 31): daft_core::kernels::search_sorted::search_sorted_boolean_array has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 3 (7 pts), loops 3 (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":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e41f112a9f4e9da31812b89a3ccebaf96383c011de9015d7b13f52730aadbe7"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_local_execution::run::run_execution_loop (cognitive 31): daft_local_execution::run::run_execution_loop has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 2 (5 pts), match/switch 2 (5 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":"src/daft-local-execution/src/run.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"f359c763d72e7798ab39cbee9a992fdf4ed6b2217f15e8be1be3e8d1ca4c87fe"}},{"ruleId":"D2","level":"warning","message":{"text":"filesystem._build_filesystem (cognitive 31): filesystem._build_filesystem has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/filesystem.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1530f9d8e9b6260d9d9f7f306a7a32a748a619f5bba740abc916b1a45c091cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::hashing::hash_boolean_inner (cognitive 30): daft_core::kernels::hashing::hash_boolean_inner has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (10 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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"e781985b1738bad5198f1863b946a74bc98338fa87babdf5f2cc505b9fa1da28"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::search_sorted::search_sorted_primitive_array (cognitive 30): daft_core::kernels::search_sorted::search_sorted_primitive_array has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b57c2d317bd32a7c8ddcecae1a7098f01a7c81b30c6bdab02ea47c47a366901"}},{"ruleId":"D2","level":"warning","message":{"text":"VLLMSink::pop_and_submit_tasks (cognitive 30): VLLMSink::pop_and_submit_tasks has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (22 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":"src/daft-local-execution/src/streaming_sink/vllm.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"89447ef3491535b822e03bbbb82f34a6ddfaba4ed4dbbf3377746efefde2848f"}},{"ruleId":"D2","level":"warning","message":{"text":"PostgresTable.schema (cognitive 30): PostgresTable.schema has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (17 pts), error handling 2 (7 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"9662aab8d4b4c526d8427a92a797b3996c602de5b06cc12dbb39b78de177216b"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.write_lance (cognitive 30): DataFrame.write_lance has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13, error handling 5 (8 pts), boolean chains 5, ternaries 3 (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":"daft/dataframe/dataframe.py"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"876ea5d0dcc1e591110a0fc7e2c5007f061192578e560b8dab6008b767bae212"}},{"ruleId":"D2","level":"warning","message":{"text":"_VideoFramesSourceTask._list_frames (cognitive 30): _VideoFramesSourceTask._list_frames has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (6 pts), boolean chains 2, error handling 1 (2 pts), ternaries 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":"daft/io/av/_read_video_frames.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff2b26a8ace6a1010966323792d69300a0473ac9cd0dedbd33dc02ca2009f1e"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::hashing::hash_decimal_inner (cognitive 29): daft_core::kernels::hashing::hash_decimal_inner has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (15 pts), loops 4 (10 pts), match/switch 2 (4 pts) (nesting depth added 10). Of this number, 20 points are the body\u0027s own statements and 9 belong 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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"2826d11e5b2ea63c28843a017caa3d8f3bf236bbed37781527b35f569a70f45c"}},{"ruleId":"D2","level":"warning","message":{"text":"AggExpr::to_field (cognitive 29): AggExpr::to_field has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 5 (9 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"459c4f9ab3b4c7a0e960b3748006ef9c1db67a1cf32c61fc034eb3498909ab7b"}},{"ruleId":"D2","level":"warning","message":{"text":"AsofJoinProbeState::probe_batch (cognitive 29): AsofJoinProbeState::probe_batch has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (7 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":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c975925155d98ca59c2039775fb652d2da421204c30dac58deab4dd9e0f8cc36"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_json::local::read_json_array_impl (cognitive 28): daft_json::local::read_json_array_impl has cognitive complexity 28 (threshold 15). Drivers by points: loops 4 (12 pts), match/switch 3 (9 pts), if/else 4 (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":"src/daft-json/src/local.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2950eb22abb5a2bae7d57c32fe3428c3f008a42b417448d68ce18f288c35aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_parquet::reader::build_rg_inputs (cognitive 28): daft_parquet::reader::build_rg_inputs has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 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":"src/daft-parquet/src/reader/mod.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7879a7d48a1fa7675f14cb029c28ee5161b96ad14f4057355629ab535a0101dd"}},{"ruleId":"D2","level":"warning","message":{"text":"rust_lockfile_diff.main (cognitive 28): rust_lockfile_diff.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 4 (12 pts), ternaries 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":".github/ci-scripts/rust_lockfile_diff.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef3dc4852435cac61c4eebc13101f0737f3bfb039d8e76f646c4c362e394f73"}},{"ruleId":"D2","level":"warning","message":{"text":"UdfHandle.eval_input (cognitive 28): UdfHandle.eval_input has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), error handling 3 (6 pts), boolean chains 2, ternaries 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":"daft/execution/udf.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"915ea15f2a855b10828c1b62006f484d652cc1c2e6171c9caa6d020a0cd944ee"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_io::object_store_glob::glob (cognitive 27): daft_io::object_store_glob::glob has cognitive complexity 27 (threshold 15). Drivers by points: if/else 22 (62 pts), match/switch 8 (28 pts), loops 5 (11 pts), boolean chains 4 (nesting depth added 66). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (daft_io::object_store_glob::glob::visit) 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":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf986e8f404c0f34fcce2d7c5169f74b62bf1681f6ec5e0022051dd789ad5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"PushDownAggregation::try_optimize (cognitive 27): PushDownAggregation::try_optimize has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (7 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":"src/daft-logical-plan/src/optimization/rules/push_down_aggregation.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e720a9e6402d89ac6bd41d3a345c7ab1825194c4887c1c49895ed0ea54dac2c6"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_logical_plan::optimization::rules::split_udfs::split_projection (cognitive 27): daft_logical_plan::optimization::rules::split_udfs::split_projection 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). 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, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/split_udfs.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"040c2d5884116b1362a9b228afe3ff003dcc5eeea12ab6cd14df945a0b0fd8d3"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_parquet::helpers::refine_selection (cognitive 27): daft_parquet::helpers::refine_selection has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/helpers.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"761260f92886ca64489749262827620ee549e2e1383ffe0c841e22e088fac18a"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_recordbatch::ops::joins::hash_join::hash_outer_join (cognitive 27): daft_recordbatch::ops::joins::hash_join::hash_outer_join has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (8 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":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca93d14f98ef309fb63acc5b34b604079e8b153713f848774720d3e0be68118"}},{"ruleId":"D2","level":"warning","message":{"text":"HudiDataSource.get_tasks (cognitive 27): HudiDataSource.get_tasks has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 3 (8 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/hudi/hudi_scan.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cabc44f292fef6a9f6b1961fb86a4af49a4f517a64b653a166b6d0b52080bdc"}},{"ruleId":"D2","level":"warning","message":{"text":"RayWorkerManager::retire_idle_workers (cognitive 26): RayWorkerManager::retire_idle_workers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 3, loops 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":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b401c182118e2bd0e961de8a7ab18495f196b6e31043a0bd4aa85e3f9729bbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Dispatcher::await_completed_tasks (cognitive 26): Dispatcher::await_completed_tasks has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (15 pts), match/switch 2 (7 pts), loops 2 (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":"src/daft-distributed/src/scheduling/dispatcher.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"883051b8d73291fe419502b7e83ce718cb4cee0644da75aac9df2d6a0563b38a"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalPlan::get_schema_for_alias (cognitive 26): LogicalPlan::get_schema_for_alias has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"16738d8843ea84168034b248c62f5f223e9833eee68ab5052b6a0d50d19b4429"}},{"ruleId":"D2","level":"warning","message":{"text":"__main__.validate_query_results (cognitive 26): __main__.validate_query_results has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 3, boolean chains 1, error handling 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":"benchmarking/tpcds/__main__.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2c5750a33c0ad2cf0e4633b698788af59ba94c0241aa53094a76e836656364"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobScanSource::spawn_glob_path_processor (cognitive 25): GlobScanSource::spawn_glob_path_processor has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 2 (6 pts), loops 3 (5 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":"src/daft-local-execution/src/sources/glob_scan.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf74adf7bd8ea43a20b7588322926de35c5080ba357218332b3bc2af3766ea73"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_scan::scan_task_iters::split_jsonl::split_by_jsonl_ranges (cognitive 25): daft_scan::scan_task_iters::split_jsonl::split_by_jsonl_ranges has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 3 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/scan_task_iters/split_jsonl/mod.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c63431e794a9e331f351dd7d5c7ac41add1875dc15e985a42bb9fa2d4058e6"}},{"ruleId":"D2","level":"warning","message":{"text":"DataType::fmt (cognitive 25): DataType::fmt has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (4 pts), boolean chains 2, 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":"src/daft-schema/src/dtype.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4ec42b902faa282de6afee4a0e7a06c9eb7734d0353a4d9c11a927a6d98af9"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_sql::schema::sql_dtype_to_dtype (cognitive 25): daft_sql::schema::sql_dtype_to_dtype has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 10 (21 pts), if/else 1 (4 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/schema.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fe2047a1d0e77fa84770fd4e16733bbc5ec671c7f0c10c97114fb26115ad97"}},{"ruleId":"D2","level":"warning","message":{"text":"gen_function_pages.format_function_signature (cognitive 25): gen_function_pages.format_function_signature has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (23 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":"docs/gen_pages/gen_function_pages.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8055a02a7c247aa79ce2eb7a13b18fd6d17c4b96f265703ea56b94e7dbd6d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"S3Config::multiline_display (cognitive 24): S3Config::multiline_display has cognitive complexity 24 (threshold 15). Drivers by points: if/else 23, 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":"src/common/io-config/src/s3.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9af405d25df575cb6bd2a5db07de8a8808db835b82772a873718f380ee9052"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::series::from_lit::series_from_literals_iter (cognitive 24): daft_core::series::from_lit::series_from_literals_iter has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 9 (14 pts), if/else 8 (10 pts) (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/from_lit.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"97da981c0203c129a63142e26eda3b58f8feb793881908199db529377d0dab2c"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_csv::read::read_csv_single_into_table (cognitive 24): daft_csv::read::read_csv_single_into_table has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 1 (3 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":"src/daft-csv/src/read.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1365a7b17760c697c18d6ce1b7bfc45366cc1b45c964234e69f9fb88e0405204"}},{"ruleId":"D2","level":"warning","message":{"text":"RowWisePyFn::call_serial (cognitive 24): RowWisePyFn::call_serial has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (5 pts), match/switch 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":"src/daft-dsl/src/python_udf/row_wise.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"495cff057cc81b7e14898c714454fd0fe127832597b01038727cd06099c41f34"}},{"ruleId":"D2","level":"warning","message":{"text":"BlockingSinkNode::run (cognitive 24): BlockingSinkNode::run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (7 pts), match/switch 2 (5 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":"src/daft-local-execution/src/sinks/blocking_sink.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01f7288ce370c9d19f9a1f65a38891896a6c357a9c381573427ccdd0cffc7a6"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_scan::scan_task_iters::split_by_row_groups (cognitive 24): daft_scan::scan_task_iters::split_by_row_groups has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (7 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":"src/daft-scan/src/scan_task_iters/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"61027bdf7f395d624999179879b710d6d9ff44e64fd8ea37c53e03289fbdbed2"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPlanner::plan_aggregate_query (cognitive 24): SQLPlanner::plan_aggregate_query has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (19 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e74a5cf835c3bc5e43e555af7e49b7bdab8eb1990f28df7e8222bfa3a8e3490"}},{"ruleId":"D2","level":"warning","message":{"text":"tasks-sidebar.TasksSidebar (cognitive 24): tasks-sidebar.TasksSidebar has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 8 (13 pts), boolean chains 11 (nesting depth added 5). Of this number, 22 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1a76b862ca0a8cb60825141576b52f8c3cfa3af92cb50afef336e96958684f"}},{"ruleId":"D2","level":"warning","message":{"text":"common_display::table_display::build_table (cognitive 23): common_display::table_display::build_table has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/display/src/table_display.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f495c6735b23fe43c0b3bc737945c2983568473bea33409e1d5432ede6f88fdb"}},{"ruleId":"D2","level":"warning","message":{"text":"PushDownJoinPredicate::try_optimize (cognitive 23): PushDownJoinPredicate::try_optimize has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_join_predicate.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85ef2bc77d1ffa3eb9700c9901620025feb4b122ff4c6667d35c0373c5aaeed"}},{"ruleId":"D2","level":"warning","message":{"text":"JoinAdjList::add_join_condition (cognitive 23): JoinAdjList::add_join_condition has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 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":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"782d3fe559be71d702e4f283c8411c6f466e91d187014466444feed62f1508fe"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.join_asof (cognitive 23): DataFrame.join_asof has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 3 (6 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":"daft/dataframe/dataframe.py"},"region":{"startLine":4125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0047616aa7ed349de8c8c6e84cdeea5ace967aa78ba150fcff41e504db6ae840"}},{"ruleId":"D2","level":"warning","message":{"text":"_webdataset._iter_archive_samples (cognitive 23): _webdataset._iter_archive_samples has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, error handling 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":"daft/io/webdataset/_webdataset.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"544568a839d382218a77fa11ae397af5608eea46ec74639ef66b6e27746a5566"}},{"ruleId":"D2","level":"warning","message":{"text":"ListArray::list_contains (cognitive 22): ListArray::list_contains has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb9f8c38c32a055e214a7879c028b15a5570bf62512c3ff51d33254aca7ebf5"}},{"ruleId":"D2","level":"warning","message":{"text":"WindowSpec::fmt (cognitive 22): WindowSpec::fmt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/window.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2065641a87628aba520ef10f5567a34ca5f800ebdb3f5a3d7f23be9ce4df41"}},{"ruleId":"D2","level":"warning","message":{"text":"ShuffleReadSource::spawn_flight_shuffle_processor (cognitive 22): ShuffleReadSource::spawn_flight_shuffle_processor has cognitive complexity 22 (threshold 15). Drivers by points: if/else 2 (9 pts), match/switch 3 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sources/shuffle_read.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6b3b5b85ce1023795b12bc015c120fcc14ed0c1ff967fa815dea47b0a93f88"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_local_execution::join::asof_join::nearest_fill (cognitive 22): daft_local_execution::join::asof_join::nearest_fill has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (7 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e74e1a2663919df45edf87bba58e16443d9762868904d5ef7870954a82a82e"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterNullJoinKey::try_optimize (cognitive 22): FilterNullJoinKey::try_optimize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/filter_null_join_key.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"df931ec7a752912aadc6526b7dcf0b63d314d09bc164be0c3a34e3b6b93b048d"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitExplodeFromProject::try_optimize (cognitive 22): SplitExplodeFromProject::try_optimize has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 1 (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":"src/daft-logical-plan/src/optimization/rules/split_explode_from_project.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4111aace5238169a638c0aa62a6c3ac0eec50ed87ed996530eb797feef70681f"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_logical_plan::optimization::rules::unnest_subquery::pull_up_correlated_cols (cognitive 22): daft_logical_plan::optimization::rules::unnest_subquery::pull_up_correlated_cols has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f2401ba1dbd762b10d928d6de0a163b72927f48ff63109d1ee63a0e7857b4f"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPlanner::select_item_to_expr (cognitive 22): SQLPlanner::select_item_to_expr has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (4 pts) (nesting depth added 8). Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a6511c3ec3d4c2c4d4f17153a3934d4c7bad6e373b71a2e2b70419aad09e03"}},{"ruleId":"D2","level":"warning","message":{"text":"api_annotations.type_check_function (cognitive 22): api_annotations.type_check_function has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 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":"daft/api_annotations.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5672d2bcfea4374346e07d8d153ca96cf6ba81ccf5a76b7a41a92e2501ee5ec4"}},{"ruleId":"D2","level":"warning","message":{"text":"delta_lake_write.get_file_stats_from_metadata (cognitive 22): delta_lake_write.get_file_stats_from_metadata has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (21 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":"daft/io/delta_lake/delta_lake_write.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"930725392fd54bb341f41a9f2a8d497b34b82a7a600d84f59ba5d5522f46ae1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Func.__call__ (cognitive 22): Func.__call__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5 (8 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (Func.__call__, Func.__call__, Func.__call__) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"daft/udf/udf_v2.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"108b0c978cd0e8d736bb837b84c3710c4fc49d475605b9e9115401a8522a8c43"}},{"ruleId":"D2","level":"warning","message":{"text":"Func.__call__ (cognitive 22): Func.__call__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5 (8 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (Func.__call__, Func.__call__, Func.__call__) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"daft/udf/udf_v2.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"744575c3b6352ae930fb54ede310e7e5ac3e2cd8f3e1e08c459f04956c6a774b"}},{"ruleId":"D2","level":"warning","message":{"text":"Func.__call__ (cognitive 22): Func.__call__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5 (8 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (Func.__call__, Func.__call__, Func.__call__) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"daft/udf/udf_v2.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"d092eec0df796f1925579b460ac8cbf10cd6799320df27ddf9fd50e7cf845cc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Func.__call__ (cognitive 22): Func.__call__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5 (8 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: 3 other methods here (Func.__call__, Func.__call__, Func.__call__) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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":"daft/udf/udf_v2.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fad06bb61db3cdf4f2cfd83a2ed69c7f8e8124f7aa568d50373276728f3df88"}},{"ruleId":"D2","level":"warning","message":{"text":"physical-plan-tree.PhysicalNodeCard (cognitive 22): physical-plan-tree.PhysicalNodeCard has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, ternaries 5 (8 pts), if/else 3 (nesting depth added 3). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e25477614cc34ceadf9fb4600e63547f3aacfeaf74073c06935096b552ace77"}},{"ruleId":"D2","level":"warning","message":{"text":"SchedulerLoop::run (cognitive 21): SchedulerLoop::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/scheduler/scheduler_actor.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c008034129de1c1e59fc15c810cd34af3d1cb139eba7f8621b6049310fc0e3d"}},{"ruleId":"D2","level":"warning","message":{"text":"Join::deduplicate_join_columns (cognitive 21): Join::deduplicate_join_columns has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/join.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c928842424e127f9bad6039a77566030b1698e5e39124546e97c4c7406da418"}},{"ruleId":"D2","level":"warning","message":{"text":"Project::factor_expressions (cognitive 21): Project::factor_expressions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (19 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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58c2f3f3cb993621282ffd08ef632ec2e44896215b301489b0a49a2c02b82fb"}},{"ruleId":"D2","level":"warning","message":{"text":"BruteForceJoinOrderer::find_min_cost_order (cognitive 21): BruteForceJoinOrderer::find_min_cost_order has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 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":"src/daft-logical-plan/src/optimization/rules/reorder_joins/brute_force_join_order.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0daf726249a026ec30c793de0d9e73e96576d2a6d068ac43dd9370d64280350"}},{"ruleId":"D2","level":"warning","message":{"text":"McapReader::next_message (cognitive 21): McapReader::next_message has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-mcap/src/read.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd4affd57a441176c8e21dade67fc9c6b0bcfa694605be2fe4bdd0d84bac70b"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_parquet::helpers::prune_row_groups (cognitive 21): daft_parquet::helpers::prune_row_groups has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (5 pts), loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/helpers.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca77c28e9cbbdaea3434cd1ead90c70af2df072a36b0b3dd1b9e8f57b1069cb"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumI8::update_batch (cognitive 21): AnyValueAccumI8::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI16::update_batch, AnyValueAccumI32::update_batch, AnyValueAccumI64::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0541add3806146bd3acf07e2f76cb4d3d5ca15957e074ee1837d0cdbb981be53"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumI16::update_batch (cognitive 21): AnyValueAccumI16::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI32::update_batch, AnyValueAccumI64::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adaaaac76ce0b271e497da47c10a2919744b39a9fb2657e2e0e094e8bedda8a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumI32::update_batch (cognitive 21): AnyValueAccumI32::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI16::update_batch, AnyValueAccumI64::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea584d979ec4bd02ec0ebda5c776ce81eed171f1cf1962e9574e9a6804084aab"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumI64::update_batch (cognitive 21): AnyValueAccumI64::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI16::update_batch, AnyValueAccumI32::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"144a6ba6015da87922d9f49fb75f91ff0a592f5fba593658f9e0c6426c8ad035"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumU8::update_batch (cognitive 21): AnyValueAccumU8::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI16::update_batch, AnyValueAccumI32::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"42837ffede6ad99de11ffc871c557f7effde7feef85453959d65fa7a735bb482"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumU16::update_batch (cognitive 21): AnyValueAccumU16::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI16::update_batch, AnyValueAccumI32::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f0fed7851d3f6ca7559499606def7c2a362268daa42d3083de823ecdf9233f"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumU32::update_batch (cognitive 21): AnyValueAccumU32::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI16::update_batch, AnyValueAccumI32::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"d583edcf7b62b207310c129a33687986646a7b0d05f97a3f1e44a9c7c34a721a"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumU64::update_batch (cognitive 21): AnyValueAccumU64::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI16::update_batch, AnyValueAccumI32::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a1a759b0b8b85d07ae263c3df9604b8e434d914925836e02f704aee847b210"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumF32::update_batch (cognitive 21): AnyValueAccumF32::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI16::update_batch, AnyValueAccumI32::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f57f029dc04385a4478ce9968de2ac61209314dc91418f5ef0d4264f5ea36b3"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyValueAccumF64::update_batch (cognitive 21): AnyValueAccumF64::update_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 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. This shape REPEATS in the file: 9 other methods here (AnyValueAccumI8::update_batch, AnyValueAccumI16::update_batch, AnyValueAccumI32::update_batch, \u2026) have the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written 10 times rather than 10 independent problems. Splitting this body alone leaves the other 9 exactly as they are. Where these are variations on one operation, the change that clears all 10 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3cca40d5486ff875b6cbb0eaa7e0adc9ce77003b4e0d134db55804850675538"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanTask::estimate_in_memory_size_bytes (cognitive 21): ScanTask::estimate_in_memory_size_bytes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/lib.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d074b3a73858482c072e64c443dbf92963b6b20ae6e8ba96c2ac776e5844c3"}},{"ruleId":"D2","level":"warning","message":{"text":"_client._io_config_from_storage_location (cognitive 21): _client._io_config_from_storage_location has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 10 (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":"daft/catalog/__gravitino/_client.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0da8b1f2f8f723ca9b8f9dd3836e7cced75cf7bf8724196e51cea6f06698c2"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.explain (cognitive 21): DataFrame.explain has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 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":"daft/dataframe/dataframe.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b475219e0c85c4508ae095db6227c17cab5840852ba8a82c77fb60ee4b3575"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.skip_existing (cognitive 21): DataFrame.skip_existing has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3, ternaries 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":"daft/dataframe/dataframe.py"},"region":{"startLine":3394}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ae6c78ef5d66dc78362098f32edb0aca527fd14b85db9cc7bc6a2b48223190"}},{"ruleId":"D2","level":"warning","message":{"text":"_kafka._resolve_bound (cognitive 21): _kafka._resolve_bound has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 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":"daft/io/_kafka.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcf6b1c985341d70473b5be552a2ad78dc500f4b20e10e32f005e56fec9eb2f"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_llms_txt.get_doc_structure (cognitive 21): generate_llms_txt.get_doc_structure has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/gen_pages/generate_llms_txt.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ba9d476c2db15affc40766e1d891a327394b5b61341a3c236e32e8341ebcad"}},{"ruleId":"D2","level":"warning","message":{"text":"UnionArray::from_arrow (cognitive 20): UnionArray::from_arrow has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), 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":"src/daft-core/src/array/ops/from_arrow.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7296de1fe1091afe4a31db3fc5215a88a05c17bff8c7e49c3d66e62cfce09f69"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::array::ops::comparison::compare_struct_value (cognitive 20): daft_core::array::ops::comparison::compare_struct_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (5 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/comparison.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"3263415d83904ceb0cde0dbd63621aa22f7d1b8b01985717ef457387008d8b86"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::cmp::build_nan_aware_comparator (cognitive 20): daft_core::kernels::cmp::build_nan_aware_comparator has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/kernels/cmp.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb113bcee5a18ef25613f047b1cbf3e12a1428b8717a628c5da0cc84ee15e30"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::hashing::hash_primitive_inner (cognitive 20): daft_core::kernels::hashing::hash_primitive_inner has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (6 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (daft_core::kernels::hashing::hash_timestamp_with_timezone_inner) 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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"972633d6dcb0ec14fa21be87cb0b92de134388c7a450cc15f363959c6595b47f"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::hashing::hash_timestamp_with_timezone_inner (cognitive 20): daft_core::kernels::hashing::hash_timestamp_with_timezone_inner has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5 (6 pts), match/switch 2 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This shape REPEATS in the file: one other method here (daft_core::kernels::hashing::hash_primitive_inner) 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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"0776acdc24cc9421ca5d1f09e20e986ca72c7ac89cac2e96c5b6e5f7349d38f2"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::search_sorted::search_sorted_multi_array (cognitive 20): daft_core::kernels::search_sorted::search_sorted_multi_array has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 6 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fb5f042d6b34fb7b1a5d405a26e44495fffac14c49b6d05d9a41a0e36574d7"}},{"ruleId":"D2","level":"warning","message":{"text":"ScanSourceNode::multiline_display (cognitive 20): ScanSourceNode::multiline_display has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/scan_source.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"31132fde934117ebf691e048891ee41a96cf45d09524191aff6f7c4c031815e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::to_field (cognitive 20): Expr::to_field has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 3 (6 pts), loops 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9287de45b96725909c75143ee0428a56102abf40520183110fa41978ab2f527"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_file::file::guess_mimetype_from_content (cognitive 20): daft_file::file::guess_mimetype_from_content has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-file/src/file.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d3d0870d9fd2b36673f2d4f908febf1cc3096c9ecfcf4ee6aa3aea29c03783"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_recordbatch::ops::joins::hash_join::hash_left_right_join (cognitive 20): daft_recordbatch::ops::joins::hash_join::hash_left_right_join has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8be8e1894ae5758d331a7dcecd458e31cb52fe4546a35ad2ff08503807fb4fb"}},{"ruleId":"D2","level":"warning","message":{"text":"data_generation.gen_csv_files (cognitive 20): data_generation.gen_csv_files has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (16 pts), if/else 3 (4 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":"benchmarking/tpch/data_generation.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33233bf2799fc8f65d8412ed2bf33d0c0a10591a250eb3038215136812da522"}},{"ruleId":"D2","level":"warning","message":{"text":"__postgres._daft_dtype_to_postgres_type (cognitive 20): __postgres._daft_dtype_to_postgres_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, error handling 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":"daft/catalog/__postgres.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70ee7aa9e05668c4dbad5006102eed26e7440d9a5e3898d120e2e60ccd28752"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame._write_deltalake_with_checkpoint (cognitive 20): DataFrame._write_deltalake_with_checkpoint has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, 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":"daft/dataframe/dataframe.py"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f299c94f4ff448c9c0c7372f22b40b823794a15c2b7f0844633cdbafa83ded"}},{"ruleId":"D2","level":"warning","message":{"text":"_paimon._convert_paimon_catalog_options_to_io_config (cognitive 20): _paimon._convert_paimon_catalog_options_to_io_config has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), ternaries 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/paimon/_paimon.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"de48ad22533ea5103c9a73465eb5d8634ecf1b3b41fc3e3ec91a62111af95fa1"}},{"ruleId":"D2","level":"warning","message":{"text":"GooseFSConfig::to_opendal_config (cognitive 19): GooseFSConfig::to_opendal_config 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":"src/common/io-config/src/goosefs.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8537604e390f9046681d9935f36cee078b65b73f651686112fee14f2e6555120"}},{"ruleId":"D2","level":"warning","message":{"text":"common_tracing::init_tracing (cognitive 19): common_tracing::init_tracing has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (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":"src/common/tracing/src/lib.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03d717f93e06c0d42cbe8cf367b099652c8c06616a4cc45bdefe82694069ff6"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkyIterator::next (cognitive 19): ChunkyIterator::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (5 pts), loops 1 (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":"src/daft-csv/src/local.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e7b26c9adbd7d82d3e1ac7141f7f691084e59fd4c8f312ba00b5d54eb8c7c3"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_csv::metadata::infer_schema (cognitive 19): daft_csv::metadata::infer_schema has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 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":"src/daft-csv/src/metadata.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cebde62e6644395b0795f27a04b771febbf9762cb23476a695a3bbf2ba54c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_csv::read::stream_csv (cognitive 19): daft_csv::read::stream_csv has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b006bbe52b1a0e66d4cabfcbf3aa286a006e8f142dbaa2d200f98fa0ed4261"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalPlanToPipelineNodeTranslator::f_up (cognitive 19): LogicalPlanToPipelineNodeTranslator::f_up has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (8 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/translate.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"3497b9655609161f2ed071e61ac1b909917902c3859b277f14138b88e48a130b"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_functions_utf8::jaro::compute_jaro_similarity (cognitive 19): daft_functions_utf8::jaro::compute_jaro_similarity has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (6 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":"src/daft-functions-utf8/src/jaro.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"2679d320c03b35a2ce7905797f116ef1960dbe859416771f3c6fa654a1695bd4"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_functions_utf8::normalize::normalize_impl (cognitive 19): daft_functions_utf8::normalize::normalize_impl has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 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":"src/daft-functions-utf8/src/normalize.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"493e92a7f559021012d94d812e16780350767545c83596204fdccd948c5c9bf3"}},{"ruleId":"D2","level":"warning","message":{"text":"IOClient::get_source_and_path (cognitive 19): IOClient::get_source_and_path has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 4 (5 pts), loops 1 (3 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/lib.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5fd3a02edb80c29a341c9988391d8780901800c08eae2ed0fc5adf3ec7d0de"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_json::read::read_json_single_into_tables (cognitive 19): daft_json::read::read_json_single_into_tables has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 1 (3 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":"src/daft-json/src/read.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0890bdc38d722fad3cffa1b83fda10787d423372e7fe919b015b2c9aa61b024"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_logical_plan::builder::resolve_expr::expand_wildcard (cognitive 19): daft_logical_plan::builder::resolve_expr::expand_wildcard has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 6 (8 pts) (nesting depth added 8). Of this number, 17 points are the body\u0027s own statements and 2 belong 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":"src/daft-logical-plan/src/builder/resolve_expr.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b036b6c73aafb16f3966810445f32d9034f1f13b324f0b60753ec4872f657bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBatch::calculate_range_frame_bounds (cognitive 19): RecordBatch::calculate_range_frame_bounds has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/window.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecb98265ea0aa667b473fd6b01de9c55289c6769a2d2909c1a9314f3ad737af"}},{"ruleId":"D2","level":"warning","message":{"text":"CountDistinctWindowState::remove (cognitive 19): CountDistinctWindowState::remove has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (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":"src/daft-recordbatch/src/ops/window_states/count_distinct.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59801b099315464998011763d112e314288d62aaaf776c5cb58d56cc8ee5f9c"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_recordbatch::ops::joins::hash_join::hash_inner_join (cognitive 19): daft_recordbatch::ops::joins::hash_join::hash_inner_join has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b436ef3019e1fbcdd13ce8993f7b890f9e0a1ba0c307a5e15f9f0f851e8153e1"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPlanner::parse_window_spec (cognitive 19): SQLPlanner::parse_window_spec has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (6 pts), match/switch 2 (4 pts), boolean chains 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":"src/daft-sql/src/functions.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"433b071a60f05ac48f8b270050d62b66542506d8cbe45e689bd8b3ec7ad5cf44"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.__getitem__ (cognitive 19): DataFrame.__getitem__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"daft/dataframe/dataframe.py"},"region":{"startLine":2857}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab57c48c0babbbb6aa157bb43af77b20b67ece77c850582c3bcdca56ffc15473"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoFile.get_frame_by_idx (cognitive 19): VideoFile.get_frame_by_idx has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4, ternaries 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":"daft/file/video.py"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"852de5a486f067ba2368b2c1e6dfc9f0b05376a5c820f9c92d2f3e19480508a6"}},{"ruleId":"D2","level":"warning","message":{"text":"FsFileMetadata._extract_min_max (cognitive 19): FsFileMetadata._extract_min_max has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), boolean chains 5, 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":"daft/io/hudi/pyhudi/utils.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba50d4b93b26e8739f962bd973ca63ec67840f7187b15296fb9a00eba392659e"}},{"ruleId":"D2","level":"warning","message":{"text":"IcebergDataSource._create_regular_tasks (cognitive 19): IcebergDataSource._create_regular_tasks has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4, ternaries 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":"daft/io/iceberg/iceberg_scan.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4752c1779a42536efcde7a63d5e19fd280dc4ae0badbdd0c3ff1187e0e965a"}},{"ruleId":"D2","level":"warning","message":{"text":"TurbopufferDataSink.__init__ (cognitive 19): TurbopufferDataSink.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/turbopuffer/turbopuffer_data_sink.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f115cbb601db8c328d9f7da2fb2a66e3fbb34ccf8d3f74fcc3a1064ed0e0051b"}},{"ruleId":"D2","level":"warning","message":{"text":"ray_runner._series_from_arrow_with_ray_data_extensions (cognitive 19): ray_runner._series_from_arrow_with_ray_data_extensions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, error handling 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":"daft/runners/ray_runner.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc058c55ae214edeb9b984e2a27031533cdfe6a099844a997ce4b1e9e9bfcbd"}},{"ruleId":"D2","level":"warning","message":{"text":"Series.__getitem__ (cognitive 19): Series.__getitem__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4 (8 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":"daft/series.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3db031db04cda7438a03ea20a1462551d2589a8924cd52019d863524b3cf29"}},{"ruleId":"D2","level":"warning","message":{"text":"metrics.increment_counter (cognitive 19): metrics.increment_counter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, 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":"daft/udf/metrics.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe4a3207c56147632b0bd129bc0fc2d19ab84ee23d31691334ca1e01656015a"}},{"ruleId":"D2","level":"warning","message":{"text":"stats-utils.getEffectiveStatus (cognitive 19): stats-utils.getEffectiveStatus has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"src/daft-dashboard/frontend/src/app/query/stats-utils.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"26535a86cb15801625162314302ca037eba4de05d730aeed9d09bc2d416a5d46"}},{"ruleId":"D2","level":"warning","message":{"text":"ListArray::grouped_concat (cognitive 18): ListArray::grouped_concat has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/concat_agg.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ced51dda980b026d6d7c1995766bcdc694c446d2da8aecb5bc6611a20204b0"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::kernels::search_sorted::search_sorted_generic (cognitive 18): daft_core::kernels::search_sorted::search_sorted_generic has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f447762368180656846226e32702f4c8bf285a0ee00b5f67af565ae1a77550e"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_functions_utf8::substr::substr_impl (cognitive 18): daft_functions_utf8::substr::substr_impl has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (10 pts), if/else 4 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/substr.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b67284da85a10d5739eb6315f3576cdd48cbc89df8627977058bab2227992d"}},{"ruleId":"D2","level":"warning","message":{"text":"AzureBlobSource::list_containers_stream (cognitive 18): AzureBlobSource::list_containers_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 3 (6 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e762c53bcfbaa1bc9e30502c8558f1c6a1d711c48065f01cca4e8f8cc41dce2c"}},{"ruleId":"D2","level":"warning","message":{"text":"GCSSource::get_client_config (cognitive 18): GCSSource::get_client_config has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 2 (4 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":"src/daft-io/src/google_cloud.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"942c7562824f91a26566ff12aa6c09ec581b90ebeb7e477671f12beab3b64ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_json::inference::coerce_data_type (cognitive 18): daft_json::inference::coerce_data_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/inference.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"f143b456c1ae432d0a8535c9c6de30aaa304881f5eec3f52f7f235c2e8e14af7"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_json::read::stream_json (cognitive 18): daft_json::read::stream_json has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 1 (3 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":"src/daft-json/src/read.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a3d95d992fc946e4674769a6cb88fb95d49f6e8e0a6a16fed49695f8d2c33c"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionContext::process_input (cognitive 18): ExecutionContext::process_input has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 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":"src/daft-local-execution/src/intermediate_ops/intermediate_op.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ab685ebc076593a61a740993d82936e72278bf15b965f8ceb05b08b0f78e6"}},{"ruleId":"D2","level":"warning","message":{"text":"RuntimeStatsManager::handle_message (cognitive 18): RuntimeStatsManager::handle_message has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/runtime_stats/mod.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"303a3b52e77c6cee7c9ab85e641a511ee2140cc84a67c94ccd4c608d219f32d0"}},{"ruleId":"D2","level":"warning","message":{"text":"JoinGraphBuilder::add_relation (cognitive 18): JoinGraphBuilder::add_relation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"eafc579677fd333095a9ab9d6264a5c7d93e0c34426c63041bc4561df849b71b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnnestPredicateSubquery::try_optimize (cognitive 18): UnnestPredicateSubquery::try_optimize has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (6 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":"src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff035d24467093a26d138f11a291c1b2622f3103f06c9340fa9b9c83ba135de"}},{"ruleId":"D2","level":"warning","message":{"text":"BoolAndAccum::update_batch (cognitive 18): BoolAndAccum::update_batch has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 3 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b6c9c574fd345e5afb84813bc33659272ee2457adf014b2149040b260027fb"}},{"ruleId":"D2","level":"warning","message":{"text":"BoolOrAccum::update_batch (cognitive 18): BoolOrAccum::update_batch has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 2 (7 pts), if/else 3 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78e906cad6a5aec662bdec1b5064851db9766174bb746191920b714ae07682a"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPlanner::plan_order_by_exprs (cognitive 18): SQLPlanner::plan_order_by_exprs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (5 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca7af1cfd3447ef64973f578c864da5ff3343e21b5b0ec7b9bfa9a1e6d61171"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_sql::exec::execute_create_table (cognitive 18): daft_sql::exec::execute_create_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/exec.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1703b83f7082435c743a99cc618c4f5876d5b609bdf1bfae344c9638f85229e6"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFrame.join (cognitive 18): DataFrame.join has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 4, ternaries 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":4030}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c9af7d481c4f1f2bc8f07b0e998682073a4d1abdfa5cc6106f097a69a5d095"}},{"ruleId":"D2","level":"warning","message":{"text":"PrefixRouter.route (cognitive 18): PrefixRouter.route has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (4 pts), boolean chains 2, 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":"daft/execution/vllm.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d9156e7cd36a8e892551a21ce8b0aed8058906cc6f289215845e6191dc4abc"}},{"ruleId":"D2","level":"warning","message":{"text":"_orc._resolve_orc_paths (cognitive 18): _orc._resolve_orc_paths has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 3, loops 2 (3 pts), ternaries 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":"daft/io/_orc.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa69d6671152399b28355877f895906dfb8554e5ecd869606c674d6f0092d3c7"}},{"ruleId":"D2","level":"warning","message":{"text":"physical-plan-tree.PhysicalPlanTree (cognitive 18): physical-plan-tree.PhysicalPlanTree has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 6 (7 pts), boolean chains 5, if/else 2 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 3). Of this number, 12 points are the body\u0027s own statements and 6 belong to 2 function literals 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9660e6fc6ac9c696b9f166d13523f12680954646344dbd8a167f8f79d1e11c71"}},{"ruleId":"D2","level":"warning","message":{"text":"MermaidDisplayVisitor::fmt (cognitive 17): MermaidDisplayVisitor::fmt has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (17 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/display/src/mermaid.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed253e4ed075698a9bd35baa63545d30c07deb4ce0b984bcb0a35795b8e2a569"}},{"ruleId":"D2","level":"warning","message":{"text":"DataArray::clip (cognitive 17): DataArray::clip has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 9 (16 pts), boolean chains 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/clip.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8170f831c751193b70aedcd832bbb39f7ab8670e02bd6a473e70770167d63d"}},{"ruleId":"D2","level":"warning","message":{"text":"Literal::into_pyobject_with_map_conversion (cognitive 17): Literal::into_pyobject_with_map_conversion has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/lit/python.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a40b56ce71b6a42d9be9077195bc384681a3d2df260de6167f8b780b50e6f71"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_core::array::ops::hash::hash_list (cognitive 17): daft_core::array::ops::hash::hash_list has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/hash.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33694cb7da4599e06cf0ec0d32d7f371ce86e1cbc854f636215a2e40f0b9ec3"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_distributed::pipeline_node::materialize::materialize_all_pipeline_outputs (cognitive 17): daft_distributed::pipeline_node::materialize::materialize_all_pipeline_outputs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (5 pts), loops 2 (nesting depth added 10). None of this is in the body itself: all 17 points belong to 2 function items inside it that branch (task_materializer, task_finalizer). 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":"src/daft-distributed/src/pipeline_node/materialize.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"051b081846fbc7ed99fa3972fe3429375a3d90e36e3df03b9910a4c80e0ccd15"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_image::ops::colorhash (cognitive 17): daft_image::ops::colorhash has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-image/src/ops.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7abd416c68db3db175244961241717f3b68bf361c92d39f7a1827f7d925130"}},{"ruleId":"D2","level":"warning","message":{"text":"AzureBlobSource::get_client (cognitive 17): AzureBlobSource::get_client 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":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd4bd8328bad01254bac413e5cd0150042d6c56643b955f6e1950350ae5a034d"}},{"ruleId":"D2","level":"warning","message":{"text":"Error::from (cognitive 17): Error::from has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (13 pts), if/else 3 (4 pts) (nesting depth added 8). 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, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/google_cloud.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cf6f58f993f0259eaefab7697efb318b748a404b8fcf3a5b31b5bcbb6613c2"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_io::object_store_glob::ls_with_prefix_fallback (cognitive 17): daft_io::object_store_glob::ls_with_prefix_fallback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 7 of the 17 points are its own statements and the rest belongs to one function item inside it that branches (prefix_ls). 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":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8ad6dc69e1641f1e8c8b48d8f37f3c62a83ca2c5912c091ffbb471d1b5295d"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_io::utils::group_glob_paths (cognitive 17): daft_io::utils::group_glob_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 5 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 3). Of this number, 14 points are the body\u0027s own statements and 3 belong to 2 function items inside it that branch. 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":"src/daft-io/src/utils.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"730830dd70767e5d6f8c1866f4f4fded78ded928c7ba8cde85c5299c22daa0b2"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_json::schema::infer_schema (cognitive 17): daft_json::schema::infer_schema has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (5 pts), match/switch 2 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/schema.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b2c6262470570dae7e826efb41f948c40b37ef2cdb4e80a7d9b9ab785ed065"}},{"ruleId":"D2","level":"warning","message":{"text":"AsofJoinOperator::finalize_probe (cognitive 17): AsofJoinOperator::finalize_probe has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (7 pts), if/else 4 (6 pts), match/switch 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":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"274206f541b971f99551b16783c8543393a55f41d418a40ac5f01d7f66bcb18a"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionContext::process_input (cognitive 17): ExecutionContext::process_input has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/streaming_sink/base.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcc07bcd4ddd637d4a67c3d7169c3ae9071c8d1e1341fd019608ca56e9d44d2"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_parquet::helpers::bool_array_to_row_selection (cognitive 17): daft_parquet::helpers::bool_array_to_row_selection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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":"src/daft-parquet/src/helpers.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3a8a8d92d8da2434d7d4b0895082338240066d844071fd515875dcd4125e09"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_parquet::statistics::column_range::parquet_statistics_to_column_range_statistics (cognitive 17): daft_parquet::statistics::column_range::parquet_statistics_to_column_range_statistics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/statistics/column_range.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc59a43a105f256c41bf988ae8521dc2bca2ed9b18839617b7aa366c0fd1238f"}},{"ruleId":"D2","level":"warning","message":{"text":"GlobScanOperator::to_scan_tasks (cognitive 17): GlobScanOperator::to_scan_tasks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/glob.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c02bb9bfd4fd9d88badc95d6b5f8aefa26df3a00bd9da340c4608debca41264"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPlanner::convert_window_frame_bound (cognitive 17): SQLPlanner::convert_window_frame_bound has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/functions.rs"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"921f6ea1fd1ac56c038f2a87101479d6dd3fef572258ac842b86fe5fb24b7cb1"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLPlanner::plan_identifier (cognitive 17): SQLPlanner::plan_identifier has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 3). Of this number, 13 points are the body\u0027s own statements and 4 belong to one function item 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a379850a64d168f5b6f58df1b6ffcbaf5c4e9a6738c18666fa551c109c50d81"}},{"ruleId":"D2","level":"warning","message":{"text":"__postgres.postgres_connection (cognitive 17): __postgres.postgres_connection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (6 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":"daft/catalog/__postgres.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"30526ffb495ebe838711ab24f20f043646d83f8aed5ef2cd65bf00325e5409c6"}},{"ruleId":"D2","level":"warning","message":{"text":"DataType.from_arrow_type (cognitive 17): DataType.from_arrow_type has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 5, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/datatype.py"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5effdce7ea0fd23622ba618cffd128c656487364a22c0fab09f9682df458b4"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLDataSink._normalize_non_primitive_values (cognitive 17): SQLDataSink._normalize_non_primitive_values has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (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":"daft/io/_sql.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"efb58f1d950e4f02d195c9a7edc0dadba84b997ae6da803fd5f9edd743b28de1"}},{"ruleId":"D2","level":"warning","message":{"text":"object_store_options._s3_config_to_storage_options (cognitive 17): object_store_options._s3_config_to_storage_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), ternaries 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/object_store_options.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bae0fac23ba973b1c43a14f51b93c85b0f1d369a13c3544db8cf73cfc6165423"}},{"ruleId":"D2","level":"warning","message":{"text":"PaimonDataSink.write (cognitive 17): PaimonDataSink.write has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/paimon/paimon_data_sink.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d84c2b4c49d47ab33519e38dc5b93b30ea8acb665908d71363336cdc013ff65a"}},{"ruleId":"D2","level":"warning","message":{"text":"cloudpickle._find_imported_submodules (cognitive 17): cloudpickle._find_imported_submodules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/pickle/cloudpickle.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"35bb9d287f59f5ce580212e1a2037576b3ca647e273129809f0ed2ea6c1adb10"}},{"ruleId":"D2","level":"warning","message":{"text":"common_macros::function_args::get_attrs (cognitive 16): common_macros::function_args::get_attrs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/macros/src/function_args.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39a73a93eee0ff8f72cce978541ed020f9fcf8d2078b006b9597e7f020b136a"}},{"ruleId":"D2","level":"warning","message":{"text":"Literal::neg (cognitive 16): Literal::neg has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/lit/mod.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fd18be6c385e1d06f2a2bc81b3f10d021d99c084d277ed83b40490914b6906"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_csv::read::stream_csv_single (cognitive 16): daft_csv::read::stream_csv_single has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 1 (3 pts), match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f955d6a5d245f6ddb1e8ce40f044ddb597c89b764b100aae04707a881f59a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"PreShuffleMergeNode::execute_merge (cognitive 16): PreShuffleMergeNode::execute_merge has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/shuffles/pre_shuffle_merge.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"86beeb9aa07d23096874dd2adaf4cb0507797668f4c7a96d0702676645a60f39"}},{"ruleId":"D2","level":"warning","message":{"text":"UDFProperties::multiline_display (cognitive 16): UDFProperties::multiline_display 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":"src/daft-dsl/src/functions/python/mod.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"f175c69e97a52ec05af809307cd7eaa0d13c87ca7d0dec91e3dc0752346f0fe6"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_functions_utf8::to_datetime::to_datetime_impl (cognitive 16): daft_functions_utf8::to_datetime::to_datetime_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), match/switch 5 (8 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/to_datetime.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee44774d1bced348d06497c75c5bddeba38fc1ad0f60cc7585c4305e449f9f1"}},{"ruleId":"D2","level":"warning","message":{"text":"HFSource::request (cognitive 16): HFSource::request has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 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":"src/daft-io/src/huggingface/mod.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c507d92453dee974f128614a17081da3e9b6ee1123a45959875ca2234147250"}},{"ruleId":"D2","level":"warning","message":{"text":"S3LikeSource::ls (cognitive 16): S3LikeSource::ls has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 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":"src/daft-io/src/s3_like.rs"},"region":{"startLine":1420}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2889547a4377bbd21b15a8b2ad8dc06637a701838629f1a03a4512b4e66bab"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_json::decoding::deserialize_datetime_into (cognitive 16): daft_json::decoding::deserialize_datetime_into has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 2 (5 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":"src/daft-json/src/decoding.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16f52d0a4b6ec5d8111860ea99a70699420a3317f8319c77e0a8e54224c5abb"}},{"ruleId":"D2","level":"warning","message":{"text":"ExecutionContext::spawn_complete_input (cognitive 16): ExecutionContext::spawn_complete_input has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/streaming_sink/base.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"0664e5318cd87ac15cb0c9362e2e1d3df9aca8683894ac820044ed3dd406c2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicalPlan::get_schema_for_id (cognitive 16): LogicalPlan::get_schema_for_id has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 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":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"b166f73c5931a91978e567962fc41ebbddcfa27d2eac3c7d6ec73dbcfc9d440e"}},{"ruleId":"D2","level":"warning","message":{"text":"EliminateCrossJoin::try_optimize (cognitive 16): EliminateCrossJoin::try_optimize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 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":"src/daft-logical-plan/src/optimization/rules/eliminate_cross_join.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"326918739a2c51844392ce61bb37f020a24738a466e9639ade746f4f79ed335e"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_logical_plan::ops::project::replace_column_with_semantic_id_aggexpr (cognitive 16): daft_logical_plan::ops::project::replace_column_with_semantic_id_aggexpr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). 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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c1c269dff03d6cfe5240a9b7b250c4887823898cb81274f37d455fa4dc2c1a"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_parquet::read::read_parquet (cognitive 16): daft_parquet::read::read_parquet has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (4 pts), boolean chains 3 (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":"src/daft-parquet/src/read.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7aa251ce7dbe6260c5da1051579299868938fc9a077c8e2959bd9266741dc53"}},{"ruleId":"D2","level":"warning","message":{"text":"daft_parquet::reader::rg_processor::process_rg_predicate_only (cognitive 16): daft_parquet::reader::rg_processor::process_rg_predicate_only has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 8 (13 pts), if/else 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/reader/rg_processor.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade337aa5d2419fa03c623b31c41bc555244e4d55c16629e840e15795b29b972"}},{"ruleId":"D2","level":"warning","message":{"text":"lerobot._format_path_template (cognitive 16): lerobot._format_path_template has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/datasets/lerobot.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa67eb128ed0024b68164bbc62c50ef6dfc9ac31070b3958dcb3a721bc99dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"udf_worker.udf_event_loop (cognitive 16): udf_worker.udf_event_loop has cognitive complexity 16 (threshold 15). Drivers by points: error handling 6 (10 pts), if/else 3 (5 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/execution/udf_worker.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77476d5c32bd747badd99c085e4a22337d8209da6886ef1e3be915a890fe9bb"}},{"ruleId":"D2","level":"warning","message":{"text":"ai.prompt (cognitive 16): ai.prompt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, error handling 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":"daft/functions/ai/__init__.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"375adfe5c208fcdd482f7da60fcc3c13da19804c822d17fc32fc979eb86718a0"}},{"ruleId":"D2","level":"warning","message":{"text":"SQLScanOperator._get_partition_bounds (cognitive 16): SQLScanOperator._get_partition_bounds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/sql/sql_scan.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"6926ff9f86929002c4963c05a26641c90e9a93db3c60b382fdbff0b3bcc9f81a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_local_execution::pipeline::physical_plan_to_pipeline: FunctionTooLong \u2014 daft_local_execution::pipeline::physical_plan_to_pipeline runs 1062 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 962 over it, 10.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":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"48806e6967cf903243f59e7b522b721b6b1c63d2ffb58ed1a10838b6e111c29b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expression: TooManyMethods \u2014 287 methods. The bar is 30 methods; this is 257 over it, 9.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/expressions/expressions.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc837d467c302fca600885d2cc1e356b7ad67283671aa532ea6e101bd6cffbc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalPhysicalPlan.with_new_children: MethodTooLong \u2014 with_new_children runs 561 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 461 over it, 5.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":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"923f953d8901304034d1832b2a34be1332169c5f6ab86c81f93f6bb1ced63863"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Series: TooManyMethods \u2014 157 methods, declared across 36 files: ops/downcast.rs (39), ops/time.rs (22), series/mod.rs (21), ops/agg.rs (19), \u002B32 more file(s). The bar is 30 methods; this is 127 over it, 5.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0bd64cb8b2e37fabd90ac44a80db10caa105f8467dd8f2dbb8872360e73f36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_local_plan::translate::translate_helper: FunctionTooLong \u2014 daft_local_plan::translate::translate_helper runs 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 420 over it, 5.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/translate.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"278a16b789d244a2038865d52ffce98407783322856c10a32d2d3ed281688bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlanToPipelineNodeTranslator.f_up: MethodTooLong \u2014 f_up runs 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 340 over it, 4.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":"src/daft-distributed/src/pipeline_node/translate.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"07211e43852425b33c4722cf2a2952e02ed136c3b432f9b75fb3e51ff4b0a945"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/plan.rs: FileTooLong \u2014 2121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 78% of them inside a single declaration: LocalPhysicalPlan (4 blocks, 74-1971). The bar is 500 significant lines; this is 1621 over it, 4.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c9079b922d2db6fd3c09406b246b6beb8b1dd751469a148413420bb2e9abd7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LocalPhysicalPlan: ClassTooLong \u2014 1646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 52 methods, 4 blocks, lines 74-1971. The bar is 400 significant lines; this is 1246 over it, 4.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d76caf52fe58d6a55a12149b6546424f7019632e3364848bbc912450281a1e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLPlanner.plan_expr: MethodTooLong \u2014 plan_expr runs 409 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 309 over it, 4.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":"src/daft-sql/src/planner.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"1395dad793d3a1fd414aa0a1eec66e1b0fe1bc4bde76984bc2e5826e9f4be613"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataFrame: TooManyMethods \u2014 121 methods. The bar is 30 methods; this is 91 over it, 4.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":"daft/dataframe/dataframe.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8c0e5c6ef4779e0def132d16a5eeb51e4aca79569a7162564537f6ece8f17c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataframe/dataframe.py: FileTooLong \u2014 1976 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1476 over it, 3.95\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8c2c682e1fab3c549a744d2633549a3e3e0154d978ab431043971e710915b9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expr/mod.rs: FileTooLong \u2014 1926 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1426 over it, 3.85\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6581cb91171cbdb926116d25a19a12ddc61bb091bccadd7e5f24ba5e06e41c7e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SQLPlanner: ClassTooLong \u2014 1455 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 62 methods, 4 blocks, lines 165-2293. The bar is 400 significant lines; this is 1055 over it, 3.64\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"86322d7929042694f226dc8aa987e27c35fee8bf009e164eb76f482e6744c50e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PushDownProjection.try_optimize_project: MethodTooLong \u2014 try_optimize_project runs 350 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 250 over it, 3.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":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e907d8c55411971827a6d0669c246ee3662836e75208c109ad2e1426694b3534"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Series: TooManyMethods \u2014 104 methods. The bar is 30 methods; this is 74 over it, 3.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":"daft/series.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"10edee88df75a720716e34229f1cdff3b15a37a45f7658aad1224d7f1be0b526"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/planner.rs: FileTooLong \u2014 1723 significant 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: SQLPlanner (4 blocks, 165-2293). The bar is 500 significant lines; this is 1223 over it, 3.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":"src/daft-sql/src/planner.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6df0c8239b9f696f27ca621f03a916cdc948c0ff74567ec84327fb03bbbb138"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python.rs: FileTooLong \u2014 1721 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1221 over it, 3.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":"src/common/io-config/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"827301fe146405e12f76f5c88989f9f45767df29f80fe2c9a6fa118350005e6a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyDataType: TooManyMethods \u2014 99 methods. The bar is 30 methods; this is 69 over it, 3.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-schema/src/python/datatype.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ed4997fb1877dff8684c26fbbcdb7ce8444b9924524637f6f441cb7ec176b4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RecordBatch: ClassTooLong \u2014 1310 significant 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, 9 blocks, lines 68-2060. The bar is 400 significant lines; this is 910 over it, 3.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f95f705222e106591a45b64b190a10eb06865584dea9ed7670aa6d5f28a5ebf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RecordBatch: TooManyMethods \u2014 94 methods, declared across 13 files: src/lib.rs (51), ops/window.rs (15), ops/partition.rs (6), ops/agg.rs (5), \u002B9 more file(s). The bar is 30 methods; this is 64 over it, 3.13\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3551f3803bd0581528e637c37b35821a18be5a1db54341eeb8ea2ef1a61518ac"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobScanOperator.try_new: MethodTooLong \u2014 try_new runs 300 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 200 over it, 3.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":"src/daft-scan/src/glob.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d469d5b922bc503e0dfabb77f6bfbed62f4c40ddccc54ebd2559bac3288257b8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordBatch.eval_expression_async_with_metrics: MethodTooLong \u2014 eval_expression_async_with_metrics runs 298 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 198 over it, 2.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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0860572c02410cb0e589315ecbc73877276ba2e0447d2933267dce6600ea8ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1445 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: RecordBatch (9 blocks, 68-2060). The bar is 500 significant lines; this is 945 over it, 2.89\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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"567c920b1269d7d0cdc457a3f6d9d3dcb70fcecb4ffbf1ceba029bef03b52a8d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PushDownFilter.try_optimize_node: MethodTooLong \u2014 try_optimize_node 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":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6d4f2ecfa32bd4a47b4c9f1634281a7b92a043b29fc2889539e064b290f23d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/cast.rs: FileTooLong \u2014 1405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 905 over it, 2.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":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4289348049ada79d046c02223931a53be8e30cba83d791270048b35bced5c8e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_local_plan::agg::populate_aggregation_stages_bound_with_schema: FunctionTooLong \u2014 daft_local_plan::agg::populate_aggregation_stages_bound_with_schema runs 277 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 177 over it, 2.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":"src/daft-local-plan/src/agg.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0935e2336a7c626f9c3593222d230e4cfe718e7ed5d2f66ca50ac17cdcb16f8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pipeline.rs: FileTooLong \u2014 1363 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 863 over it, 2.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":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f89d0ef4389ee392023fa3e13ed4b525ab136bf8fbe5e42801cf0da4c54f1e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Series.deserialize: MethodTooLong \u2014 deserialize 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":"src/daft-core/src/series/serdes.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e625ac24e9c878da423c566c82436c228045ecd79df3881d902530f086fb3f54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: builder/mod.rs: FileTooLong \u2014 1321 significant 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: LogicalPlanBuilder (5 blocks, 61-1233). The bar is 500 significant lines; this is 821 over it, 2.64\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":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee953cb4f56920df7fb0002cb76446b16852b81f0c430df0758473a74e01c31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/s3_like.rs: FileTooLong \u2014 1262 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 762 over it, 2.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ac96c167a83516af6a11b7f3ac2578e1ab46f9df03bf73e4ed7953527c2082"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: page.QueryPageInner: FunctionTooLong \u2014 QueryPageInner runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/daft-dashboard/frontend/src/app/query/page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9325e7a9ca70b11ce8b606776721e17d034e3187a0e8e754aa1f7e7d6cfcb8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataType: TooManyMethods \u2014 75 methods. The bar is 30 methods; this is 45 over it, 2.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/datatype.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"279104d4231651eaf4c0333b9a75e83ebf90f440526a4b86d651c69ad4469109"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Expr: ClassTooLong \u2014 990 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 71 methods, 3 blocks, lines 222-2552. The bar is 400 significant lines; this is 590 over it, 2.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"7471e17c5df4adc9bf5b307798c8b404fc6b2b53f00f1788265b0c24c20f4a9e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyExpr: TooManyMethods \u2014 74 methods. The bar is 30 methods; this is 44 over it, 2.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":"src/daft-dsl/src/python.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"1804537876bd1bfd980c26a1275c2585a39df540c9c098363756af853be0dedc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordBatch.eval_expression_internal: MethodTooLong \u2014 eval_expression_internal runs 241 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 141 over it, 2.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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a494f7fcf729123d8377833fdbc7f060e6439388d7f1e89444804a0a00a6e86"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PySeries: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/python/series.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfe02089efbb8b62c1cfbd03e06ff1e0f0c4cbf72b8626efdeee71bf05bb20a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Expr: TooManyMethods \u2014 71 methods, declared across 2 files: expr/mod.rs (66), arithmetic/mod.rs (5). The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8d88c78eebb3bd96cd74d1fab4ad5b3d682cd84c74acccadf3439ffdefc5fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataType: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-schema/src/dtype.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c5f8cf0ce1a6cf4b64f758149953b9455c4673660a3bcedc2790db2de2ccb4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlan.with_new_children: MethodTooLong \u2014 with_new_children runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.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":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de92c19f65d77d919681e92bb30183333ba73f33a7f1988a4b0affc24fd886b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DataArray: TooManyMethods \u2014 69 methods, declared across 33 files: array/mod.rs (18), array/from.rs (5), ops/log.rs (5), ops/sign.rs (3), \u002B29 more file(s). The bar is 30 methods; this is 39 over it, 2.30\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":"src/daft-core/src/array/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcbca5d7c3a2d2806e809eb032acb66bc8461245e1c49687c6ef8569d5caf51"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalPlan: ClassTooLong \u2014 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), 21 methods, 4 blocks, lines 35-1223. The bar is 400 significant lines; this is 502 over it, 2.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"396af67ac4b06816fcb5209017387f3cf272e06ef615f0560f90904d32a8879b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: expressions/expressions.py: FileTooLong \u2014 1111 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"daft/expressions/expressions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcfc19953587ffe7759595c6fd047fe43356e54508a1c7a57d7142354de7117"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_io::object_store_glob::glob: FunctionTooLong \u2014 daft_io::object_store_glob::glob runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.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":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"05789834004e729f74f31db137998356d52a93ad0d935b058492bb1331ceac07"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_logical_plan::ops::project::replace_column_with_semantic_id: FunctionTooLong \u2014 daft_logical_plan::ops::project::replace_column_with_semantic_id 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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00788348ecea6fc341d170b6d9aa1e8a267f2bb6e7ef82964a6415d1a9e3e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python.rs: FileTooLong \u2014 1052 significant 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: PyMicroPartition (4 blocks, 32-1273). The bar is 500 significant lines; this is 552 over it, 2.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd01ef1f841725a0d2b485eb8c8ecda9c1cec4d8c67f33389157db9a6ac5b485"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SQLPlanner: TooManyMethods \u2014 62 methods, declared across 4 files: src/planner.rs (43), src/statement.rs (11), src/functions.rs (7), table_provider/mod.rs (1). The bar is 30 methods; this is 32 over it, 2.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":"src/daft-sql/src/planner.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa8acd26576c4edcee5556e577107d6f26b2db6b9422239dc631e5f7857c2d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/logical_plan.rs: FileTooLong \u2014 1024 significant 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: LogicalPlan (4 blocks, 35-1223). The bar is 500 significant lines; this is 524 over it, 2.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f2b50820bc882e4934a765aae216a974de8f77ea9c8e8bce52bc446e8fa2f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/inline_agg.rs: FileTooLong \u2014 1014 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 514 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf624542d5457aefbcfee806775b19f188142f9613e61ed9bf1dd39bc846a53c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalPlanBuilder: ClassTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 55 methods, 5 blocks, lines 61-1233. The bar is 400 significant lines; this is 389 over it, 1.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":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f509888f15fe2888e7502c5d4677f23e5595a19ff0af170db2e1237354f5a39"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MicroPartition: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.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":"daft/recordbatch/micropartition.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ba4ab6e9bfca5cd053f0b3eef23b7cae2b2ebbb024a182d0c41426b32a6cc1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PyMicroPartition: ClassTooLong \u2014 772 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 53 methods, 4 blocks, lines 32-1273. The bar is 400 significant lines; this is 372 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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff138646682c7544d0a4477ca5c3b4485ba9bbc8b2a808c16bc5950f0b6a2109"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_sql::modules::config::expr_to_iocfg: FunctionTooLong \u2014 daft_sql::modules::config::expr_to_iocfg 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":"src/daft-sql/src/modules/config.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee355cf08e2000adfac98f832db5717081ce79f8d99a709122c92f5cc99d76e5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python.rs: FileTooLong \u2014 940 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 440 over it, 1.88\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4d2ece013fc2495a6e352b1fb3cf4f397531f8b14072df863bc19b7d6a5a43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_recordbatch::ops::inline_agg::try_create_accumulator: FunctionTooLong \u2014 daft_recordbatch::ops::inline_agg::try_create_accumulator runs 187 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"208725e0bcac54fd3534757e126039ce65b40ea6ccec8afc044d5cd9176771fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogicalPlanBuilder: TooManyMethods \u2014 55 methods. The bar is 30 methods; this is 25 over it, 1.83\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bd26a625c5af217b61e309cfe41e5a19df14d504a60c53f9a1a4b22c9cdc1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PushDownLimit.try_optimize_node: MethodTooLong \u2014 try_optimize_node runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.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":"src/daft-logical-plan/src/optimization/rules/push_down_limit.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"979df00c01af248e5c10427e23d5995d6af23ac627b2c46bea0a5fdcc879daf5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyMicroPartition: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ddceaaafaf93c8953a19add21120659c2935a6d25c4b1dddaa6e2791108d85"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataType: ClassTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 71 methods, 6 blocks, lines 17-1144. The bar is 400 significant lines; this is 298 over it, 1.75\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-schema/src/dtype.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ed92f6a48298442a3b31727951355b094623859dc0bcb5e602a2d6abd81503"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LocalPhysicalPlan: TooManyMethods \u2014 52 methods. The bar is 30 methods; this is 22 over it, 1.73\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4f1f9dae0f40dbd153c1145990a220d32eb27b4db98b3e0d008c02f14cf631"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/kernels.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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b306ef9d985836e2e50f9c8fef611c44ff5899b170fa75cfac7e78ff5ebc04"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_ext_macros::daft_func_impl: FunctionTooLong \u2014 daft_ext_macros::daft_func_impl 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":"src/daft-ext-macros/src/lib.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca6bdea8af52db77aa5a1aa20effa0d2c228d245bac6f14531b98680e3e9c89"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_writers::csv_writer::make_csv_writer: FunctionTooLong \u2014 daft_writers::csv_writer::make_csv_writer 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":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5fb32eeb1cb65e2ab805c7412d83bf6cd8ba815e4de0e5975c77c21cffff08"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RecordBatch: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/recordbatch.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9ed16da1755a2646ff7e875ad2aa6423941bc4d2ca1e5d67ec6117ee75646c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/session.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f1e9352f963d104126f68dca1cccb5f67404a9e73ce4baffcc098b8886e3f0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlan.required_columns: MethodTooLong \u2014 required_columns 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":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"25dbabbec6368a90dd0f274736643c10dc3e9af1c05e4408522ee8e74efd86dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Literal.into_pyobject: MethodTooLong \u2014 into_pyobject 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":"src/daft-core/src/lit/python.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc5da6b9ddf5abfcb4ded1cfaa06fbb80cefd5910937f7136f9e562adae5023"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.semantic_id: MethodTooLong \u2014 semantic_id 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12af976cacf6d08506184d264f09b59ab94f52215e4734edaff5166a6cd114c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.to_field: MethodTooLong \u2014 to_field 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2038}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5611170f191754f2aa99a1f039085781d97768bef1f1de6423f0ab6b1e4f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProbeExecutionContext.process_probe_input: MethodTooLong \u2014 process_probe_input 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":"src/daft-local-execution/src/join/probe.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e752a8e8bfb008606c3ced75f1ccaeb201cf0a2800d778ef5b07a855389cedd6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PushDownAntiSemiJoin.try_optimize: MethodTooLong \u2014 try_optimize 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":"src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"97443ced0e819e842e81af8561746698fc5d7c13a2f4e0482f39357f7bc089d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LogicalPlanBuilder: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/logical/builder.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2a3d02d46353ed5cc1745a3a66868ab71bc55c2ed4eee961c301e677a9893e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LogicalPlan.map_expressions: MethodTooLong \u2014 map_expressions 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":"src/daft-logical-plan/src/treenode.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"536572b1972e61bf3c31d74e0406e5c250a3325910964535e4c87e72abda79e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daft/datatype.py: FileTooLong \u2014 810 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 310 over it, 1.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":"daft/datatype.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17253d6786e8f5470cd99092141aca49974651482520e8b363eaf778ee32686"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_scan::expr_rewriter::rewrite_predicate_for_partitioning: FunctionTooLong \u2014 daft_scan::expr_rewriter::rewrite_predicate_for_partitioning 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":"src/daft-scan/src/expr_rewriter.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9ca804704123f7eb120f43bf5b481355798b72a566e74b5b6d35e0daa1ce80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/engine.rs: FileTooLong \u2014 789 significant 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 289 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":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"051a94ebd197fce0ecb8fd2b789b17ab4cbbd45bab43e1ee3706034a4d9f8728"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: S3LikeSource: ClassTooLong \u2014 616 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 9 methods, 3 blocks, lines 71-1564. The bar is 400 significant lines; this is 216 over it, 1.54\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b6f11e109af99029a5a125a76c9e79a88b469b030820cd6b32221c9b361f0c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: MicroPartition: TooManyMethods \u2014 46 methods, declared across 13 files: src/micropartition.rs (14), ops/partition.rs (5), ops/eval_expressions.rs (4), ops/join.rs (4), \u002B9 more file(s). The bar is 30 methods; this is 16 over it, 1.53\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1362dfeec712bcf71ddb76b02e55c8dbba94f02d061450fa8d24f3fb1afb63b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: daft/series.py: FileTooLong \u2014 761 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 261 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/series.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db9dbf9ba1da1992ebbe08d66c3e0b48af40c9a0cbcbce422b8ccd8659b0bf8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pickle/cloudpickle.py: FileTooLong \u2014 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 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":"daft/pickle/cloudpickle.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ba1ace5c4df1d34ef307df066fc11edcd896cb32d026a2cad378630c2b3178"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggExpr.to_field: MethodTooLong \u2014 to_field runs 148 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 48 over it, 1.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e144dc6c1730bbb9f95e573a36259fd55eeee56346111afd67fdf32153e46a4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_core::utils::supertype::get_supertype: FunctionTooLong \u2014 daft_core::utils::supertype::get_supertype 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":"src/daft-core/src/utils/supertype.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cc544cbfe621f014cef943aaa541ba589589d288348fca2e3438be2d1a32f5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyLogicalPlanBuilder: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"8849e8f72b5c09f6e3139b8baeda851c0ef0d3b4570f2e1a7d9071882d0771e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_logical_plan::ops::project::replace_column_with_semantic_id_aggexpr: FunctionTooLong \u2014 daft_logical_plan::ops::project::replace_column_with_semantic_id_aggexpr 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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"6088d5e46fe3d3e560a29897192b8ff2a9c506acff3d5deaf6389ee56e56c8a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dtype.rs: FileTooLong \u2014 721 significant 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: DataType (6 blocks, 17-1144). The bar is 500 significant lines; this is 221 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-schema/src/dtype.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d648d7f8ad4ca82cf061f6fe1ab50f3f6b68c174ca5688f0250cb75504f1f26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ops.rs: FileTooLong \u2014 719 significant 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 219 over it, 1.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-image/src/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03e3acb035f3c15d6d221906046ba7c8a0c8bc837ff28f587722fc01bb31a76"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_io::s3_like::build_s3_conf: FunctionTooLong \u2014 daft_io::s3_like::build_s3_conf 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":"src/daft-io/src/s3_like.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea37ab180ec3d7ac8a0075dbd5083cc07ce9224ec0571e1a963c9250a6ea30dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_sql::schema::sql_dtype_to_dtype: FunctionTooLong \u2014 daft_sql::schema::sql_dtype_to_dtype 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":"src/daft-sql/src/schema.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a5fa02acbed04bd1790babc5c458041e8bf0fad8a18bc395ab3172c4058b00"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordBatch.eval_agg_expression: MethodTooLong \u2014 eval_agg_expression 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"837c6debe723b4e7f9cf51e93293984cdf4d48d9c484a687648ead282cf8c1da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SQLPlanner.plan_query: MethodTooLong \u2014 plan_query 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":"src/daft-sql/src/planner.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63c132d53982faf39fc199f9e7999241d10e0575c8234a49f9f77a8ec10e0d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/temporal.rs: FileTooLong \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). The bar is 500 significant lines; this is 203 over it, 1.41\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"669b13371b46ecf65de5afda707e5c098e5f90dfb4a4853f2d39d83813c33ad9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/azure_blob.rs: FileTooLong \u2014 700 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 66% of them inside a single declaration: AzureBlobSource (3 blocks, 388-1061). The bar is 500 significant lines; this is 200 over it, 1.40\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":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4ed09c6b2f621bb358322c3617eb943ca4d2eeb017d8ba82418917775dbe26"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: join/asof_join.rs: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 198 over it, 1.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":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1251c25735f6893e55d60e73c1222b163616c82a43c03b304b7ae35256d089"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_dashboard::generate_interactive_html: FunctionTooLong \u2014 daft_dashboard::generate_interactive_html 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":"src/daft-dashboard/src/lib.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dfba25a31e1f51a6ee9dcd00b1fc615ded6e1101b5667b3ff74f43ea9d1cd9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: physical-plan-tree.PhysicalPlanTree: FunctionTooLong \u2014 PhysicalPlanTree runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"efeff9e7660fc242e4b7253ea730ca87513b9c6f02db6a66b71d6e5d83f66717"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyRecordBatch: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/python.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0f2eff8bb25fad57945c5a01d4a127369181a950089eb9eb43b1a6184ba998"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RuntimeStatsManager.new_impl: MethodTooLong \u2014 new_impl 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":"src/daft-local-execution/src/runtime_stats/mod.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"2324cc0c6eb53a4a1e13a80fd0e8a2918019fcae2625106024b9ef4b61bdd134"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: query/tasks-sidebar.tsx: FileTooLong \u2014 658 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7302e0fb18ad8a45b52442c34cfd99facb9b215085c4f504be91ece01ef2f8dc"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SeriesStringNamespace: TooManyMethods \u2014 39 methods. The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/series.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43e66d3a2e8f4ac97f6e56cb3214073dc2886c0e6c20cd52dfd53662a39a2b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_writers::json_writer::make_json_writer: FunctionTooLong \u2014 daft_writers::json_writer::make_json_writer runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/json_writer.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53a3384ef553f3db811ceab033dbd375642a301dd44651ddb8f872347b68c43"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PyDaftExecutionConfig.with_config_values: MethodTooLong \u2014 with_config_values runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/daft-config/src/python.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"190a64d909c3de9cdf77de9f9c301f276bb2de9655ee9fbe66bccd7b6e558e46"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: physical-plan-tree.PhysicalNodeCard: FunctionTooLong \u2014 PhysicalNodeCard runs 128 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a327958ccdd06e1ce2988d490d55215854e39b33ab27a68be1a3e9895f55f4c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 137 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":"src/daft-scan/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"892ba32d030eecae5075cbe53d50b4587ef9dd64be1a6629e56912593b704469"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/comparison.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":"src/daft-core/src/array/ops/comparison.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa44d553cb84522b5ef29eb60d6ce35014bccea78f4ae52ee532a3f43782f117"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AsofJoinOperator.finalize_probe: MethodTooLong \u2014 finalize_probe 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":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6364d8c69d3f456f1dbbb7392413beae18887fe95dc94c15b188e33c8eaf2b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlockingSinkNode.run: MethodTooLong \u2014 run 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":"src/daft-local-execution/src/sinks/blocking_sink.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60f514d5a02efde59e5d5693a6fa51c42ddb79cab4007791e954f48c3348876"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_logical_plan::optimization::rules::unnest_subquery::pull_up_correlated_cols: FunctionTooLong \u2014 daft_logical_plan::optimization::rules::unnest_subquery::pull_up_correlated_cols runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb31caa85793d8b06adb3625cb816f3b2dd2c01f387b6557cfc59db8722e523c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/local.rs: FileTooLong \u2014 621 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 121 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/local.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd35b95bd573e5dccbfdc420cfe18cfc304c46b28d13151c04d04a8c5c2915bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: tasks-sidebar.TasksSidebar: FunctionTooLong \u2014 TasksSidebar runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4a791029a7126a12ab05661d186bf04603ab1550b4d95b9f49270e60c38b4d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/state.rs: FileTooLong \u2014 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). The bar is 500 significant lines; this is 117 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":"src/daft-dashboard/src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e86bf036bf09924022996ca1b975f418252470f990da6a56774e24af7b9e8f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Catalog: 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":"daft/catalog/__init__.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d68614e6f64fef750485f14947a98f647792d437be370017e75cde02f1e3ed0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AsofJoinNode: ClassTooLong \u2014 484 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 3 blocks, lines 42-700. The bar is 400 significant lines; this is 84 over it, 1.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/join/asof_join.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1d10d193063168019e371b5b3c9e323083ef45aa661a1bd5dd2aee71aac224"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LogicalPlanToPipelineNodeTranslator: ClassTooLong \u2014 481 significant 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, 3 blocks, lines 58-697. The bar is 400 significant lines; this is 81 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":"src/daft-distributed/src/pipeline_node/translate.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd036a6bac9c71be8557bba4ff4971e901a05f5c961a5e19ab6c65c5a59efd73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_recordbatch::repr_html::html_value: FunctionTooLong \u2014 daft_recordbatch::repr_html::html_value 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":"src/daft-recordbatch/src/repr_html.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"6789a4e5b04e3c1830b1ef6c9c9f584aa9d732d9645756b3a74c742f2c6f4e14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Image.deserialize: MethodTooLong \u2014 deserialize 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":"src/common/image/src/image.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffe4691c34f2694f4a9292eed6277e9d86ee263fc016b0667b0ac2b8b46dafb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runners/ray_runner.py: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 92 over it, 1.18\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/runners/ray_runner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1efed91c70733cdc70108d3239a1043f36bec1376ddb9b8bcdff4f0a29d067"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GlobScanOperator: ClassTooLong \u2014 470 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 1 methods, 3 blocks, lines 28-793. The bar is 400 significant lines; this is 70 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":"src/daft-scan/src/glob.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7951a6d176c02ec9e419add3d0bcd56631c486cf182743444d66d7cdac2887a7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AggExpr: ClassTooLong \u2014 469 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 2 blocks, lines 341-1049. The bar is 400 significant lines; this is 69 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e5599e4679b68f63b337ca4deddbd299b26723b1709eba46e3db0f3879af2c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/read.rs: FileTooLong \u2014 586 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 86 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15639b478ba19e2824f15ccf16b5e0b228ba5aff53924a27d1f76f38d98d39ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.with_new_children: MethodTooLong \u2014 with_new_children 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":1882}}}],"partialFingerprints":{"codehealthFindingId/v1":"d567de233e11cefada448d2062d93eb256dd8ef511cfe8f48f2add4dbc896c58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/micropartition.rs: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 84 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fc33691e14a87622affebafaa9e7c11d983a4722e56e5aa0e34252717dece7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/aggs.rs: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 84 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/aggs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75e8b3439bd6433ff818ad0d4e8108a13176105660dac4b333c1e8bc6683a47"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: 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":"src/daft-session/src/session.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c2182c006d607f0eeeacf4b4c048da1dd4dd1f7469de90febd803e48372e94"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StructArray.cast: MethodTooLong \u2014 cast 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":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":1747}}}],"partialFingerprints":{"codehealthFindingId/v1":"50449bd8464770614c4faac4ee321fd9f52d7be3e24f64ce6cf5ca894c7e0012"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lit/python.rs: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 76 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":"src/daft-core/src/lit/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7377063ba75f9c8319b20db60a3eb7de7d0315624541a7348d342c643ca9776"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataArray.cast: MethodTooLong \u2014 cast 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":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d676c550c81e214f836379fe2f3d8b16f6d308a68e8a926317bc19361e4a8e12"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AsofJoinProbeState.probe_batch: MethodTooLong \u2014 probe_batch 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":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5a9b8f99236d77613d9ad84c3c8d25f8c374bad8bee6ae06c805248c725f4a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AzureBlobSource: ClassTooLong \u2014 459 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 3 blocks, lines 388-1061. The bar is 400 significant lines; this is 59 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":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"502edac23829909f37fa92228df8620e63aa3bb3ed7b37f7b319cf98605ff2d0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PyLogicalPlanBuilder: ClassTooLong \u2014 457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 4 blocks, lines 1246-1846. The bar is 400 significant lines; this is 57 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":1246}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb5be24dcf30a5041fc61be26ca9716af589025d88216ff26d866e43482541c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PushDownProjection: ClassTooLong \u2014 457 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 7 methods, 2 blocks, lines 23-687. The bar is 400 significant lines; this is 57 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"56af1f17805b1fff92c7419b592563e72180d403b1fa1d0419f7ae5b7d40b286"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: progress-table.ProgressTable: FunctionTooLong \u2014 ProgressTable runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"src/daft-dashboard/frontend/src/app/query/progress-table.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3bdd9d1cb1d606b9d458b2cb9d6f141929c50f395dc2f6049fd823f111b1211"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SortNode.execution_loop: MethodTooLong \u2014 execution_loop 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":"src/daft-distributed/src/pipeline_node/sort.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec3c2a7965a0f95475dc1821bb77181bf5d90a40639dd189ed5ab8a31b0ef5cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RayWorkerManager.retire_idle_workers: MethodTooLong \u2014 retire_idle_workers 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":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"0819ac7f260f12dd2432d658a25dce705649bf22ff53b9329837b0483bf01862"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DaftExecutionConfig: TooManyFields \u2014 34 stored fields beside 1 method. 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":"src/common/daft-config/src/lib.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"200b98340b3b96a2ace8f27c5d0660d325551648decfd54972ee763d39df0aba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/glob.rs: FileTooLong \u2014 565 significant 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: GlobScanOperator (3 blocks, 28-793). The bar is 500 significant lines; this is 65 over it, 1.13\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":"src/daft-scan/src/glob.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a7e76929544def0dae8814e99465087150e368c3b2fc06dd5bafa38e51cb97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RayWorkerManager.try_autoscale_bisect: MethodTooLong \u2014 try_autoscale_bisect 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":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54e4c69876c9d947282a42092b2eaaf655cf73ca1e070e18e758cc19c2a8657"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_json::read::read_json_single_into_stream: FunctionTooLong \u2014 daft_json::read::read_json_single_into_stream 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":"src/daft-json/src/read.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1665aeee6814d962540134d6fe4ad2074ab0d2f67675d3983c425965af7f4c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_micropartition::micropartition::read_parquet_into_micropartition: FunctionTooLong \u2014 daft_micropartition::micropartition::read_parquet_into_micropartition 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":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2767d1ce7c1ecd52ce259eef9a108d452aba408098d2cad201ec6f9b876143f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/config.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":"src/daft-sql/src/modules/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4a49c46de63299b57be0f6a9b91232d0bd1cd1d0ffbf5f0e59295323fd4859"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Literal.from_pyobj: MethodTooLong \u2014 from_pyobj 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":"src/daft-core/src/lit/python.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"49934f710d7c6739cce86140c927ee923f51f7b08de9b614f0487e2191c8d064"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_recordbatch::ops::joins::merge_join::merge_inner_join: FunctionTooLong \u2014 daft_recordbatch::ops::joins::merge_join::merge_inner_join 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":"src/daft-recordbatch/src/ops/joins/merge_join.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc49babd32837a2cff9f5b34c87e3a5b75ab0e1a1851543e3ff7b10884d7cb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reader/field_reader.rs: FileTooLong \u2014 559 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 59 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/reader/field_reader.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9842fd80656ad0855b651181bbc94ccbbea7474960a88d6dd0b0ca79631399"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: runners/flotilla.py: FileTooLong \u2014 557 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"daft/runners/flotilla.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfd2aa30c413b442997c9605eb1b86d06424c4b407a9c9adba0d610e15e27a4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Literal: ClassTooLong \u2014 444 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 25 methods, 4 blocks, lines 36-688. The bar is 400 significant lines; this is 44 over it, 1.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/lit/mod.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa2dfcc0a9e2bfd4d15b7eab03de61981b8a8ad1ee1d96d04d71da191026e5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/sidebar.tsx: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 55 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":"src/daft-dashboard/frontend/src/components/ui/sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a000fca86b5edf79cfc2e11a5de7c9c821414b633508788e3598d3fc09f3eec5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Expr.display_name: MethodTooLong \u2014 display_name 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"21132da2b2740a5aea696e6cc75f02c805517379b93a5e54d5d86a662ab5d47c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggExpr.semantic_id: MethodTooLong \u2014 semantic_id 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c320c60c835f517e5ceba2dd8d9f700512a95ee12b3f96ab42a78ea05385079"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Error.from: MethodTooLong \u2014 from 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":"src/daft-io/src/s3_like.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c8547398d9d89eb481e1e3c3f2a1f43f693f43142e28ae2549eb83d4e90555"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: datatypes/infer_datatype.rs: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 47 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":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf92880b4ae1163f783fdb6db79778abcdd8a18633be69eae0c998aaf9ac1c4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PyRecordBatch: ClassTooLong \u2014 434 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 41 methods, 4 blocks, lines 26-628. The bar is 400 significant lines; this is 34 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/python.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c884855eaff04b23f0681c7329340fe6d41970944cafc6a87a2977220ab0b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/translate.rs: FileTooLong \u2014 541 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 41 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":"src/daft-local-plan/src/translate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ac266701db4a3471efd3b56313fdb5225738f01137c07175037355ddbb7f45"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_cli::dashboard::start: FunctionTooLong \u2014 daft_cli::dashboard::start 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":"src/daft-cli/src/dashboard.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e4a8e23be20749d70cf334ada63ad123cbdbc855df56d33a6215e302425720"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ScanTaskSource.spawn_scan_task_processor: MethodTooLong \u2014 spawn_scan_task_processor 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":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bf3cb5484cbff22f66d95271aa254442fc3259ef382a764522edd4b75d1654"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/run.rs: FileTooLong \u2014 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 36 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c5e63f4cb0a1630971e55ae695f6ec277e507dc4229dafe55b153f6643f30f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: daft_csv::read::read_csv_single_into_table: FunctionTooLong \u2014 daft_csv::read::read_csv_single_into_table 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":"src/daft-csv/src/read.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9746586bea2432ea4e54f47339c6b0af03d5911a4ddb4969f03ef3376a5de5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WindowPartitionAndOrderBySink.finalize: MethodTooLong \u2014 finalize 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":"src/daft-local-execution/src/sinks/window_partition_and_order_by.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"831185e3cd4191623a585eec762cafc5e91a66246f68a10adff7c7ac4fc98be0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GlobScanOperator.to_scan_tasks: MethodTooLong \u2014 to_scan_tasks 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":"src/daft-scan/src/glob.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba3ca30840c8d98e7b984a342612a208546cccebecd14b5a60e729e1e8b66a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python.rs: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48a6a60dcc3dcf7ec127a67fb73d1e784f2b94152d1cbab9f12f6bcce6127cb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PythonArray: TooManyMethods \u2014 32 methods, declared across 13 files: datatypes/python.rs (18), array/from.rs (2), ops/repr.rs (2), ops/cast.rs (1), \u002B9 more file(s). 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":"src/daft-core/src/datatypes/python.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"519ec1fec6082dbbe8f7e5cd8fd45a06acab0bba019e6d7027a0987997420641"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: reorder_joins/join_graph.rs: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 29 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4971df7992162fd2b966bc63c31700eb88f79358c17bf3da30fd52e5856429e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline_node/sort.rs: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fc64a6b186de1ac19d40dcfe9f2768fd127bc303861360597f0d14795cb282"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pipeline_node/translate.rs: FileTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 92% of them inside a single declaration: LogicalPlanToPipelineNodeTranslator (3 blocks, 58-697). The bar is 500 significant lines; this is 25 over it, 1.05\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/translate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd5e24c82c75d7785ae9dc407dd740a7f203217f8ba7467577cbe343fa4b9b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/project.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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50405af47b30d29eec601fe00dd2949376afbf1104896ccd7852f887423bf65b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ops/window.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), about 98% of them inside a single declaration: RecordBatch (15-750). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec806b214b2cf7fb672a5856ed3863de9f29dc1488b285137742fdd427eda959"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: kernels/hashing.rs: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 20 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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85487a3f7b4f2130a87fb3d5e71ce362b6abb237e59e91dbdd6636c1302e2010"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ListArray: TooManyMethods \u2014 31 methods, declared across 13 files: array/list_array.rs (16), array/from.rs (2), ops/hash.rs (2), ops/repr.rs (2), \u002B9 more file(s). The bar is 30 methods; this is 1 over it, 1.03\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":"src/daft-core/src/array/list_array.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e616efa8bb684225aca6126109b7dd82114da3deb32ce3ad97499bdbf6a328f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PySession: 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":"src/daft-session/src/python.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1dd923fed4329870f808f38fcf1ce519343b24fd84cb518aab9b45472a1db35"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: join/asof_join.rs: FileTooLong \u2014 515 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: AsofJoinNode (3 blocks, 42-700). The bar is 500 significant lines; this is 15 over it, 1.03\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":"src/daft-distributed/src/pipeline_node/join/asof_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"743d2d8198bea2579e380f0aa1c4bcb303e59562fb1e3c39f46c3d11038d1e4d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RayWorkerManager: ClassTooLong \u2014 407 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 4 blocks, lines 156-784. The bar is 400 significant lines; this is 7 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb85fff238da4e714bf5a2c7357383e8fa358ee417c36c93e3e401350c30bdd0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ray/worker_manager.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 80% of them inside a single declaration: RayWorkerManager (4 blocks, 156-784). 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":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"078e40f5f414b5585e359c1fa3e569dc7ac82fffe47c49df0c0de88b10f8cecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 23 shared lines): src/daft-file/src/functions.rs:95-158 | src/daft-file/src/functions.rs:189-252 | src/daft-file/src/functions.rs:283-344 | src/daft-file/src/functions.rs:375-436 \u2014 These 4 members are variants of one another: a block of 23 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":"src/daft-file/src/functions.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"044fbf2d78875cc8d19544106cc6d1a48b7dd28568dcc5218920cca065b2f7f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 20 shared lines): src/daft-local-execution/src/join/inner_join.rs:14-85 | src/daft-local-execution/src/join/left_right_join.rs:20-91 | src/daft-local-execution/src/join/left_right_join.rs:97-171 | src/daft-local-execution/src/join/outer_join.rs:62-157 \u2014 These 4 members are variants of one another: a block of 20 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/inner_join.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f15cbf6f41071d0de630f4c40b8bf1384bea86186210e59fe7e20e8c4880a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (133 shared lines): src/daft-recordbatch/src/lib.rs:886-1279 | src/daft-recordbatch/src/lib.rs:1298-1610 \u2014 These two members are variants of one another: 133 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b637188c368b602e1082faefdd5de18b197d4fd65bb38cb2bb811b17c8c09f"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (55 shared lines): src/daft-recordbatch/src/ops/inline_agg.rs:950-1021 | src/daft-recordbatch/src/ops/inline_agg.rs:1040-1112 \u2014 These two members are variants of one another: 55 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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":950}}}],"partialFingerprints":{"codehealthFindingId/v1":"691bece79038429993cb53bc5a6fa85e3f4e679974bc086476bcd6e414c958ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): src/daft-functions-utf8/src/split_part.rs:99-164 | src/daft-functions-utf8/src/substring_index.rs:97-160 \u2014 These two members are variants of one another: 48 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":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08e809672032dfeb86bf1702e381ba8a32dd192e548add4ee55b9bb9ddd44b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (40 shared lines): src/daft-io/src/gravitino.rs:97-144 | src/daft-io/src/unity.rs:77-124 \u2014 These two members are variants of one another: 40 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":"src/daft-io/src/gravitino.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"797ecdd3d0374b07a3782015632fd80df90a0899e16c81826a046043b080181c"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (35 shared lines): src/daft-csv/src/read.rs:178-253 | src/daft-parquet/src/read.rs:186-238 \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":"src/daft-csv/src/read.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c86567278d0d35bb39b731531fcfa8276eff767f2bd778ca8580f706228170"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (30 shared lines): src/daft-logical-plan/src/ops/set_operations.rs:179-249 | src/daft-logical-plan/src/ops/set_operations.rs:486-535 \u2014 These two members are variants of one another: 30 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":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5baaa84e55899fe13843818869a8c666602ad529041b02644a8f0c552a940bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): src/daft-functions-temporal/src/date_construction.rs:117-198 | src/daft-functions-temporal/src/date_construction.rs:284-365 \u2014 These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_construction.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"38af4187c25d801c4acc3a026800c04e1e4cf74d208cb5ff900102e9b415526e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/daft-functions-temporal/src/date_construction.rs:204-254 | src/daft-functions-temporal/src/date_construction.rs:371-421 \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":"src/daft-functions-temporal/src/date_construction.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b099a32c121bf764d423894ec35aca6215544a8dd004078bd60bd4c81c7e75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-dsl/src/python_udf/batch.rs:129-181 | src/daft-dsl/src/python_udf/batch.rs:197-224 \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":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11f0d37c23d0db460abfb155c4f27e73c4128d240e60428b613b5d96888e55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-functions-utf8/src/regexp_extract.rs:57-75 | src/daft-functions-utf8/src/regexp_extract_all.rs:59-80 \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":"src/daft-functions-utf8/src/regexp_extract.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0027a1ca7e22c99b47620a8b18a132318487d467fabcc0c12d59160fe30e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-distributed/src/pipeline_node/sort.rs:661-681 | src/daft-distributed/src/pipeline_node/top_n.rs:82-105 \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":"src/daft-distributed/src/pipeline_node/sort.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6b6a445652cfab34ac1e4e01ab932cfffb37037d699edf66feed76ca39783f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): src/daft-local-plan/src/plan.rs:158-208 | src/daft-local-plan/src/plan.rs:211-259 | src/daft-local-plan/src/plan.rs:261-309 | src/daft-logical-plan/src/logical_plan.rs:435-471 | src/daft-logical-plan/src/logical_plan.rs:1033-1066 | src/daft-logical-plan/src/logical_plan.rs:1068-1101 \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":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"346b3ce5994dc82567e614e1cdeb56cdc39470b7de95169dcd4cbc1f881d4f5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/daft-core/src/array/ops/broadcast.rs:62-85 | src/daft-core/src/array/ops/broadcast.rs:89-106 | src/daft-core/src/array/ops/broadcast.rs:110-129 | src/daft-core/src/array/ops/broadcast.rs:133-152 | src/daft-core/src/array/ops/broadcast.rs:156-175 \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":"src/daft-core/src/array/ops/broadcast.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1404003c08a58b7dc8c6caefa09baedcfa48d2719146ecfb033182fdf8156119"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/daft-core/src/array/ops/compare_agg.rs:24-51 | src/daft-core/src/array/ops/compare_agg.rs:106-132 | src/daft-core/src/array/ops/compare_agg.rs:165-191 | src/daft-core/src/array/ops/compare_agg.rs:224-257 | src/daft-core/src/array/ops/compare_agg.rs:297-327 \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":"src/daft-core/src/array/ops/compare_agg.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1032448609d13b324c62b9dbc2521338375961a8b59824bb6fd260d70ef4a05a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/daft-csv/src/local.rs:195-290 | src/daft-csv/src/read.rs:300-445 | src/daft-csv/src/read.rs:455-544 | src/daft-json/src/read.rs:148-260 | src/daft-json/src/read.rs:304-408 \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":"src/daft-csv/src/local.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4cab099261d0bc40cf666baf37fa63e6b1d5cc366394833483e0924d4b66339"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/daft-csv/src/read.rs:300-445 | src/daft-csv/src/read.rs:455-544 | src/daft-json/src/read.rs:148-260 | src/daft-json/src/read.rs:304-408 | src/daft-warc/src/lib.rs:517-622 \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":"src/daft-csv/src/read.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"2763b55746cdf1cabfcfcbc09a8c55dbc66b2a6e826952c06efead8e68b7c94a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/daft-local-execution/src/concat.rs:133-153 | src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:341-361 | src/daft-local-execution/src/join/join_node.rs:88-108 | src/daft-local-execution/src/sinks/blocking_sink.rs:489-509 | src/daft-local-execution/src/streaming_sink/base.rs:474-494 \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":"src/daft-local-execution/src/concat.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8628ae5172bd7208fdcb7c961cb7f51a49885db3a70ea37d3d45da4e7064eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:320-339 | src/daft-local-execution/src/join/join_node.rs:67-86 | src/daft-local-execution/src/sinks/blocking_sink.rs:469-487 | src/daft-local-execution/src/sources/source.rs:193-212 | src/daft-local-execution/src/streaming_sink/base.rs:453-472 \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":"src/daft-local-execution/src/intermediate_ops/intermediate_op.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"b344323acfb69d7607e2d59b05ffd193c11a0e76fe319b54af7692df75835e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/daft-core/src/array/growable/fixed_size_list_growable.rs:25-54 | src/daft-core/src/array/growable/list_growable.rs:30-62 | src/daft-core/src/array/growable/python_growable.rs:28-45 | src/daft-core/src/array/growable/struct_growable.rs:24-61 \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":"src/daft-core/src/array/growable/fixed_size_list_growable.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3709558c02b61ded17b54d764b618bdc124d2cd201a6a8028bc95cbbf1edadb"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/daft-distributed/src/pipeline_node/explode.rs:60-77 | src/daft-distributed/src/pipeline_node/filter.rs:60-77 | src/daft-distributed/src/pipeline_node/stage_checkpoint_keys.rs:95-110 | src/daft-distributed/src/pipeline_node/udf.rs:58-81 \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":"src/daft-distributed/src/pipeline_node/explode.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b057b061a38173430bcfb2fbd69f9c13b0796b3dc2050db779466bc310f1608"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/daft-io/src/s3_like.rs:789-887 | src/daft-io/src/s3_like.rs:895-960 | src/daft-io/src/s3_like.rs:974-1079 | src/daft-io/src/s3_like.rs:1131-1205 \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":"src/daft-io/src/s3_like.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f488aa2088c759b86332446e175da8503ad5235006764fa38ce7c7e4b154e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/daft-local-execution/src/sinks/sort.rs:111-131 | src/daft-local-execution/src/sinks/top_n.rs:155-186 | src/daft-logical-plan/src/ops/sort.rs:80-103 | src/daft-logical-plan/src/ops/top_n.rs:125-158 \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":"src/daft-local-execution/src/sinks/sort.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5272a1020c05a6eed5c9c895727fa49ab821d372b22d9e8b00b29768a30e690"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/daft-micropartition/src/python.rs:1026-1044 | src/daft-micropartition/src/python.rs:1057-1080 | src/daft-micropartition/src/python.rs:1090-1117 | src/daft-micropartition/src/python.rs:1127-1154 \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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":1026}}}],"partialFingerprints":{"codehealthFindingId/v1":"733877fd4756f82c9609ef8e7484c379ed631459736da48f0e5107a7aa0bec7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/daft-recordbatch/src/ops/joins/hash_join.rs:25-115 | src/daft-recordbatch/src/ops/joins/hash_join.rs:124-234 | src/daft-recordbatch/src/ops/joins/hash_join.rs:243-305 | src/daft-recordbatch/src/ops/joins/hash_join.rs:313-446 \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":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"147cf03eb902b3f436220eb94ce7efa1b01fec1ab107da10871949d115b2b50c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/daft-sql/src/modules/config.rs:36-137 | src/daft-sql/src/modules/config.rs:178-221 | src/daft-sql/src/modules/config.rs:244-298 | src/daft-sql/src/modules/config.rs:369-433 \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":"src/daft-sql/src/modules/config.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b742231a820dc74d968f43dc9c17d49015b26b30c950532bc19965bbfce3b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/daft-writers/src/pyarrow.rs:27-76 | src/daft-writers/src/pyarrow.rs:84-124 | src/daft-writers/src/pyarrow.rs:134-167 | src/daft-writers/src/pyarrow.rs:176-208 \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":"src/daft-writers/src/pyarrow.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cc2d506e7b4ef9ce812daa3eb3c06712fd17acc4f042f943061549a454e8ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): daft/dataframe/dataframe.py:1028-1109 | daft/dataframe/dataframe.py:1125-1225 | daft/dataframe/dataframe.py:1238-1326 | daft/dataframe/dataframe.py:1338-1400 \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":"daft/dataframe/dataframe.py"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e32ff4aa47c96d1e65c36f236bb2e4875ef88838eb42df6c18d590b9a98c61"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): daft/recordbatch/micropartition.py:221-249 | daft/recordbatch/micropartition.py:428-456 | daft/recordbatch/recordbatch.py:264-290 | daft/recordbatch/recordbatch.py:441-469 \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":"daft/recordbatch/micropartition.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"574e3f21ca4dfc6ec2f83a5f68b11cbeb5865ad99704fca185f8b6c8c76ed89e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (175 corresponding lines): src/daft-writers/src/csv_writer.rs:173-405 | src/daft-writers/src/json_writer.rs:139-313 \u2014 These two members are one piece of code written twice and then edited apart: 175 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e319b8805293dc1a5b723cff3d339831906130b6e22e0b4bfd2beea7ea35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (83 corresponding lines): src/daft-core/src/datatypes/infer_datatype.rs:566-660 | src/daft-core/src/datatypes/infer_datatype.rs:662-744 \u2014 These two members are one piece of code written twice and then edited apart: 83 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6731a25598b613338ea47e6de65da5de22bdf6cc919a063430f1c7b107c02f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (92 corresponding lines): src/daft-core/src/series/ops/arithmetic.rs:118-237 | src/daft-core/src/series/ops/arithmetic.rs:242-333 \u2014 These two members are one piece of code written twice and then edited apart: 92 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/ops/arithmetic.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"215b4d4ac0154589f0c0e304a7969f7f8d10b6e1752ecaa546f43936192d7e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (120 corresponding lines): src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:122-241 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:113-255 \u2014 These two members are one piece of code written twice and then edited apart: 120 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76850b29610be333ecc70476aebb5dc16ee0d80254df4defc68b0a5b33bc5c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/daft-logical-plan/src/logical_plan.rs:1103-1147 | src/daft-logical-plan/src/logical_plan.rs:1149-1193 \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":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50ba7fe8cc8c80d09c5f057a8ce307202af09ef28387a790505abcb4d9e497d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): src/daft-local-plan/src/plan.rs:1178-1231 | src/daft-local-plan/src/plan.rs:1262-1318 \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":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a922c80bbe85706fb2f2aa4a4c14f85f60d0049336149aaa691bdec4e3b9bc3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/daft-core/src/lit/deserializer.rs:284-320 | src/daft-core/src/lit/deserializer.rs:335-371 \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":"src/daft-core/src/lit/deserializer.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c431f40daee05e6ed915bcd0ba74f55f30bb2c31e81f30eb93f0a64601ec87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): src/daft-core/src/series/ops/agg.rs:40-110 | src/daft-core/src/series/ops/agg.rs:112-190 \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":"src/daft-core/src/series/ops/agg.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4632981e983524bbb4b261aeae260535ca8936c8e5255a6dc719d3532f25a578"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): src/daft-ext-macros/src/types.rs:51-144 | src/daft-ext-macros/src/types.rs:219-293 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext-macros/src/types.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"333ef58485ed02c48ae2c77b4d187be3f950d630dd0c8e41d094ad45ccb271fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): src/daft-algebra/src/simplify/boolean.rs:82-154 | src/daft-algebra/src/simplify/boolean.rs:176-248 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-algebra/src/simplify/boolean.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"244465c13bda99a6b1947e3dba1609c489aa4f6c3f1954a785415b606634f6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (73 corresponding lines): src/daft-json/src/local.rs:125-208 | src/daft-json/src/local.rs:329-401 \u2014 These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/local.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bca2adab5a0800580290b69b4f79aa5ef15e9b56e67e7ef1985614ad153ace"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (62 corresponding lines): src/daft-functions-utf8/src/left.rs:80-141 | src/daft-functions-utf8/src/right.rs:87-150 \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":"src/daft-functions-utf8/src/left.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa818593b2a67a90c8942d1ae15fdf7d2608b46093cc49233e2d3b58a003e089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): src/daft-core/src/datatypes/infer_datatype.rs:384-424 | src/daft-core/src/datatypes/infer_datatype.rs:430-470 \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":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f572a9fd222c259a10fb77dd921a00cda224a87d438f42b94c5216bda04771"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/daft-functions-list/src/kernels.rs:527-575 | src/daft-functions-list/src/kernels.rs:577-621 \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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"741b300fbb09fbb82357a16977adf72c00057ad09a854c9fdda4741b6195fe71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): src/daft-scan/src/python/wrappers.rs:181-244 | src/daft-scan/src/python/wrappers.rs:372-425 \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":"src/daft-scan/src/python/wrappers.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"b17043b5d668fd4c711ca6af2741b2a4c0af7998ee003b0f35f30fbaee15f839"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): src/daft-distributed/src/pipeline_node/join/asof_join.rs:113-163 | src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:110-156 \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":"src/daft-distributed/src/pipeline_node/join/asof_join.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8245547ca21363a1d7270f045e927d29e66c3f5fddd6d5f45032511eea8972"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-functions/src/numeric/sign.rs:23-42 | src/daft-functions/src/numeric/sign.rs:75-115 \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":"src/daft-functions/src/numeric/sign.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6984c3b8ff35fec337c3dba955777e950717babf3cd69447ae96f38b9bfcac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): src/daft-functions-list/src/kernels.rs:463-525 | src/daft-functions-list/src/kernels.rs:874-926 \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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ee7785116990361ff47923dcabbd1977d9f6119fe62053c9be1d23ee2aee92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): src/daft-core/src/kernels/search_sorted.rs:24-84 | src/daft-core/src/kernels/search_sorted.rs:146-216 \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":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dcc86b11a0002217328d7e5382a930ceea6ce7c877f684267cc3da70c26c214"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 47\u002B corresponding lines): src/common/io-config/src/cos.rs:76-122 | src/common/io-config/src/goosefs.rs:97-156 | src/common/io-config/src/tos.rs:66-121 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 47 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/cos.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"2024e7fb850654f75685dd1fac6e931506ea35a7054b23d9232191ea78119779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/daft-local-execution/src/join/left_right_join.rs:176-220 | src/daft-local-execution/src/join/left_right_join.rs:225-269 \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":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ca10ee8f33daff991aab7037b0fef4b6545e74c1f9bb435730405f5de6756a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/daft-functions/src/similarity/bitwise_hamming.rs:86-131 | src/daft-functions/src/similarity/bitwise_hamming.rs:133-181 \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":"src/daft-functions/src/similarity/bitwise_hamming.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"03204014f1bbe4b4e0aaa1a489526f10a28ea15311e06199d23bbb10ca8f0c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): src/daft-csv/src/read.rs:86-140 | src/daft-warc/src/lib.rs:435-486 \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":"src/daft-csv/src/read.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e3be4fa660c0846f77fb309869e153b21c4e2eddfa8489a6fc727e6e32cef0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): src/daft-sql/src/modules/temporal.rs:651-696 | src/daft-sql/src/modules/temporal.rs:716-761 \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":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d80a074b9a27edf0e77a8a75d26e1d434e295975487303f342750efd0c301dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): src/daft-logical-plan/src/builder/mod.rs:1027-1096 | src/daft-logical-plan/src/builder/mod.rs:1102-1168 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"955c5f2e6e02f6faee789bec94da789472de53ed5533cb4f4b6d1af901665719"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (68 corresponding lines): daft/catalog/__gravitino/_client.py:228-307 | daft/catalog/__gravitino/_client.py:310-377 \u2014 These two members are one piece of code written twice and then edited apart: 68 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__gravitino/_client.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd82ccec34e76e8c87b6a22cd48a5c6cff8727ed87a1c8c85adf68442e68d33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/daft-core/src/series/utils/python_fn.rs:27-67 | src/daft-core/src/series/utils/python_fn.rs:69-100 \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":"src/daft-core/src/series/utils/python_fn.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ee0edd30b05ca2ca4ca836fdfa4aacd677ddf9e4292e12b513fb6749d3b06b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/daft-functions/src/numeric/hypot.rs:61-91 | src/daft-functions/src/numeric/trigonometry.rs:211-242 \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":"src/daft-functions/src/numeric/hypot.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"497fa91bdf445ef291506e4b09b7125de585fe0d3a5125af0e902105eefa656e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): src/daft-logical-plan/src/optimization/rules/split_udfs.rs:246-293 | src/daft-logical-plan/src/optimization/rules/split_udfs.rs:306-363 \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":"src/daft-logical-plan/src/optimization/rules/split_udfs.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0fbe6bf8f649f930a6e3d03460f5a0e6f3505dbc26e2ce14919d710116b8826"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): src/daft-sql/src/table_provider/read_csv.rs:21-73 | src/daft-sql/src/table_provider/read_parquet.rs:22-70 \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":"src/daft-sql/src/table_provider/read_csv.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"43959a5f6c358473650db28448adcd8173394886fbe5a82a0e91fdec1d17b693"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): daft/recordbatch/recordbatch_io.py:284-341 | daft/recordbatch/recordbatch_io.py:353-414 \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":"daft/recordbatch/recordbatch_io.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e13fe45c552827563a1d6706275a6927939677526e819b31d599c7f482ca9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/daft-dsl/src/expr/mod.rs:560-590 | src/daft-dsl/src/expr/mod.rs:737-767 \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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"4208d6750e29a19fa4a98a9e7cac015ab2eafe1f28131581b1cda91b72caec31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/daft-distributed/src/pipeline_node/sink.rs:292-325 | src/daft-logical-plan/src/ops/sink.rs:91-124 \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":"src/daft-distributed/src/pipeline_node/sink.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3e7c105340e6c38640e2436706b7cc132008c9b52656c616456fdc69606d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/daft-core/src/kernels/hashing.rs:468-501 | src/daft-core/src/kernels/hashing.rs:515-552 \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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efdc35a06736708df996654f11a39c50273d3a372d9a91d32b4714a6a9f965a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/common/image/src/cow_image.rs:262-296 | src/common/image/src/cow_image.rs:300-334 \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":"src/common/image/src/cow_image.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"304944c52b813f65cb954eb6649c79ad3efe84b7175990ad3616649a321820ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/daft-core/src/array/ops/arithmetic.rs:245-277 | src/daft-core/src/array/ops/arithmetic.rs:285-317 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/arithmetic.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdf8d19e3d4541fc89a5a95cdce16e7fa46ec94e74b35a73effabe0b4429cf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/daft-functions/src/slice.rs:159-189 | src/daft-functions/src/slice.rs:197-223 \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":"src/daft-functions/src/slice.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e93e26dcf2ae7e977967c95b7c3aa393f8601e18379138631e01fbd4fdfc68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (63 corresponding lines): src/daft-core/src/array/struct_array.rs:33-95 | src/daft-core/src/array/union_array.rs:36-102 \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":"src/daft-core/src/array/struct_array.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93f02093a0600ef0424d6a070abb530dd7fd02d15e195bff5bd42a2e85a8a7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/daft-functions-utf8/src/regexp_extract.rs:83-111 | src/daft-functions-utf8/src/regexp_extract_all.rs:92-123 \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":"src/daft-functions-utf8/src/regexp_extract.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3528f9e6b54edee983249296b18e3606833cc2afece3de0fd97a43820ea6d576"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/daft-local-execution/src/join/anti_semi_join.rs:76-122 | src/daft-local-execution/src/join/outer_join.rs:19-55 \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":"src/daft-local-execution/src/join/anti_semi_join.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"4def74b7abfdf13a0f628168329f4b35aa5d6f067749028437bebccf28ef265b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/daft-dsl/src/python_udaf.rs:62-94 | src/daft-dsl/src/python_udaf.rs:96-127 \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":"src/daft-dsl/src/python_udaf.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da15355fcd3fe6a91ac3c765605bb84d9cf877f01510084301e44e3b235df1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): src/common/io-config/src/python.rs:1798-1826 | src/common/io-config/src/python.rs:2007-2030 | src/common/io-config/src/python.rs:2291-2315 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/python.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5630341fc32af1328899075dd444c399f17f07fa892083a8dbb454a4c5bb58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/common/io-config/src/cos.rs:155-188 | src/common/io-config/src/tos.rs:156-189 \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":"src/common/io-config/src/cos.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01e36b16ce8137dd0eaa37166870e55bd4c05f3f69115b951f76bb4df98a812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): src/daft-functions-temporal/src/time.rs:202-235 | src/daft-functions-temporal/src/time.rs:276-316 \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":"src/daft-functions-temporal/src/time.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"842492ca9f33c1bc2380cb0860edc370bfab39b1300b535baf8a1d0726236c25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): src/daft-dsl/src/python.rs:210-252 | src/daft-dsl/src/python.rs:274-317 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1e38bd0264dd2de05585880608aa81eda6dce45f63e0c0d004c74007f6e9de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/daft-ext-macros/src/types.rs:295-326 | src/daft-ext-macros/src/types.rs:328-368 \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":"src/daft-ext-macros/src/types.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f6554afe40c60281f2fd1e72dab64555851d888ed87ed519d7269789be7ec1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/daft-functions-list/src/kernels.rs:404-427 | src/daft-functions-list/src/kernels.rs:781-803 \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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cd152d9693f37a6fe270564e307e2356340f4aba6a34158fa96532bf2558095"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/daft-ext-macros/src/types.rs:146-180 | src/daft-ext-macros/src/types.rs:182-217 \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":"src/daft-ext-macros/src/types.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"65651ff2dd1bc0dc7296179140c188f028e99153031988e12f9e9ce73656e546"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/daft-functions-temporal/src/date_arithmetic.rs:217-241 | src/daft-functions-temporal/src/date_arithmetic.rs:346-385 \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":"src/daft-functions-temporal/src/date_arithmetic.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b4b1a7a8c0bbe6f8c3bdf4d4315d2fa03af1d77489fc0dc6d140d6d190cc8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): src/daft-distributed/src/pipeline_node/shuffles/gather.rs:113-149 | src/daft-distributed/src/pipeline_node/shuffles/repartition.rs:111-152 \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":"src/daft-distributed/src/pipeline_node/shuffles/gather.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a31b77a3237e4979f63ccb0b1b6eba41a02359f579aac8c14929363a0d9cf4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): daft/dataframe/dataframe.py:6212-6252 | daft/dataframe/dataframe.py:6309-6351 \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":"daft/dataframe/dataframe.py"},"region":{"startLine":6212}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f0004704d0632850351008e43733786d99ae54d001fff80c9c0cacb6315629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): src/daft-io/src/http.rs:164-208 | src/daft-io/src/http.rs:215-264 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/http.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"307c20916454ba088e487edbc07aa418e668256273cbb28322ef543639163c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): src/daft-dsl/src/python_udf/retry.rs:83-118 | src/daft-dsl/src/python_udf/retry.rs:128-171 \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":"src/daft-dsl/src/python_udf/retry.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d46ffd15d6b24abd7e3be646c9921f81c8cf605548f0b71d0d7f50a265bf23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/daft-functions-binary/src/decode.rs:57-79 | src/daft-functions-binary/src/decode.rs:112-134 \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":"src/daft-functions-binary/src/decode.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b388b9ea383d86c00a8a4af2320497deeb2d4756b94b72226822396309b9286b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/daft-functions-utf8/src/find.rs:66-92 | src/daft-functions-utf8/src/translate.rs:80-110 \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":"src/daft-functions-utf8/src/find.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc86b3fb413f5758277f6648ff0e38e442da152cce52a226f904e8071f168ade"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/daft-writers/src/batch_file_writer.rs:103-131 | src/daft-writers/src/parquet_writer.rs:414-456 \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":"src/daft-writers/src/batch_file_writer.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e35259e7df99816fb3ac29bc3d4b0166e07704b0300c91211e37058610dc7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): src/daft-writers/src/csv_writer.rs:127-166 | src/daft-writers/src/json_writer.rs:94-132 \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":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9603b194d65e0b5a36c2641eb4a746096a2eba1b3a40bfc6a7b0368b8a66f400"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/daft-functions-utf8/src/split_part.rs:37-58 | src/daft-functions-utf8/src/substring_index.rs:35-56 \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":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a77b805770c466e2cd02279b761c2cc35e004446784ffa3e9b51108378f1acf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/daft-sql/src/modules/window.rs:71-104 | src/daft-sql/src/modules/window.rs:120-151 \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":"src/daft-sql/src/modules/window.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b939ec80c733386f36e16d1c26b9c2922334461cc627470ff6fdeb921006e89b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:268-293 | src/daft-recordbatch/src/ops/inline_agg.rs:331-356 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f6ec94d31f4f40161af9eecb681e77f0bfdc0f140ea8dc31db6b2c7062e25c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/daft-sql/src/modules/temporal.rs:83-140 | src/daft-sql/src/modules/temporal.rs:159-196 \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":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"e25a3cb075b636afe5210f985f82fcf822140f18bc3513796cac68cca6909b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/common/io-config/src/gcs.rs:47-84 | src/common/io-config/src/huggingface.rs:35-66 \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":"src/common/io-config/src/gcs.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce1da1bf438e5ac82858bcb8cdbb16e18bdba180e2b03ff2b042d688b9fc74e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/daft-functions-temporal/src/date_navigation.rs:36-64 | src/daft-functions-temporal/src/date_navigation.rs:118-146 \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":"src/daft-functions-temporal/src/date_navigation.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"94504181bacb661efd1860a2cf8f31cee288e26121efdcffa39b4383ef511a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-algebra/src/simplify/numeric.rs:48-67 | src/daft-algebra/src/simplify/numeric.rs:69-85 \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":"src/daft-algebra/src/simplify/numeric.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf55d21ae647fd9572f58b9c29c5d82a66037d547436c58c485d226956fb768"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/daft-core/src/array/struct_array.rs:135-159 | src/daft-core/src/array/union_array.rs:155-179 \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":"src/daft-core/src/array/struct_array.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e284f9a01d88a5d59ba0a8b5305d6a411aa7359abcc4d12c192710342b7fbe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/daft-recordbatch/src/lib.rs:1810-1834 | src/daft-stats/src/table_stats.rs:183-208 \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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1810}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8d1fec498c02217278691c0ca6a714084698a618b2e32e5b8e98b851678604"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/daft-functions-utf8/src/regexp_extract.rs:29-51 | src/daft-functions-utf8/src/regexp_extract_all.rs:31-53 \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":"src/daft-functions-utf8/src/regexp_extract.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56c778b1f1c4324218fc0b605ee28fa94deeed710c62e9295bf81f12f2587c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/daft-parquet/src/python.rs:200-231 | src/daft-parquet/src/python.rs:256-290 \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":"src/daft-parquet/src/python.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df64f6d163ad73aa7f6c55419ad97622e38addacb1eb19c17727840c672b463"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): src/common/io-config/src/python.rs:1736-1763 | src/common/io-config/src/python.rs:1954-1976 | src/common/io-config/src/python.rs:2229-2254 \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":"src/common/io-config/src/python.rs"},"region":{"startLine":1736}}}],"partialFingerprints":{"codehealthFindingId/v1":"23485f8ca017c5b4b0686448ddf57e8577eeea953222dbfefdf0e6464530282a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/daft-core/src/array/fixed_size_list_array.rs:79-101 | src/daft-core/src/array/list_array.rs:90-112 \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":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"18abc2d9826cb6b4a8de2aea0d5a703cc975b7904781c58705bcfba4e003d697"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/daft-io/src/gravitino.rs:168-206 | src/daft-io/src/unity.rs:129-153 \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":"src/daft-io/src/gravitino.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff6b20e7bac52cef49c706981eb08f20434d8610ed636317e2bcb678bf1d9089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/daft-sql/src/modules/temporal.rs:931-957 | src/daft-sql/src/modules/temporal.rs:976-999 \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":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe5e1ec472b6a3cbf572d3af38ab99c47781b0a6d5f5415a97f77038f663af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 37\u002B corresponding lines): src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:49-85 | src/daft-distributed/src/pipeline_node/join/stats.rs:30-67 | src/daft-local-execution/src/join/stats.rs:52-89 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 37 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/join/broadcast_join.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7a9cd6add012f06f5aec3110cdcebaf7742d544ad0293e4db1fdcb6eee6978"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:289-318 | src/daft-distributed/src/pipeline_node/join/hash_join.rs:102-121 \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":"src/daft-distributed/src/pipeline_node/join/broadcast_join.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"50262f5e7fb5ed7a5ea966b877eb487934c5e842fcbe84f176b70e7f9e55f543"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/daft-distributed/src/scheduling/scheduler/default.rs:121-143 | src/daft-distributed/src/scheduling/scheduler/linear.rs:99-138 \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":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"324bcde386088f4c6a3256d8d16389982f86a31c08d4c9923fcfbcd67a1cff2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): src/daft-distributed/src/scheduling/task.rs:412-448 | src/daft-distributed/src/scheduling/task.rs:461-493 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/task.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"381525c50e4e0382b91ff33556b35b574845e119d5359ac97ed19c33cd9049c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/common/io-config/src/python.rs:2033-2060 | src/common/io-config/src/python.rs:2318-2340 \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":"src/common/io-config/src/python.rs"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfed5aeac577f1ded5051e3e4f3b90ebe3537ae9c583568fbdfdf2ffa760cfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): daft/udf/execution.py:79-99 | daft/udf/execution.py:108-128 \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":"daft/udf/execution.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e48fa3f4a0f271b9458c44310630b1f0346bdb81a579bd0f20791f1d503dff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): src/daft-sql/src/modules/temporal.rs:815-843 | src/daft-sql/src/modules/temporal.rs:1018-1044 \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":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb9a2518491d82c0a91c036f28823dd325de91a0e0bc0b8da57dcbaa32ab5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:533-563 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:569-591 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:635-657 \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":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"a684c1bb2a3c34ca2f23df379df63290885168953e56cabd7e884165d2e19ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-functions-binary/src/encode.rs:54-73 | src/daft-functions-binary/src/encode.rs:108-127 \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":"src/daft-functions-binary/src/encode.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f371c2c8b1b5d7441a13959e67a1b461beb8628193ff4d0030c6a67ad081aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/daft-io/src/google_cloud.rs:270-299 | src/daft-io/src/google_cloud.rs:301-337 \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":"src/daft-io/src/google_cloud.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"58159ade0bb205744fc58c2ed4b304ce1f3b476d6fde039209043285099419fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): src/daft-io/src/s3_like.rs:1088-1122 | src/daft-io/src/s3_like.rs:1527-1563 \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":"src/daft-io/src/s3_like.rs"},"region":{"startLine":1088}}}],"partialFingerprints":{"codehealthFindingId/v1":"54d754451dbdab2c62d5c45e7970be85521c0c3d7344d401b506582e6e9a8be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/daft-micropartition/src/python.rs:339-359 | src/daft-recordbatch/src/python.rs:118-138 \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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf0f0f4f12fccc88cd28011752d4c566196aef424e2db1f884159928224f57f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-core/src/array/ops/comparison.rs:388-406 | src/daft-core/src/array/ops/comparison.rs:496-511 \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":"src/daft-core/src/array/ops/comparison.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e00ad34d3e1974d24e98106c614bdfbddadd35b8c910620f650fdab0d0ec98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/common/io-config/src/gravitino.rs:18-39 | src/daft-scan/src/pushdowns.rs:124-145 \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":"src/common/io-config/src/gravitino.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5510c6d00144dd48e36c02b14615dcbbdf448125a6536dbc4e83cb7c43b51ff9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/daft-dsl/src/functions/partitioning/evaluators.rs:71-99 | src/daft-dsl/src/functions/partitioning/evaluators.rs:124-146 \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":"src/daft-dsl/src/functions/partitioning/evaluators.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a27c175ea731d082a119b611fcb61c376cd1ce3266296f54bd0e824d849ca85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/daft-micropartition/src/python.rs:790-821 | src/daft-micropartition/src/python.rs:851-882 \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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5bb8b68f1080264ddf606ba8a4794b2676ac4f486ad044d7bff5b36bab85d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/daft-dsl/src/python_udf/batch.rs:96-122 | src/daft-dsl/src/python_udf/row_wise.rs:92-117 \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":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f165e88b071b882a901caa1c81c9cb21f8bf42a35085658020483b2412f97ed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): src/daft-local-execution/src/sinks/window_order_by_only.rs:181-207 | src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:251-297 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:265-299 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/window_order_by_only.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ca186eac31e0036a1fb71a6b4e40e6319f95a5e0ec7351e30f98e53f83f6e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/daft-csv/src/metadata.rs:78-105 | src/daft-json/src/schema.rs:79-107 \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":"src/daft-csv/src/metadata.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89cc576dd92bdb581037536af2bb599f89e7ff8d04560099976c56bd7e1cfde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/daft-functions-list/src/kernels.rs:1216-1239 | src/daft-functions-list/src/kernels.rs:1246-1273 \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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4b656459880f172e2c3612e92cd470c0b658b52bc19886a75bec0e88adf9b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): src/daft-logical-plan/src/ops/sort.rs:31-61 | src/daft-logical-plan/src/ops/top_n.rs:52-85 \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":"src/daft-logical-plan/src/ops/sort.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b8455f4dbc6ce7e172e2438fff78e0b50a78d2f163e96817c9ad8988b7b1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): daft/catalog/__gravitino/_client.py:170-193 | daft/catalog/__gravitino/_client.py:196-225 \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":"daft/catalog/__gravitino/_client.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"73218d26829279c9a68541d722ec4982536eb4a1c0b9218fb757986aa1486d0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-micropartition/src/micropartition.rs:214-232 | src/daft-recordbatch/src/lib.rs:1931-1948 \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":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"2230c851b5a4c2492ba892be78e3b79680bdad4f6001fad5715216afa768cead"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/daft-context/src/subscribers/dashboard.rs:481-503 | src/daft-context/src/subscribers/dashboard.rs:505-525 \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":"src/daft-context/src/subscribers/dashboard.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a02f83dc359c2655b01687f29c5a4f1a9141278305ae4bdc82ac199e885404"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/common/io-config/src/cos.rs:125-149 | src/common/io-config/src/tos.rs:123-150 \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":"src/common/io-config/src/cos.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e6ead82f29086cc0c904e80f1ac561373ab2688dc04c9d7f3fc2d37b35789c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): src/daft-functions-uri/src/download.rs:59-96 | src/daft-functions-uri/src/upload.rs:51-89 \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":"src/daft-functions-uri/src/download.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1704f755baaa52ed019f4a2e6edf6558d56fe7e63fba91e0a8c1347353b95bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/daft-dashboard/src/engine.rs:329-349 | src/daft-dashboard/src/engine.rs:363-383 \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":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3ccf53b577669d97223ce881dca554e835ce497b65707cc7a52b8b148160a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/daft-ext-internal/src/aggregate.rs:261-283 | src/daft-ext-internal/src/aggregate.rs:285-310 \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":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf7265ab762d7444eb8b7143fd5c5b619983b4008d4b9f6e7524f090e4de81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/daft-functions-utf8/src/chr.rs:31-52 | src/daft-functions-utf8/src/space.rs:30-51 \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":"src/daft-functions-utf8/src/chr.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"39da204fd13e80207e1d176e6a97dd8cda10122c12ebeeda09c15bc0daa2fae1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-groupby/src/arrays.rs:43-70 | src/daft-groupby/src/arrays.rs:93-112 \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":"src/daft-groupby/src/arrays.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0e49e32a37afe5e02dbbf9e9dcff63e3b90a67f1dc31c1046d47ee0a13eff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-core/src/datatypes/agg_ops.rs:6-21 | src/daft-core/src/datatypes/agg_ops.rs:24-39 \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":"src/daft-core/src/datatypes/agg_ops.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4ad9ca44cfba753d9af4c5c9f95a72257bf3012cdadf99af229a213fb07596"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): src/daft-functions-utf8/src/replace.rs:91-107 | src/daft-functions-utf8/src/split_part.rs:64-79 | src/daft-functions-utf8/src/substring_index.rs:62-77 | src/daft-functions-utf8/src/translate.rs:49-64 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/replace.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec7d4e049892dff55467f2da7bd180c943e3ec068773a07b502a7902768ca61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-functions/src/numeric/hypot.rs:40-54 | src/daft-functions/src/numeric/trigonometry.rs:163-178 \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":"src/daft-functions/src/numeric/hypot.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c4cbf45b4493fc43a6fe6380ee559a603a909636660f62d7874c46299db5550"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-checkpoint/src/config.rs:41-55 | src/daft-checkpoint/src/config.rs:58-72 \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":"src/daft-checkpoint/src/config.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48a0f67459a9f63ac6ba001dd13a7d3ea2240fc38052a8112a11ec9138c9e7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): daft/catalog/__gravitino/_catalog.py:102-121 | daft/catalog/__unity/_catalog.py:91-112 \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":"daft/catalog/__gravitino/_catalog.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"6635517c9126a92ba7fe3102e6077a8460631b36d6b89e57139baf3b93a8e053"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-file/src/functions.rs:506-526 | src/daft-file/src/functions.rs:550-566 \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":"src/daft-file/src/functions.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"2073eb416db04d06bbe304131892f1310f0c3e1727039280d3d43d68a37ea8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/daft-local-execution/src/join/probe.rs:66-87 | src/daft-local-execution/src/streaming_sink/base.rs:156-178 \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":"src/daft-local-execution/src/join/probe.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6c22d11206cd241b1aebc6dd035a672d0e14b5751184a8712d1a990511d4a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): src/daft-distributed/src/pipeline_node/window.rs:105-124 | src/daft-distributed/src/pipeline_node/window.rs:156-181 | src/daft-distributed/src/pipeline_node/window.rs:207-226 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-distributed/src/pipeline_node/window.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb4d2177019c29753576be4b8d2776507caf0edf098d03e1ff4baff874edf6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-core/src/array/ops/full.rs:175-197 | src/daft-core/src/array/ops/full.rs:199-214 \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":"src/daft-core/src/array/ops/full.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25184bdc4437fb3aca510816c1f6926049aef775bb978866e7add3b9e178d15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 28\u002B corresponding lines): src/daft-distributed/src/pipeline_node/udf.rs:177-210 | src/daft-local-execution/src/intermediate_ops/udf.rs:494-535 | src/daft-local-execution/src/streaming_sink/async_udf.rs:336-363 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/udf.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb30279b9e44dffdbbf8dace0d4603e08debe0f0f0168e50f1b91a51420aee2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): src/daft-core/src/array/serdes.rs:138-154 | src/daft-core/src/array/serdes.rs:161-181 | src/daft-core/src/array/serdes.rs:188-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 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":"src/daft-core/src/array/serdes.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c99e8be242b2e10d11ebf6e84787ffcf6f5fec5d12abe69d295597da65a4cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-functions/src/numeric/exp.rs:77-88 | src/daft-functions/src/numeric/exp.rs:90-101 \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":"src/daft-functions/src/numeric/exp.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cbc8a0db18ce43e87ddea0b074c8bd0081238b00cc4094855cefbfedb6cc25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): src/daft-core/src/array/fixed_size_list_array.rs:35-66 | src/daft-core/src/array/list_array.rs:38-73 \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":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf2c93dd854173ae933be2d4ee62247c68f9790f740332262e225def49d4757"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-ext/src/aggregate.rs:108-121 | src/daft-ext/src/function.rs:76-90 \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":"src/daft-ext/src/aggregate.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdbcde0775caaaee056c71fb5b22e5cb00f6d3e4a49c3a2c6b020dc6ee0f6f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 27\u002B corresponding lines): src/daft-functions-list/src/append.rs:44-70 | src/daft-functions-list/src/contains.rs:50-77 | src/daft-functions-list/src/join.rs:43-74 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 27 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/append.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec987fab531631602c651f5587a89f5235131908edcdf4d75d5f192bb9e146e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 53\u002B corresponding lines): daft/io/_avro.py:33-85 | daft/io/_csv.py:43-115 | daft/io/_json.py:36-89 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 53 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/_avro.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"315e03bca419451e0aae898ff21a263db0eab20a778dd424278d43db3f963e5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/common/macros/src/function_args.rs:359-381 | src/common/macros/src/function_args.rs:383-405 \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":"src/common/macros/src/function_args.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35855c35737529138cb4f7f506b42c81b6f170431ea21d8d04da28f082b7618"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-catalog/src/python/wrappers.rs:87-104 | src/daft-catalog/src/python/wrappers.rs:157-173 \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":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccee1f66069c25bdb16648c31d439676c0ed6649181e06241bf1721822548e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/daft-ext-internal/src/aggregate.rs:324-353 | src/daft-ext-internal/src/function.rs:231-261 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"d565f75a314f35212b0f29b130ef847bd9a1a19dba586ec18b2aa14598fc4272"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-199 | src/daft-recordbatch/src/ops/inline_agg.rs:436-463 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5097465cfbeecb72644487a32c103b412a6573571e6b9e241e6ee4c0e3ef678"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-200 | src/daft-recordbatch/src/ops/inline_agg.rs:436-467 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc363768d2a0b76e423713b1f017ee7f339662e1ad94ec3d957c58650105c3a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-201 | src/daft-recordbatch/src/ops/inline_agg.rs:436-468 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec14092c7a2796d381e05f3974cabef852574660b3e7d35c3b5dcb82d6bc7f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-202 | src/daft-recordbatch/src/ops/inline_agg.rs:436-469 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ea52e8a9168a27a406986749d3f356b2342e1a32a06aa938594abb14d19dfe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-211 | src/daft-recordbatch/src/ops/inline_agg.rs:436-460 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b3836fc6dda33dc0be59f9eb94203678004794aa438c3aac05237f8f10e466"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-212 | src/daft-recordbatch/src/ops/inline_agg.rs:436-461 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fe5022e1d99fb48b4e286d5f0ea4fcfc7c6b6ade4aa2637d92e0e3c27bbfef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-213 | src/daft-recordbatch/src/ops/inline_agg.rs:436-462 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"594414bc160f760d2b8f21d16662cd80a7cb4ffbc19dc2edebbc3bbd353200c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-215 | src/daft-recordbatch/src/ops/inline_agg.rs:436-464 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f51e78663f9b3d90a493716eb8bcafe8a3ba8de21214798dd4e71a96a8ce99c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-216 | src/daft-recordbatch/src/ops/inline_agg.rs:436-465 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"9526bbb4d8368b25c406ffe9bd50fb205423be7ec5db0f6dcdfd908461d73ce1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-recordbatch/src/ops/inline_agg.rs:176-217 | src/daft-recordbatch/src/ops/inline_agg.rs:436-466 \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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b9cbd395e0dd621a7b6ba04a046ccb75d97c3f198234708f7e51bb93584996"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-schema/src/schema.rs:196-212 | src/daft-schema/src/schema.rs:215-239 \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":"src/daft-schema/src/schema.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6d2d72e81df3dfa480de05fe8930f14a941d2c81c277ad747988423dd8aa32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-parquet/src/statistics/column_range.rs:37-51 | src/daft-parquet/src/statistics/column_range.rs:58-75 \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":"src/daft-parquet/src/statistics/column_range.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"056349605b9320e5930069dff0f4c84a697d7088ef889ff6f285a7edd79ab177"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:98-113 | src/daft-distributed/src/pipeline_node/join/stats.rs:71-90 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/join/broadcast_join.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"912437745144615b0eb1d777f918eb0ab3d33fd6c6b078353b4da3fd7b036ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-distributed/src/pipeline_node/unpivot.rs:80-94 | src/daft-local-execution/src/intermediate_ops/unpivot.rs:73-86 \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":"src/daft-distributed/src/pipeline_node/unpivot.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ab4b605fb0e89fd9320e31f468a4b217a71f06648ae87e427bfd0934ba985d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): src/daft-functions/src/numeric/pmod.rs:97-113 | src/daft-functions/src/numeric/pmod.rs:115-124 | src/daft-functions/src/numeric/pmod.rs:126-137 | src/daft-functions/src/numeric/pmod.rs:139-150 \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":"src/daft-functions/src/numeric/pmod.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fe6994d5d3f781a9ca2d06e2a2005526ed839af76c88d785a73a6e63448eb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/daft-distributed/src/pipeline_node/pivot.rs:102-122 | src/daft-distributed/src/pipeline_node/unpivot.rs:99-117 \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":"src/daft-distributed/src/pipeline_node/pivot.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91b90e439b943e197b3593ae6ebb5dce1f873fe64c6fa8485792c3affc5c6ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/daft-image/src/functions/decode.rs:75-96 | src/daft-image/src/functions/decode_image_file.rs:113-134 \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":"src/daft-image/src/functions/decode.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"482368e90bc499c076bc2fa77d6023571277a87fd16a6f78417c1a1272f736b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-core/src/array/fixed_size_list_array.rs:250-269 | src/daft-core/src/array/list_array.rs:240-257 \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":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad075bbf2b761733433ab0c4a77397883408a5870324ee7b5203cc4b7f4af02c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-core/src/series/ops/arithmetic.rs:398-431 | src/daft-core/src/series/ops/arithmetic.rs:436-452 \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":"src/daft-core/src/series/ops/arithmetic.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c745bdc560f6f966aede682423da3296051de1f50137bceeca868e396af23e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-logical-plan/src/lib.rs:45-61 | src/daft-scan/src/python.rs:1324-1337 \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":"src/daft-logical-plan/src/lib.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a01466a99e3d09c6576385a5cdf6634e313e3f960610830888be6fb71b99c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-logical-plan/src/optimization/rules/drop_into_batches.rs:23-42 | src/daft-logical-plan/src/optimization/rules/drop_repartition.rs:23-42 \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":"src/daft-logical-plan/src/optimization/rules/drop_into_batches.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"254359e2c2b7e703d6a3581e17ea95d8831b8e5f2ce762c7b4f8496355cb3fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): src/daft-logical-plan/src/scan_builder.rs:105-132 | src/daft-logical-plan/src/scan_builder.rs:247-276 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/scan_builder.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a1bef736b10c67b926c2f6bd618a12b7113c2b013ac33225af927c67083f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 18\u002B corresponding lines): src/daft-functions-utf8/src/left.rs:32-49 | src/daft-functions-utf8/src/pad.rs:26-44 | src/daft-functions-utf8/src/repeat.rs:30-48 | src/daft-functions-utf8/src/right.rs:39-56 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/left.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa99d771a33910f16f51e986c9af444ad3b1293c3de1b73dd5f4ce1557a58790"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-local-execution/src/intermediate_ops/udf.rs:77-97 | src/daft-local-execution/src/streaming_sink/async_udf.rs:74-89 \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":"src/daft-local-execution/src/intermediate_ops/udf.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e4fdce32fcc977e660e2d0dcfe7e0abe0466e1b4da923f7e325c39197702ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/daft-core/src/series/ops/agg.rs:448-471 | src/daft-core/src/series/ops/agg.rs:473-497 \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":"src/daft-core/src/series/ops/agg.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00541ab0f3e0f2e90f2fda36e263fcbdef721dda9919a9e9da42fb2b92ced44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/daft-functions-utf8/src/hamming.rs:83-105 | src/daft-functions-utf8/src/utils.rs:326-348 \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":"src/daft-functions-utf8/src/hamming.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3af8188ccbc24fbcca68bb248297d3c686c90880657d37e189c067547d2fb46"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/daft-recordbatch/src/ops/window_states/count_distinct.rs:41-71 | src/daft-recordbatch/src/ops/window_states/count_distinct.rs:73-102 \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":"src/daft-recordbatch/src/ops/window_states/count_distinct.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef53d5398fbff0e46cbb85a3f9dc57054b8c06955a86736d9a02f303f8eef721"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-core/src/series/ops/agg.rs:303-322 | src/daft-core/src/series/ops/agg.rs:324-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":"src/daft-core/src/series/ops/agg.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"38339c00b3343f3d060ba07b3f3569275eabeec444627b180ee9d7a65fe73d8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/daft-local-execution/src/sinks/aggregate.rs:110-127 | src/daft-local-execution/src/sinks/sort.rs:84-101 | src/daft-local-execution/src/sinks/top_n.rs:123-145 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/aggregate.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c58219b8b0b6296ec88dbb228e64a917e36d053b113da0f14cc9f73b1039f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 14\u002B corresponding lines): daft/recordbatch/micropartition.py:315-334 | daft/recordbatch/micropartition.py:344-361 | daft/recordbatch/recordbatch.py:342-355 | daft/recordbatch/recordbatch.py:365-385 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/micropartition.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"657ea4b62cac1d81840d6dccf7b9780020dd6f61befe42e4b3b7cb0bd0b88b70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-distributed/src/pipeline_node/explode.rs:79-92 | src/daft-distributed/src/pipeline_node/filter.rs:79-92 \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":"src/daft-distributed/src/pipeline_node/explode.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6ca2e088df5bf4be4b5b3e0f8f3811ca11ca7c6df7ae830391af5073b30023"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-functions/src/distance/cosine.rs:8-22 | src/daft-functions/src/similarity/cosine.rs:8-27 \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":"src/daft-functions/src/distance/cosine.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f51e5a3b7051bd659ce08e2dbb33978130d4c289e7f83ab2f63630fd8abc73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-functions-list/src/kernels.rs:1048-1067 | src/daft-functions-list/src/kernels.rs:1075-1094 \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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"3762b29ee5e928ba12ecdb17fd1937ed8acfd2f2fc85f14a31d809c3241bb54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/common/runtime/src/lib.rs:190-206 | src/common/runtime/src/lib.rs:208-227 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/runtime/src/lib.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"07b010b278c0982a141db59b13af118ab30a21e4edf37fea81bf23c019daa3be"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/daft-functions-utf8/src/chr.rs:58-71 | src/daft-functions-utf8/src/space.rs:57-70 | src/daft-functions-utf8/src/utils.rs:215-229 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-functions-utf8/src/chr.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c36bb867ff8f02008d7769021b79fe8ca2d89fa69884c8078ace8e19e5d56d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): src/daft-logical-plan/src/ops/agg.rs:98-118 | src/daft-logical-plan/src/ops/explode.rs:105-119 | src/daft-logical-plan/src/ops/pivot.rs:93-111 | src/daft-logical-plan/src/ops/unpivot.rs:119-134 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/agg.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a746d70d987a1e4eb9f521401cea7e79b390cfcceb09f9ec728c781fd2cc9e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:166-199 | src/daft-distributed/src/pipeline_node/join/key_filtering_join.rs:157-182 \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":"src/daft-distributed/src/pipeline_node/join/broadcast_join.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f556a2ef9b502942084b1665fcbe52102fbd1967c7640a9c37824027ae68ade1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-functions/src/numeric/cbrt.rs:20-31 | src/daft-functions/src/numeric/sqrt.rs:23-35 \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":"src/daft-functions/src/numeric/cbrt.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb4ac7122b6bef1a805b5984e10d5fba4f9bdc0263a95a6f5bce2bf35741fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): src/daft-micropartition/src/ops/partition.rs:41-57 | src/daft-micropartition/src/ops/partition.rs:59-76 | src/daft-micropartition/src/ops/partition.rs:83-100 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-micropartition/src/ops/partition.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4efa0ef7b3a21a4fb8cefe2064a676f0cd3e823f9d3a4474ea1f2518486286"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-functions-utf8/src/replace.rs:269-282 | src/daft-functions-utf8/src/replace.rs:288-299 \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":"src/daft-functions-utf8/src/replace.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b73310e5efcb6f0eb95207f0105e90afb6f57b611465d53a664487c95e38127"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/daft-functions-temporal/src/date_arithmetic.rs:175-193 | src/daft-functions-temporal/src/date_arithmetic.rs:247-262 | src/daft-functions-temporal/src/date_arithmetic.rs:391-409 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_arithmetic.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f5b3fd3355011a936a9e4f0b4931be5c5103bdde2a368116291534b958905"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/daft-functions-utf8/src/split.rs:193-211 | src/daft-functions-utf8/src/split.rs:218-236 \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":"src/daft-functions-utf8/src/split.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c488b6bfa092554dbb4fcda2fb1051328d6a475c58ee84d4f822c7cfea48ed3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-parquet/src/reader/chunk_source.rs:202-219 | src/daft-parquet/src/reader/chunk_source.rs:221-240 \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":"src/daft-parquet/src/reader/chunk_source.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c1fa7297b0af6a5f13c4fe87acf3151cf27b0cd4cd82f8373f6f8d0a002de7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 69\u002B corresponding lines): daft/functions/ai/__init__.py:80-154 | daft/functions/ai/__init__.py:164-242 | daft/functions/ai/__init__.py:258-326 | daft/functions/ai/__init__.py:337-421 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 69 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or 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":"daft/functions/ai/__init__.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"442d360566f47e87f1a0573438ad4a8c9a2b8e93be113b1ff2efba3de5c3a8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/daft-image/src/ops.rs:462-474 | src/daft-image/src/ops.rs:478-490 \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":"src/daft-image/src/ops.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9dcbc1dda87b96e72364ba672fba7732923595f592360ea51d97f6d6d116fcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-logical-plan/src/ops/distinct.rs:43-63 | src/daft-logical-plan/src/ops/explode.rs:87-103 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/distinct.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e5c33563e8f67da365755d0279bc3152e591dc8641f10c9b4f93d86c3a4a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-micropartition/src/python.rs:638-649 | src/daft-recordbatch/src/python.rs:396-407 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccf01c5af40df18be689404c706e5674b9217de80420f98a9e8cd9456e4bbd98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 22\u002B corresponding lines): src/daft-avro/src/python.rs:31-55 | src/daft-csv/src/python.rs:63-87 | src/daft-json/src/python.rs:66-90 | src/daft-parquet/src/python.rs:304-325 \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":"src/daft-avro/src/python.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d772524d98a217f7bf1ef28a9b023bc396f5c31e20f303d6f0a561f2e8c121"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-catalog/src/python/wrappers.rs:272-283 | src/daft-catalog/src/python/wrappers.rs:289-300 \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":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa348404cf073c1f2967a77b03345d9a12586e8bce49002d4d9e8ec9a2208986"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-ext-internal/src/module.rs:124-137 | src/daft-ext-internal/src/module.rs:167-180 \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":"src/daft-ext-internal/src/module.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"538ba898230023f2b09bf0e4c3ed466ea393eaf44e65cb25ef9922758ec0613d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 21\u002B corresponding lines): src/daft-micropartition/src/ops/eval_expressions.rs:22-42 | src/daft-micropartition/src/ops/eval_expressions.rs:43-64 | src/daft-micropartition/src/ops/eval_expressions.rs:70-91 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/ops/eval_expressions.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecea60a4886c3f05be30367e1a69703f87b266d73605ba4158b03a9612a799f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/daft-micropartition/src/python.rs:590-610 | src/daft-recordbatch/src/python.rs:348-368 \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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"719e557a6301dd4592f77bbe4442af99573d33129a52422280a5ef3adf93719c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 15\u002B corresponding lines): src/daft-sql/src/modules/temporal.rs:360-374 | src/daft-sql/src/modules/temporal.rs:392-406 | src/daft-sql/src/modules/temporal.rs:424-438 | src/daft-sql/src/modules/temporal.rs:864-878 | src/daft-sql/src/modules/temporal.rs:897-911 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf8e732b52e8f9fac17995adef2b67c7e3ad7be6ac22f172c4e322fc899966c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): daft/io/writer.py:376-394 | daft/io/writer.py:443-458 \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":"daft/io/writer.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84be96de1aaff13de4822802f3f563f05080adcd4cdb851f7fb70cd7e09c827"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/daft-functions/src/numeric/log.rs:38-53 | src/daft-functions/src/numeric/log.rs:107-122 | src/daft-functions/src/numeric/pow.rs:41-56 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/numeric/log.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"14335c5e2695566f1131c1fc052b31d274e653c2577374ccfe10904c0ae5a0ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-logical-plan/src/partitioning.rs:199-210 | src/daft-logical-plan/src/partitioning.rs:370-381 \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":"src/daft-logical-plan/src/partitioning.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"b864b2b1658e2bea0a1c9dec5d07a69f8fd69e9142ad4c3b3229757f1164c811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/daft-recordbatch/src/lib.rs:1623-1634 | src/daft-recordbatch/src/lib.rs:1640-1651 | src/daft-recordbatch/src/lib.rs:1653-1666 \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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1623}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0640a2cacbb4455e6bea8b6d8a661d5adb9582e124210e4f6c122bd0c7479fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/common/metrics/src/snapshot.rs:172-189 | src/common/metrics/src/snapshot.rs:234-251 \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":"src/common/metrics/src/snapshot.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0f7126a0a0455bae9038a81c988f6c29e6d47012cc35dc904017806ea2caee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/daft-distributed/src/pipeline_node/explode.rs:176-194 | src/daft-distributed/src/pipeline_node/project.rs:84-101 | src/daft-distributed/src/pipeline_node/udf.rs:219-240 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/explode.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42b5c7962ddac35400f6db6196b3bcd7a1ba010d8b37dedb32c6dff1afa1773"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/daft-dsl/src/functions/map/get.rs:14-35 | src/daft-dsl/src/functions/map/map_keys.rs:14-34 \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":"src/daft-dsl/src/functions/map/get.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"81143a0683ef68543ab35c0a7b5e0f25bc6b92337585c11e6f8f593e1addd680"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/daft-recordbatch/src/ops/window_states/sum.rs:66-86 | src/daft-recordbatch/src/ops/window_states/sum.rs:88-108 \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":"src/daft-recordbatch/src/ops/window_states/sum.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"633fe32124cc9f7fd782bff8b7a7aaa0c499bd82597f5c9194d9aba39c692e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/daft-core/src/array/ops/full.rs:144-157 | src/daft-core/src/array/ops/full.rs:159-171 \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":"src/daft-core/src/array/ops/full.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d2e1e76573e9eaf4d82bb1b436bdcbf874f31c3992c8484c54fbea551736d73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): src/daft-distributed/src/pipeline_node/into_partitions.rs:44-67 | src/daft-distributed/src/pipeline_node/random_shuffle.rs:49-72 | src/daft-distributed/src/pipeline_node/shuffles/gather.rs:40-61 \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":"src/daft-distributed/src/pipeline_node/into_partitions.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55ece0e8f54733c02352be52e74a26cd85dd342d04bae2659a60e395a986376"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-dsl/src/expr/mod.rs:2503-2513 | src/daft-dsl/src/expr/mod.rs:2516-2526 \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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2503}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a2eb38365b7069c0256138f519e1a4e5087a9d7f00c6f7df78212e33e10101"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-functions-temporal/src/date_arithmetic.rs:66-81 | src/daft-functions-temporal/src/date_arithmetic.rs:118-133 \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":"src/daft-functions-temporal/src/date_arithmetic.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f5369bcd90306b07fb1c63fb4ccd60a5b3b71fc0da45aed86401a96bfbdcd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-json/src/local.rs:39-56 | src/daft-json/src/read.rs:273-292 \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":"src/daft-json/src/local.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b97dd68ddce21560ed0541a84d3d8e8e64206d4459e62c541f3d65f8651a7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): src/daft-logical-plan/src/ops/project.rs:51-71 | src/daft-logical-plan/src/ops/udf.rs:43-64 \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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1a00736b2512931d25f84ab63d9ee6a73e917fb3959df80f921151bebce666"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-micropartition/src/micropartition.rs:198-212 | src/daft-recordbatch/src/lib.rs:1918-1929 \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":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"567bc44a3345f8eb7bd38df73b5dc7258340e382e992e4c3d39400e7edd4f04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): daft/session.py:352-373 | daft/session.py:381-402 \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":"daft/session.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe2df432715ea3e80bd05ed6e525111f08029f07ad6a9e604c9584fd60bb303"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): src/daft-functions-temporal/src/truncate.rs:42-62 | src/daft-functions-utf8/src/substr.rs:80-98 \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":"src/daft-functions-temporal/src/truncate.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd1c2e87ae2ed2dbeac9460b576f9b48b9ce0b83f88d8d46addf2ecfe416c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/daft-core/src/array/ops/sort.rs:118-139 | src/daft-core/src/array/ops/sort.rs:147-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":"src/daft-core/src/array/ops/sort.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fceab5b2fdeabec48d24cbbf148d8b3e8a2705720ad21bf9a78a53e409c201"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-local-execution/src/intermediate_ops/filter.rs:60-75 | src/daft-local-execution/src/sinks/write.rs:83-98 \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":"src/daft-local-execution/src/intermediate_ops/filter.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b69deeac0263c62a373908a5db38b722993b0994cc2cf02532b01dff07c102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 24\u002B corresponding lines): benchmarking/vllm/continuous-batch-sorted.py:14-52 | benchmarking/vllm/naive-batch-sorted.py:37-61 | benchmarking/vllm/naive-batch.py:37-60 | benchmarking/vllm/prefix-bucketing.py:14-49 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/vllm/continuous-batch-sorted.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c27083a99bc5ad1a4a17beabe17047b2d847888cbf5765663ef48e282f1d89bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): daft/dataframe/dataframe.py:99-122 | daft/dataframe/dataframe.py:857-887 \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":"daft/dataframe/dataframe.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01076b5868e063e338575c725a34652d64a780c1fc29f2748f57b28c90aa3e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-functions-uri/src/upload.rs:333-349 | src/daft-functions-uri/src/upload.rs:355-370 \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":"src/daft-functions-uri/src/upload.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ab597d62086edcdedb8bfdf766f828d9b98bcc7fb55a89396f89ef7cd7bc7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-io/src/lib.rs:463-486 | src/daft-io/src/lib.rs:494-513 \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":"src/daft-io/src/lib.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5927b4e4061bbeca7be4435932df71ae7ef7b3cb098fcfb1997087e725360a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-recordbatch/src/ops/window_states/first_last_value.rs:49-63 | src/daft-recordbatch/src/ops/window_states/first_last_value.rs:118-132 \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":"src/daft-recordbatch/src/ops/window_states/first_last_value.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c774aaa9a17cf181ffd6ade58e9246f654a38b6a5a5d32cc978afbcc510277"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-image/src/series.rs:186-200 | src/daft-image/src/series.rs:234-248 \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":"src/daft-image/src/series.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"01aa7873a072c7dfdbeb72dbdc20751082f5ea3c01d831b387e813b12c44c6e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/daft-io/src/huggingface/mod.rs:422-434 | src/daft-io/src/huggingface/mod.rs:445-464 \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":"src/daft-io/src/huggingface/mod.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41dc6289e09626d1953cff3a726d912850eaf8e866c53db51f040d1d4415409"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-core/src/array/list_array.rs:150-171 | src/daft-core/src/datatypes/python.rs:174-185 \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":"src/daft-core/src/array/list_array.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"244df4439dda35a0ba6576d690f15b110aada901fbfba6f14f2ca30f47e88d5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/daft-distributed/src/pipeline_node/actor_udf.rs:145-173 | src/daft-distributed/src/pipeline_node/project.rs:34-57 \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":"src/daft-distributed/src/pipeline_node/actor_udf.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"d629c36ffd384a186f10f313e1a1c1d6b1b5e63bebdab6e5f45c9c791a9bed50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-micropartition/src/python.rs:714-730 | src/daft-micropartition/src/python.rs:749-764 \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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"0788bbe120ee9131c0fece1ab7afc14bf8757ff673a482d96984fae9681be5b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/common/metrics/src/meters.rs:34-51 | src/common/metrics/src/meters.rs:75-92 \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":"src/common/metrics/src/meters.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8349b0e7fac541834d1772ad0394893c4058dc1c6fe259b5e114f4eadbd1136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-context/src/lib.rs:265-285 | src/daft-context/src/lib.rs:290-307 \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":"src/daft-context/src/lib.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b672577b405ae63bfc06187d8136f00b62f85c966ecc2470bb7a38241a914c37"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-core/src/python/series.rs:282-299 | src/daft-recordbatch/src/python.rs:449-469 \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":"src/daft-core/src/python/series.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad9695e64ae2acecd1afa305618fd6a996201e6ecdb3ec8cdca3b2fff16ed65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:62-86 | src/daft-distributed/src/pipeline_node/limit.rs:102-123 \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":"src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"758eefc9000762fe952144b93ec4b045b79d15c4987128945ce63c2ad0519bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-dsl/src/treenode.rs:10-24 | src/daft-local-plan/src/plan.rs:1956-1970 \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":"src/daft-dsl/src/treenode.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2c2526b69194c23b1478694657d689baa063831a41ed25a773cb74e0b24a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-local-execution/src/checkpoint_terminus.rs:76-93 | src/daft-local-execution/src/concat.rs:114-131 \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":"src/daft-local-execution/src/checkpoint_terminus.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"8736878bd42ad57df38ac24d4da6d91d91c962717d0d52dfe114dd3dd3d0a271"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-logical-plan/src/builder/mod.rs:399-416 | src/daft-logical-plan/src/builder/mod.rs:423-440 \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":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"063676178db022b1bf235425ad1071428b5bccfac9de1b126ea1f79b2efe18ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): daft/dataframe/dataframe.py:620-669 | daft/dataframe/dataframe.py:675-741 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a025ba97ca0cf40632b3c0d239df19648a8d095eae90bde2c17942a8e21790d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/daft-distributed/src/pipeline_node/window.rs:90-103 | src/daft-distributed/src/pipeline_node/window.rs:139-154 | src/daft-distributed/src/pipeline_node/window.rs:193-205 \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":"src/daft-distributed/src/pipeline_node/window.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc96ff875628e680596b6120c095d9b4b67dd05852706844a22fc25641a4ac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/daft-ext-internal/src/aggregate.rs:59-71 | src/daft-ext-internal/src/function.rs:74-89 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ed00a644d04dbaa8f694be5073548ae1ec10cf0cafc2518782b6d5b02f684d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-logical-plan/src/ops/set_operations.rs:68-96 | src/daft-recordbatch/src/lib.rs:85-102 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8c23c6c8d7b6c9f3fa5d127d96135e5587d835f42afc5fd60cef88c176edc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-cli/src/dashboard.rs:272-285 | src/daft-cli/src/dashboard.rs:289-302 \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":"src/daft-cli/src/dashboard.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c19f05f954b5f10e71d71c0d7ae1b0e80e3a02f4980e42c9e52c65e17d6f45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-functions-utf8/src/chr.rs:87-108 | src/daft-functions-utf8/src/space.rs:86-103 \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":"src/daft-functions-utf8/src/chr.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"993a450d84a9d60f5ac3b5417726540e97096ef6bd0e80b609b27c5287579484"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/daft-sql/src/modules/temporal.rs:458-471 | src/daft-sql/src/modules/temporal.rs:489-499 | src/daft-sql/src/modules/temporal.rs:517-527 | src/daft-sql/src/modules/temporal.rs:545-555 \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":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f1b9ef387d665930d14dbdfbb64f652ec5410ded9e74850cb74e7407673c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-core/src/array/growable/fixed_size_list_growable.rs:79-90 | src/daft-core/src/array/growable/struct_growable.rs:85-100 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/growable/fixed_size_list_growable.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5605f4a3e6246de2dc6e2fb2e6ee6303e7dd6e23362088bfbd2f6580decc91bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 23\u002B corresponding lines): src/daft-distributed/src/pipeline_node/concat.rs:31-56 | src/daft-distributed/src/pipeline_node/into_batches.rs:97-119 | src/daft-distributed/src/pipeline_node/join/asof_join.rs:78-105 | src/daft-distributed/src/pipeline_node/join/cross_join.rs:41-63 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/concat.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cc17582201bd8bcd4e751718fed634b4cf2152e93749e6d42038807d0a0871"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/daft-functions-temporal/src/time.rs:103-126 | src/daft-functions-temporal/src/time.rs:158-172 | src/daft-functions-temporal/src/time.rs:241-252 | src/daft-functions-temporal/src/time.rs:322-333 \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":"src/daft-functions-temporal/src/time.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"35223493fe5fc32774ef72acc39934925994823a3d439e838b5ab998832ca342"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-local-execution/src/sinks/grouped_aggregate.rs:432-451 | src/daft-local-execution/src/sinks/window_partition_only.rs:177-196 \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":"src/daft-local-execution/src/sinks/grouped_aggregate.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbfa056f641dce4348c9b55ae9c09cd9796b41f281346538a9a3627ae8c80c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/daft-local-execution/src/sources/glob_scan.rs:210-230 | src/daft-local-execution/src/sources/in_memory.rs:132-147 | src/daft-local-execution/src/sources/scan_task.rs:233-252 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sources/glob_scan.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce122fa5aff0195ad694d1a695eb1e65aae10423621c6ec03b5faeceb357cca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-recordbatch/src/ops/window_states/count.rs:30-45 | src/daft-recordbatch/src/ops/window_states/count.rs:47-62 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/window_states/count.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f68a19b0b0e552db27c9712e79b16c7be574ccf106769ff4becfc1614752bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): daft/catalog/__paimon.py:178-188 | daft/catalog/__paimon.py:192-207 \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":"daft/catalog/__paimon.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2241e3400353dcb929edcbc5919884ec4a26c1321b926357bcc33eeecc7c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): daft/runners/native_runner.py:54-66 | daft/runners/ray_runner.py:136-148 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/runners/native_runner.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e887a96ef62292df764f22850a1cdb48b9f8a57c1bce6a3b4dec04bb28d9462"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-distributed/src/pipeline_node/distinct.rs:86-100 | src/daft-distributed/src/pipeline_node/top_n.rs:110-127 \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":"src/daft-distributed/src/pipeline_node/distinct.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f05abeab4543629d752f6af328a2328b341a0999ad039455d31d1f7c70853a0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-distributed/src/python/mod.rs:127-142 | src/daft-distributed/src/python/mod.rs:173-198 \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":"src/daft-distributed/src/python/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"6938d73159167f4ea4cd644da0a5e4ab29a2381406381153709f7897863b24ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/daft-ext/src/aggregate.rs:63-75 | src/daft-ext/src/aggregate.rs:84-97 | src/daft-ext/src/function.rs:52-64 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-ext/src/aggregate.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8017c4354158fff34df3b4536cd489f28543ec06376136e4a00d4911bc511157"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-schema/src/schema.rs:129-145 | src/daft-schema/src/schema.rs:153-169 \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":"src/daft-schema/src/schema.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"53595578dbf70ee072cac6c1d353056e465eace1b436a1d8054f21eac135d878"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-algebra/src/boolean.rs:11-27 | src/daft-algebra/src/boolean.rs:29-45 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-algebra/src/boolean.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"023763f99add0cf86c3fde1bb61d348449cae7114c99c82be37897f90743a2df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-catalog/src/python/wrappers.rs:236-247 | src/daft-catalog/src/python/wrappers.rs:249-266 \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":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"efadecf6143d3e4a107eebd4e8bdb7a5b546485de6b275f5fb132f439d13b714"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): src/daft-distributed/src/pipeline_node/filter.rs:115-135 | src/daft-distributed/src/pipeline_node/monotonically_increasing_id.rs:33-53 | src/daft-distributed/src/pipeline_node/shuffles/pre_shuffle_merge.rs:38-59 | src/daft-distributed/src/pipeline_node/stage_checkpoint_keys.rs:40-60 \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":"src/daft-distributed/src/pipeline_node/filter.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd92cacd46145a25017e1bf1ef409081913e081ea9b489a6e15a2930ad51c217"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/daft-distributed/src/pipeline_node/sink.rs:100-111 | src/daft-distributed/src/pipeline_node/stage_checkpoint_keys.rs:112-122 | src/daft-distributed/src/statistics/stats.rs:302-311 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-distributed/src/pipeline_node/sink.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d577b5fc5e5f7c9b1b5770f439b2fa5ba4ddf9819ead68a139192a7d5e5f4797"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/daft-functions-utf8/src/lpad.rs:26-33 | src/daft-functions-utf8/src/rpad.rs:26-33 \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":"src/daft-functions-utf8/src/lpad.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d034b9b000bc96f814f7622fd6c956042dac7f1f42629ad9f8c3a9bed8c87a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-core/src/array/fixed_size_list_array.rs:141-155 | src/daft-core/src/array/struct_array.rs:190-206 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4be8d200bb71d388e33bbff750b4cc15a0ce1666b7f6e3cc4a5f6b6e1c3b7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-distributed/src/pipeline_node/in_memory_source.rs:68-79 | src/daft-distributed/src/pipeline_node/scan_source.rs:150-162 \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":"src/daft-distributed/src/pipeline_node/in_memory_source.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6faff7d85779da190f62f5f2babee453b433c192eae72bbc656ca4611dafa25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-ext-macros/src/types.rs:374-385 | src/daft-ext-macros/src/types.rs:391-402 \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":"src/daft-ext-macros/src/types.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"956e223675c98fa409ec8eabcb8bacde2848a38cea8702ecc65f640a2c6754fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-local-execution/src/join/asof_join.rs:222-233 | src/daft-local-execution/src/join/asof_join.rs:241-254 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b9ec02f62fc959d2c82d8f838f00593e3757040140c24d2b3c59d6b3ed8483"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-distributed/src/pipeline_node/filter.rs:162-175 | src/daft-distributed/src/pipeline_node/stage_checkpoint_keys.rs:156-169 \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":"src/daft-distributed/src/pipeline_node/filter.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c90734ad394a4e47cfe24173384e4482511f3cc9080aaddb3e2879bbb55f7b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): daft/io/writer.py:296-312 | daft/io/writer.py:424-440 \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":"daft/io/writer.py"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"81dc30cca5574e4baac19393e9e33e746cfd8c06e0d496e102840377de0eddf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): src/common/metrics/src/snapshot.rs:149-159 | src/common/metrics/src/snapshot.rs:211-221 | src/common/metrics/src/snapshot.rs:353-364 | src/common/metrics/src/snapshot.rs:412-423 | src/common/metrics/src/snapshot.rs:469-479 \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":"src/common/metrics/src/snapshot.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3b5149934392248de20a475425ffaab147bbf1d4245a2265adb494503486dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-local-execution/src/intermediate_ops/udf.rs:61-75 | src/daft-local-execution/src/streaming_sink/async_udf.rs:58-72 \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":"src/daft-local-execution/src/intermediate_ops/udf.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a70671512fea925d197fcb5d96e7430a32ae1e41b9d03e78dc72081c9367a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/daft-logical-plan/src/builder/mod.rs:927-944 | src/daft-logical-plan/src/builder/mod.rs:994-1010 \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":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acd9b2aadd59e2c718f4ecc3afbb04b7f3c7bae691df28e2c163dd40d4bf29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-logical-plan/src/sink_info.rs:84-93 | src/daft-logical-plan/src/sink_info.rs:152-161 \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":"src/daft-logical-plan/src/sink_info.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1e4fa61b351419253af2aa3c56998aee237e055d21f4656732a0c80d1d697e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/daft-parquet/src/statistics/utils.rs:18-28 | src/daft-parquet/src/statistics/utils.rs:31-41 | src/daft-parquet/src/statistics/utils.rs:44-54 \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":"src/daft-parquet/src/statistics/utils.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c54702b6e06066b78b5a4958ed72634db158799b7363d1c4a7a2bba5efdefa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-core/src/array/ops/full.rs:80-93 | src/daft-core/src/array/ops/full.rs:111-129 \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":"src/daft-core/src/array/ops/full.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dffa169417a22d2981cdd0b24a9c09e3a78b9cb6d991bce06af3b593e41b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): src/daft-functions-list/src/series.rs:57-68 | src/daft-functions-list/src/series.rs:70-81 | src/daft-functions-list/src/series.rs:208-223 | src/daft-functions-list/src/series.rs:376-386 \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":"src/daft-functions-list/src/series.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"a624d7ffd7777f0b752b78b53dcda33267b32294b02284f74d087fa9e707cd1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-local-execution/src/run.rs:635-643 | src/daft-local-execution/src/run.rs:649-667 \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":"src/daft-local-execution/src/run.rs"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"acbeaa45ad6504cac5e40156069617b7aa388f51b6c95ab41763840bf53b8c8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): daft/catalog/__unity/_client.py:133-142 | daft/catalog/__unity/_client.py:145-154 \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":"daft/catalog/__unity/_client.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a313c69edb52c0f5f3d836397818020b2bcc9a4ff40e15d61205c6e7c2c5e657"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): daft/subscribers/event_log.py:211-223 | daft/subscribers/event_log.py:298-307 \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":"daft/subscribers/event_log.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bff083c05995f4a0ab2c6570c1754309574af14ba619d0efe2610a502e344a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/daft-core/src/array/fixed_size_list_array.rs:178-194 | src/daft-core/src/array/list_array.rs:189-206 | src/daft-core/src/array/struct_array.rs:236-248 \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":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5c37d702b7727c76289d3be30be7f5646916804158009af4f9382234e9453b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-distributed/src/statistics/mod.rs:260-275 | src/daft-distributed/src/statistics/mod.rs:277-286 \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":"src/daft-distributed/src/statistics/mod.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e3b2204390b62ca63c6978e0db22ef2f72baa2c81777ba4a3ee3d1f8728b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-local-execution/src/intermediate_ops/stage_checkpoint_keys.rs:60-70 | src/daft-local-execution/src/join/stats.rs:91-102 \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":"src/daft-local-execution/src/intermediate_ops/stage_checkpoint_keys.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"07122d096651d6d422e77729f1f9ccd87a50b9d505a97f540c6277e577a0fd48"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/daft-logical-plan/src/optimization/rules/reorder_joins/dp_ccp_join_order.rs:42-53 | src/daft-logical-plan/src/optimization/rules/reorder_joins/dp_ccp_join_order.rs:61-69 | src/daft-logical-plan/src/optimization/rules/reorder_joins/dp_ccp_join_order.rs:81-90 \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":"src/daft-logical-plan/src/optimization/rules/reorder_joins/dp_ccp_join_order.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d9e0957b8fa45226306f8b0fd5e03caad7580b30af7ef3727402a72896b48e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-context/src/subscribers/debug.rs:86-108 | src/daft-context/src/subscribers/debug.rs:110-123 \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":"src/daft-context/src/subscribers/debug.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"848e8134bf6dd58e4af65747660355ab9cb0d2c06a0e9dcf557e5efb74a3e722"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 22\u002B corresponding lines): src/daft-distributed/src/pipeline_node/aggregate.rs:70-93 | src/daft-distributed/src/pipeline_node/explode.rs:119-141 | src/daft-distributed/src/pipeline_node/pivot.rs:43-67 | src/daft-distributed/src/pipeline_node/sink.rs:175-197 | src/daft-distributed/src/pipeline_node/top_n.rs:42-66 | src/daft-distributed/src/pipeline_node/unpivot.rs:41-64 | src/daft-distributed/src/pipeline_node/vllm.rs:35-56 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/aggregate.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"75587495ad835c2cadce3b3c64fcf10afb2181788b749aaad3dbf674200688e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): src/daft-ext/src/abi/arrow.rs:67-79 | src/daft-ext/src/abi/arrow.rs:86-98 | src/daft-ext/src/abi/arrow.rs:105-117 | src/daft-ext/src/abi/arrow.rs:125-138 | src/daft-ext/src/abi/arrow.rs:146-159 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext/src/abi/arrow.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f969f546462940e05ac9c9dd71b037f0999eb4d949027915cf1dba9bf947df6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): src/daft-ext/src/abi/arrow.rs:214-226 | src/daft-ext/src/abi/arrow.rs:233-245 | src/daft-ext/src/abi/arrow.rs:252-264 | src/daft-ext/src/abi/arrow.rs:272-285 | src/daft-ext/src/abi/arrow.rs:293-306 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext/src/abi/arrow.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2b7966c9d90ece9fc3b8fc48ee8e2c321acf62407f4407be23c5dda2a767dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-functions-list/src/bool_and.rs:35-41 | src/daft-functions-list/src/bool_or.rs:33-39 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/bool_and.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e88bd1530dcc81a4b4cb08c6ea4533257ef10c74cafed66901f3a4ca7d2ecfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): daft/catalog/__glue.py:223-241 | daft/catalog/__s3tables.py:268-289 \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":"daft/catalog/__glue.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b5bae2cab60d36c476c0873902a730e1611d4238ee7d76eef1ef3faa568b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-local-execution/src/runtime_stats/progress_bar.rs:250-258 | src/daft-runners/src/runners.rs:198-206 \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":"src/daft-local-execution/src/runtime_stats/progress_bar.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d79411e77c63873de526d01acee25b1e13813f627783022ff30450459db4db9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/daft-sql/src/modules/image/decode.rs:16-29 | src/daft-sql/src/modules/image/encode.rs:16-31 | src/daft-sql/src/modules/image/to_mode.rs:15-26 \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":"src/daft-sql/src/modules/image/decode.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67c8ceea547a7c8a296990f507e6a1160c52d4e0b1530414790eed3c3f9becd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): daft/catalog/__glue.py:119-137 | daft/catalog/__s3tables.py:136-145 \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":"daft/catalog/__glue.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"95178b8c8055865b2763732394598c2f40806a882269f43ad834bbf33e925098"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/common/runtime/src/joinset.rs:68-75 | src/common/runtime/src/joinset.rs:86-93 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/runtime/src/joinset.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"944a7cc1137ee02b898a4f80f23b951a52555676adde36cc42a334839ec7ba83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): src/daft-micropartition/src/python.rs:373-388 | src/daft-micropartition/src/python.rs:405-420 | src/daft-micropartition/src/python.rs:429-444 | src/daft-micropartition/src/python.rs:478-492 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d809c4bf2782f759d22e14e761210400ff16118101d28b90a1c1cc6b6f189b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): src/daft-recordbatch/src/python.rs:147-162 | src/daft-recordbatch/src/python.rs:171-187 | src/daft-recordbatch/src/python.rs:196-210 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/python.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79db6f3a752162684f496d14489b4a6a29bf086472a86f9fff9a96ec501fc15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): daft/io/writer.py:169-180 | daft/io/writer.py:362-373 \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":"daft/io/writer.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"776c04eecba4ac281a628f6c7daf2fe6509eb30dd10e82d6e9ac8d05c366c678"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/daft-context/src/subscribers/debug.rs:166-179 | src/daft-context/src/subscribers/debug.rs:181-194 \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":"src/daft-context/src/subscribers/debug.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca15c820fae6f69d5b13ae7e9ca22d72b02ce1df0c5ebb079d9ffd73295bdac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-core/src/array/ops/compare_agg.rs:261-270 | src/daft-core/src/array/ops/compare_agg.rs:271-280 \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":"src/daft-core/src/array/ops/compare_agg.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ea68e7ab1ddef459954c66494518f63eafe318332bf4d5af6fe6107366bd1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-core/src/utils/stats.rs:18-29 | src/daft-core/src/utils/stats.rs:89-101 \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":"src/daft-core/src/utils/stats.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff208548e699bfd6b004528e8b58ab6af26edcdbe650aa170a39703a5730e847"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): src/daft-csv/src/python.rs:27-47 | src/daft-json/src/python.rs:30-50 | src/daft-parquet/src/python.rs:333-350 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/python.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be6f8ee8f45b1ec4f922ff9311001b94bb3a2b8a24f9f84b03bfc571463c1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): src/daft-dashboard/src/engine.rs:939-954 | src/daft-dashboard/src/engine.rs:968-989 | src/daft-dashboard/src/engine.rs:1033-1052 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"399710bd7512ee0bf6e38c0b178e2b58ff4e1caebe0d982f950f65cf816f2619"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/daft-decoding/src/deserialize.rs:129-147 | src/daft-decoding/src/deserialize.rs:153-165 | src/daft-decoding/src/deserialize.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":"src/daft-decoding/src/deserialize.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"af64bed1b688524cc3cc0419ee277cb6f8bbcfeaf9c5cead3b85021fa0120517"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:323-338 | src/daft-distributed/src/pipeline_node/join/cross_join.rs:154-163 | src/daft-distributed/src/pipeline_node/join/key_filtering_join.rs:352-367 \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":"src/daft-distributed/src/pipeline_node/join/broadcast_join.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c8d855508e97693f9e411d989a115d35933560c49cab95fbe0628101e45cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-local-execution/src/join/asof_join.rs:548-558 | src/daft-local-execution/src/join/asof_join.rs:560-570 \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":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"3906bd77aba49209d444c67f8119451c21941b8c3b6ac16e26c597e6e1d08d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): src/daft-micropartition/src/python.rs:568-583 | src/daft-micropartition/src/python.rs:618-632 | src/daft-recordbatch/src/python.rs:326-341 | src/daft-recordbatch/src/python.rs:376-390 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a037ed59e9090e54b13a9a1f5ddfea931dff6b36eb375e6db318e022bf9830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-distributed/src/scheduling/scheduler/default.rs:48-56 | src/daft-distributed/src/scheduling/scheduler/linear.rs:28-36 \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":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d913114e52f7d94c3c96f5f986a9ef90eb65fb36031a2ac05e761fb8834cc99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/daft-functions-temporal/src/date_arithmetic.rs:53-60 | src/daft-functions-temporal/src/date_arithmetic.rs:105-112 | src/daft-functions-temporal/src/date_arithmetic.rs:157-169 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_arithmetic.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3a3a64ac4159346f2821a460eec6e0622416aa076118841bff9ce9528773a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): benchmarking/ai/image_classification/daft_main.py:50-57 | benchmarking/ai/image_classification/ray_data_main.py:32-38 \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":"benchmarking/ai/image_classification/daft_main.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51c5349bf993369126ca4dc11749dcf60fa549412095ed1bb80cb2556d8e574"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): src/daft-catalog/src/impls/memory.rs:317-329 | src/daft-catalog/src/impls/memory.rs:421-433 | src/daft-catalog/src/table.rs:161-173 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-catalog/src/impls/memory.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"391c181a65acaf11a02b1ea589f56771586e4a718307961bce1dcd9ff05fa102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/daft-context/src/subscribers/debug.rs:125-140 | src/daft-context/src/subscribers/debug.rs:142-156 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-context/src/subscribers/debug.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42f94d69f75ac1a010d15dd884eabe09b9da0b71407956f110f194df53219e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-functions-list/src/list_filter.rs:63-81 | src/daft-functions-utf8/src/regexp_count.rs:43-51 \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":"src/daft-functions-list/src/list_filter.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"976e71857415f31a4dec11078f8e28fa2279f270a9732256413de93b16dc0fef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/daft-functions/src/uuid.rs:208-219 | src/daft-image/src/functions/attribute.rs:38-51 | src/daft-image/src/functions/encode.rs:45-57 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-functions/src/uuid.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"00febb09648b4f4db942f33ab511cff5f82af1d2b2949d4f9429e29018aaf20a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:289-308 | src/daft-local-execution/src/join/join_node.rs:42-55 | src/daft-local-execution/src/sinks/blocking_sink.rs:168-179 | src/daft-local-execution/src/streaming_sink/base.rs:428-441 \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":"src/daft-local-execution/src/intermediate_ops/intermediate_op.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6c5098614e6be12c991daed98657f1e31d83fa59fdff73f0801c8b50616c72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/daft-local-execution/src/sinks/dedup.rs:54-66 | src/daft-local-execution/src/sinks/grouped_aggregate.rs:54-66 \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":"src/daft-local-execution/src/sinks/dedup.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e4709f1db4222a71c3cc888f6dcb1115fea56aae498c458e36c722a6fdadb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 7\u002B corresponding lines): src/daft-session/src/session.rs:616-622 | src/daft-session/src/session.rs:625-631 | src/daft-session/src/session.rs:634-640 | src/daft-session/src/session.rs:642-652 | src/daft-session/src/session.rs:654-663 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-session/src/session.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca363d03939e28f9cf90e92cea3b2df6f44d5d7a90e82e26075930b1fe4ea75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/daft-catalog/src/python/wrappers.rs:49-57 | src/daft-catalog/src/python/wrappers.rs:175-182 \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":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0321492178356155f74e89860998b165920ec937d83d8ae2eb7fd1cc5917a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-distributed/src/pipeline_node/explode.rs:157-167 | src/daft-local-execution/src/intermediate_ops/explode.rs:150-159 \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":"src/daft-distributed/src/pipeline_node/explode.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"917761aba0d42895a9358d9b9986372b7a769ac230f989ebaeb3aeecbbe23738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): src/daft-functions-list/src/max.rs:36-42 | src/daft-functions-list/src/mean.rs:37-45 | src/daft-functions-list/src/min.rs:33-39 | src/daft-functions-list/src/sum.rs:37-44 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/max.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"af856498dc081699a8f955f7e3e11b8600ed3eb45cc49ae6f6d984c6363d3e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-catalog/src/python/wrappers.rs:68-76 | src/daft-catalog/src/python/wrappers.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":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"894312171dd053a473847679b500895d81c82e981e65f460d1ef93b005adc7ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-local-execution/src/streaming_sink/vllm.rs:56-68 | src/daft-local-execution/src/streaming_sink/vllm.rs:70-78 \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":"src/daft-local-execution/src/streaming_sink/vllm.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bdb4f4b8f57d96847598019d91d93303e8de98847879321fb48d70919d72fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-logical-plan/src/ops/shard.rs:44-54 | src/daft-logical-plan/src/ops/unpivot.rs:107-117 \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":"src/daft-logical-plan/src/ops/shard.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24cdfdd3419fee2e894492eb9bebe97b8be1f6116757768bb3b0ad28aaa6767"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-writers/src/file.rs:168-178 | src/daft-writers/src/file.rs:234-245 \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":"src/daft-writers/src/file.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1597f496a85f475b9b67500f1e4e0edf8641d1486d4fc9a94fee5c530b349fb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): daft/execution/vllm.py:178-190 | daft/execution/vllm.py:193-201 \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":"daft/execution/vllm.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cd81653694fdb8f9228ee43a8dc9370586e86cdeb4f80e1fcb4ec1ab1009c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): daft/io/source.py:150-205 | daft/io/source.py:219-231 \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":"daft/io/source.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69a036f2f5b8780f106efbf85239462de0adccbafc8ae1aa71392f80711735a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/common/treenode/src/lib.rs:225-234 | src/common/treenode/src/lib.rs:257-267 \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":"src/common/treenode/src/lib.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c28c2e274fc91152904030453bfe0427585f8628ab724472ebd711a0702ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-core/src/series/ops/arithmetic.rs:86-92 | src/daft-core/src/series/ops/logical.rs:68-74 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/ops/arithmetic.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55c7150332203a446c15732979ae725a0fa26576080ab6f4116c36c83544263"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/daft-file/src/functions.rs:470-481 | src/daft-functions/src/float/is_inf.rs:38-49 | src/daft-functions/src/float/is_nan.rs:40-51 | src/daft-functions/src/float/not_nan.rs:37-48 \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":"src/daft-file/src/functions.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b72539d6785005fa1e39d98a170f4ffd35d7d7690851c733b32be34e6685e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): daft/catalog/__init__.py:330-360 | daft/catalog/__init__.py:368-395 \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":"daft/catalog/__init__.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"199afef7cb7a3f839efa26dc5bef9ca0b95df9e85db433895f1610398a21c651"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): daft/recordbatch/micropartition.py:258-269 | daft/recordbatch/recordbatch.py:299-308 \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":"daft/recordbatch/micropartition.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ddca7549cfe83b43088fbc3dd795663eb8c8ad1fcbc9bfc7b7838b5c9a2224"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/common/metrics/src/snapshot.rs:71-80 | src/common/metrics/src/snapshot.rs:491-501 \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":"src/common/metrics/src/snapshot.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0c99e7e26b576ee021ce88a7f83cd1f99c598a455ac02607b3d44372cbd6924"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/daft-catalog/src/python/wrappers.rs:59-66 | src/daft-catalog/src/python/wrappers.rs:78-85 | src/daft-catalog/src/python/wrappers.rs:148-155 \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":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5c3e761e7a95d65b961f057c193449a8a16098b12a61a7f1de1ed9d50d9816"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-decoding/src/deserialize.rs:227-238 | src/daft-decoding/src/deserialize.rs:244-255 \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":"src/daft-decoding/src/deserialize.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"52421e9b3af829600a69cc006e998737c768be90c28d01a374204a57b8a7c47a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-ext/src/abi/arrow.rs:389-397 | src/daft-ext/src/abi/arrow.rs:457-465 \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":"src/daft-ext/src/abi/arrow.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fdb83785f922b4e39a360ecae6b95f4b47ba98f1c66105ce0c7d170b9017781"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): src/daft-file/src/functions.rs:619-631 | src/daft-functions-list/src/seq.rs:41-56 | src/daft-functions/src/numeric/bin.rs:35-45 | src/daft-functions/src/numeric/conv.rs:46-56 | src/daft-functions/src/numeric/factorial.rs:35-45 \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":"src/daft-file/src/functions.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"1927aaf170dd338901fbe42e539b21dbe772f87352bee8ef630fe0b6d15d76cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/daft-functions-list/src/append.rs:26-38 | src/daft-functions-list/src/contains.rs:28-44 \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":"src/daft-functions-list/src/append.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"b554c4ab5b00b79b0956b0bb15bbb646eb15c2c124812927f68796ad46f997a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/daft-local-execution/src/sinks/window_order_by_only.rs:44-55 | src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:70-86 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:65-77 \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":"src/daft-local-execution/src/sinks/window_order_by_only.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8f13ef28d392a2817871f80d0e3fbe21d5e14db3df4c0e88b3f4d579e62040"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-micropartition/src/python.rs:512-529 | src/daft-recordbatch/src/python.rs:271-288 \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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"5690dda2f622c1a71c1fdc01c7d27ea9ce677a06951fd4ca30cfdc46ca4a6592"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): src/daft-writers/src/csv_writer.rs:56-63 | src/daft-writers/src/csv_writer.rs:72-80 | src/daft-writers/src/json_writer.rs:31-38 | src/daft-writers/src/json_writer.rs:47-55 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd79bccf1577c2654af2fcccc9483a3d55585e1f6d559428f715dc740b0692f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): daft/expressions/expressions.py:411-414 | daft/expressions/expressions.py:417-420 \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":"daft/expressions/expressions.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d0fe27491d7cb66fa20cba6cdb4eeed5e6cb1052be4c3a6b038ad21d04979e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/common/metrics/src/snapshot.rs:50-59 | src/common/metrics/src/snapshot.rs:99-107 \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":"src/common/metrics/src/snapshot.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"672c376ac8ba4fef4481383da17869478986a57e330d46f760b0d0a63057e38e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-core/src/array/ops/full.rs:95-107 | src/daft-core/src/array/ops/full.rs:131-140 \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":"src/daft-core/src/array/ops/full.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0655388e378227ab2d14aab454a8e8b25069e1cdaccee6c396c8565a3bfe5f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/daft-dsl/src/expr/display.rs:29-40 | src/daft-dsl/src/functions/mod.rs:90-100 | src/daft-dsl/src/functions/mod.rs:105-116 \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":"src/daft-dsl/src/expr/display.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"409d9e4037eb1952bd3c13e5e42232890b2482ac31ed36b35b12da759e9a32bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/daft-dsl/src/python_udf/batch.rs:44-64 | src/daft-dsl/src/python_udf/row_wise.rs:42-61 \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":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ff32b6adaf9c5dd731973111c9717b23640290f97975485a53406bffa57ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 10\u002B corresponding lines): src/daft-functions-binary/src/decode.rs:95-106 | src/daft-functions-binary/src/encode.rs:34-48 | src/daft-functions-binary/src/encode.rs:89-102 | src/daft-functions-temporal/src/date_navigation.rs:70-79 | src/daft-functions-temporal/src/date_navigation.rs:152-161 | src/daft-functions-temporal/src/to_string.rs:36-45 | src/daft-functions-temporal/src/unix_timestamp.rs:56-67 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-binary/src/decode.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"48401a6228bdafee349ec6de4467a8d5c9906ff7213ce694daa0739a87d38096"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/daft-local-execution/src/sinks/gather.rs:177-189 | src/daft-local-execution/src/sinks/into_partitions.rs:275-289 \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":"src/daft-local-execution/src/sinks/gather.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e226caa0e075e7838758ccdc768ec1c99c23bd55f580b67ee3cd40c355a097"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-core/src/datatypes/agg_ops.rs:72-82 | src/daft-core/src/datatypes/agg_ops.rs:85-95 \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":"src/daft-core/src/datatypes/agg_ops.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1c16a2dbe06aadc42957fe30eb76e97734e73c9b1f309e9da2463772bf4c62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): src/daft-distributed/src/pipeline_node/explode.rs:36-48 | src/daft-distributed/src/pipeline_node/filter.rs:36-48 | src/daft-distributed/src/pipeline_node/stage_checkpoint_keys.rs:75-91 | src/daft-distributed/src/pipeline_node/udf.rs:41-54 | src/daft-distributed/src/statistics/stats.rs:265-276 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 12 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/explode.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8c59ac61450ab46f1e9fa690fde7db8fe5f1ab471cf30eee299f9e016083c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-ext/src/aggregate.rs:131-139 | src/daft-ext/src/aggregate.rs:149-158 \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":"src/daft-ext/src/aggregate.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff37407b5b60ede73a49b33ce1a069dd51bf2f8b9175acca7370b39ff97d430"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): src/daft-logical-plan/src/ops/concat.rs:28-46 | src/daft-logical-plan/src/ops/filter.rs:31-48 \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":"src/daft-logical-plan/src/ops/concat.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"be193398c64b084037b201f0710810e41e52e72666b307cc9eba36bcf599873b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): src/daft-sql/src/modules/image/encode.rs:39-48 | src/daft-sql/src/modules/image/resize.rs:56-66 | src/daft-sql/src/modules/image/to_mode.rs:34-43 \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":"src/daft-sql/src/modules/image/encode.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ad0159fd3b73ddd606e0141df8a9666cb593c603f973ad3ee580a164392ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-distributed/src/pipeline_node/into_partitions.rs:316-329 | src/daft-distributed/src/pipeline_node/sort.rs:686-696 \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":"src/daft-distributed/src/pipeline_node/into_partitions.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"180b7ad5c81a187f01e6192ed1fe8c7cc2ddd9bef18f3b5b83e4963c698c0509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/daft-ext-internal/src/module.rs:146-156 | src/daft-ext-internal/src/module.rs:189-197 | src/daft-ext-internal/src/module.rs:204-212 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-ext-internal/src/module.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2100ab9a60d8f2de91b550153b532a1a77b8870a2a0ef74cdf887975497dc678"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/daft-local-execution/src/intermediate_ops/explode.rs:136-148 | src/daft-local-execution/src/intermediate_ops/project.rs:156-177 \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":"src/daft-local-execution/src/intermediate_ops/explode.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"35baf55eaf2df6ec7a8c771c36e1eb4ca89090e683ac88bc5146cfad49eb1bef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): daft/catalog/__glue.py:485-496 | daft/catalog/__gravitino/_catalog.py:199-208 | daft/catalog/__iceberg.py:287-295 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__glue.py"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df386b3771d1ece7a3b72a2d1e1aba18a71483fd1c4facb4300cbfac7bdc2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): daft/session.py:320-330 | daft/session.py:333-343 | daft/session.py:453-467 | daft/session.py:470-488 | daft/session.py:622-632 \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":"daft/session.py"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a76c658d3114d54612fddcf3652c9849e6f2c2cec3ab08d596f3967811b942b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-ai/src/python.rs:24-33 | src/daft-catalog/src/python/wrappers.rs:32-43 \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":"src/daft-ai/src/python.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a8e91f094fa88aca81243a798dd86468ae3dfc31268fe967bc3b9179c7c0fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/daft-functions/src/numeric/e.rs:28-33 | src/daft-functions/src/numeric/pi.rs:28-33 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/numeric/e.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f6746468f3b8bc1dc77861bfecb0acfd63513c1ee181e795534d33b775915f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): src/daft-logical-plan/src/builder/mod.rs:442-449 | src/daft-logical-plan/src/builder/mod.rs:489-502 | src/daft-logical-plan/src/builder/mod.rs:540-548 | src/daft-logical-plan/src/builder/mod.rs:554-565 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b5a52f9d513ad0af4d9235fea85c7b09bb7f60a9b5ad6a839eae1f947eef79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): daft/ai/transformers/provider.py:60-70 | daft/ai/transformers/provider.py:110-124 \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":"daft/ai/transformers/provider.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1471df7defc116e273926feeb5c308525998c0e7f0ca7aac6a524aa3ad1a71e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-core/src/datatypes/infer_datatype.rs:497-505 | src/daft-core/src/datatypes/infer_datatype.rs:511-519 \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":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"caeed7d8f07bd39fbcb4975662b8ee8a95ea246550b6a57ec13c47fc4c42b66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-functions-utf8/src/utils.rs:184-195 | src/daft-functions-utf8/src/utils.rs:199-209 \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":"src/daft-functions-utf8/src/utils.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa2c6f5fa533f03ff1141b102fcb7dedef533228b6235ab14bbb1174b14f7a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 13\u002B corresponding lines): src/daft-micropartition/src/python.rs:304-316 | src/daft-micropartition/src/python.rs:324-337 | src/daft-recordbatch/src/python.rs:83-95 | src/daft-recordbatch/src/python.rs:103-116 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e158d4a8757d82e7b3f8f1731ba26a6692952edc15dd5890ab1e9337c3eac5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): src/daft-sql/src/table_provider/read_csv.rs:81-107 | src/daft-sql/src/table_provider/read_json.rs:18-36 | src/daft-sql/src/table_provider/read_parquet.rs:78-100 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-sql/src/table_provider/read_csv.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2340f8f0d3dc48630755a8a9035be0ce7a46ca8240e45564c5ce47ee377a873"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): daft/udf/__init__.py:64-249 | daft/udf/__init__.py:265-352 \u2014 These two members are one piece of code written twice and then edited apart: 88 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/udf/__init__.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d49592395e0581245cc894aa46ea0f2969ffecac0d860b17182c47ae08c8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-dsl/src/visitor.rs:251-260 | src/daft-dsl/src/visitor.rs:277-285 \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":"src/daft-dsl/src/visitor.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51c4525a6fa76731e23e7f5cb962ea1ade1c2a84003a54ccdaf65c63ca2495b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-core/src/array/iterator.rs:217-228 | src/daft-core/src/array/iterator.rs:238-249 \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":"src/daft-core/src/array/iterator.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31fc47a628ba8810ebf3fb01d59544c5c8d6eb96087b8f4dafdc7aaea00c850"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-schema/src/dtype.rs:889-898 | src/daft-schema/src/dtype.rs:913-922 \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":"src/daft-schema/src/dtype.rs"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c2967dbe3cc95f89f8143afc8969ac1e10f1822e2c1135c243b4fbf79b267f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-sql/src/modules/image/crop.rs:14-23 | src/daft-sql/src/modules/map.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":"src/daft-sql/src/modules/image/crop.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"008b7443a999cf869d930baaf7c257e6390cb537dabafe09257893b58aaae0f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-context/src/subscribers/dashboard.rs:342-359 | src/daft-context/src/subscribers/dashboard.rs:365-380 \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":"src/daft-context/src/subscribers/dashboard.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bca1cb3e8fd0f8bd4860919d4cadaac4e9bdf13c79cbc38b606c257a9070da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-logical-plan/src/ops/asof_join.rs:101-119 | src/daft-logical-plan/src/ops/join.rs:204-219 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/asof_join.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"154ae0d02588a950ddfb3cc44358af2ea69b3b081181cd173e2438a3f6fd95f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): benchmarking/ai/audio_transcription/ray_data_main.py:54-63 | benchmarking/ai/audio_transcription/daft_main.py:55-63 \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":"benchmarking/ai/audio_transcription/ray_data_main.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa29ce88f4e763b3b95d18ba1aa28a39b4e49dcf81edb6a408462b99f597d1bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): daft/recordbatch/micropartition.py:385-392 | daft/recordbatch/recordbatch.py:402-409 \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":"daft/recordbatch/micropartition.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"16029822a53fcd9178ae7ea8b1bbb6019b37502e8cac05cfec306e3adbb6dd91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/common/io-config/src/hdfs.rs:25-34 | src/common/io-config/src/unity.rs:14-23 \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":"src/common/io-config/src/hdfs.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"14805f7b9f4e0e56ff8b08f4af91401f8a59a61488f6a43282cca663859317a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): src/daft-core/src/array/iterator.rs:31-42 | src/daft-core/src/array/iterator.rs:52-63 | src/daft-core/src/array/iterator.rs:101-112 | src/daft-core/src/array/iterator.rs:122-133 \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":"src/daft-core/src/array/iterator.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f14993e3fb4aa97e993ccfd9eff51fb67cb59eaf570d425d061311ccd3d9935"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): src/daft-dsl/src/functions/partitioning/evaluators.rs:101-114 | src/daft-dsl/src/functions/partitioning/evaluators.rs:148-161 | src/daft-dsl/src/functions/struct_/get.rs:59-74 \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":"src/daft-dsl/src/functions/partitioning/evaluators.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0585716af965cf6a1ad304ccbcdbcd727eb78bdf3931f1d6475bb11b65421955"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-dsl/src/functions/scalar.rs:292-303 | src/daft-dsl/src/functions/mod.rs:118-126 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/scalar.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3fc3b14e8da7f8bc99d68b75a2846b1c97ce1756445928803ed95dfea6f4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): src/daft-functions-uri/src/download.rs:102-107 | src/daft-functions/src/minhash.rs:52-66 | src/daft-functions/src/simhash.rs:150-159 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-functions-uri/src/download.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb0e1fb8f8cd0e3ba68e47ac29cf7eaad5d1417cf9f0518930b8fb8acc3f3f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/daft-functions/src/distance/euclidean.rs:8-18 | src/daft-functions/src/distance/dot_product.rs:8-15 \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":"src/daft-functions/src/distance/euclidean.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"4065e797d2a0fd35e6a02ebf30adaa8e27fffc1dd3aa1925a6f2635e22846d3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): benchmarking/ai/audio_transcription/ray_data_main.py:66-71 | benchmarking/ai/audio_transcription/daft_main.py:70-75 \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":"benchmarking/ai/audio_transcription/ray_data_main.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5964941b96a61494cc88bbaa5b45435b38fe3073f535dbcbc432f8f3c67d443d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): daft/io/hudi/pyhudi/utils.py:89-96 | daft/io/hudi/pyhudi/utils.py:100-111 \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":"daft/io/hudi/pyhudi/utils.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e383116fb1ca23a1739e2439ee407d6032883e5ffec55175f8e7aa70cbaf1b88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 5\u002B corresponding lines): daft/recordbatch/micropartition.py:149-153 | daft/recordbatch/micropartition.py:395-404 | daft/recordbatch/recordbatch.py:156-160 | daft/recordbatch/recordbatch.py:412-418 | daft/series.py:254-259 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/micropartition.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"301bbbe0187270c6132c922fa876837c2b8da12a2e17e6cc4ff5d21f2fb6da51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-functions/src/float/is_inf.rs:22-29 | src/daft-functions/src/float/not_nan.rs:25-31 \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":"src/daft-functions/src/float/is_inf.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"830b32b491aa10956b1df9883a675b4b522d8da17ccab759095798f9b0b8fd77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-local-execution/src/intermediate_ops/project.rs:36-43 | src/daft-parquet/src/helpers.rs:119-125 \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":"src/daft-local-execution/src/intermediate_ops/project.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"494c9e10739941f6a0d35ced9d4f46e7a06532422bdcb6496441143a6c62eb07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-distributed/src/scheduling/scheduler/linear.rs:144-154 | src/daft-distributed/src/scheduling/scheduler/default.rs:156-165 \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":"src/daft-distributed/src/scheduling/scheduler/linear.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9f7395d2f0af4df50c4993cbb2968bb4fabbc83da9ff67fac43b5a0952d3fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): src/daft-functions-json/src/jq.rs:31-36 | src/daft-functions-json/src/json_array_length.rs:30-39 | src/daft-functions-json/src/json_object_keys.rs:43-55 \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":"src/daft-functions-json/src/jq.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91a4dd3c7091f3c3288197bfea4059c1cd4cf666ecf34e5431473d61d9998b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-dsl/src/expr/mod.rs:2752-2758 | src/daft-recordbatch/src/lib.rs:1613-1619 \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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2752}}}],"partialFingerprints":{"codehealthFindingId/v1":"131fa13cb9a37072998ba498739202edd32ae1eb1a0f9431d94cb261a3b3dce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-writers/src/file.rs:308-317 | src/daft-writers/src/partition.rs:223-232 \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":"src/daft-writers/src/file.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c822c9cff72112314afbce7fba3199eedb23db98319d60cd0afbc108e9d384f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): daft/io/delta_lake/_visitors.py:223-228 | daft/io/paimon/_predicate_visitor.py:97-103 \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":"daft/io/delta_lake/_visitors.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e2db402679b588c67f6073b32d3c9ccaa6a57709409c3f69591dbb346c3c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/common/io-config/src/tos.rs:44-61 | src/common/io-config/src/cos.rs:56-71 \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":"src/common/io-config/src/tos.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"069441673b69ebabc2335f3fb13d4c4aa48426c273f76bbe3d77c4cda8822ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-ext-internal/src/aggregate.rs:314-320 | src/daft-ext-internal/src/function.rs:221-227 \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":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a93f060e3563b1238212af3d00d9031352695dc8f6d580b31c437b0efda5ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/daft-core/src/array/union_array.rs:145-153 | src/daft-core/src/array/struct_array.rs:181-188 \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":"src/daft-core/src/array/union_array.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa392ea0593b7c8184bc2dec7348792802a5e67f6f3b9e99bc4acf64bd370f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/daft-local-execution/src/intermediate_ops/unpivot.rs:55-71 | src/daft-local-execution/src/intermediate_ops/filter.rs:126-137 \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":"src/daft-local-execution/src/intermediate_ops/unpivot.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1096fe20e6e65f875f07fe12a7568bb5e2d416ab985efe1edac45d990480c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): daft/io/paimon/_predicate_visitor.py:126-133 | daft/io/paimon/_predicate_visitor.py:136-142 \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":"daft/io/paimon/_predicate_visitor.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2aba4a6896343a60ebd1c195b637f1f3eacb20688d5329e5c03cea4e04c8e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): daft/runners/native_runner.py:201-214 | daft/runners/ray_runner.py:728-741 \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":"daft/runners/native_runner.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9cbac99bffafe16bdbaaeb5d794009f46ec499af2bfa64bbeb0d0be8101211"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-local-execution/src/sinks/blocking_sink.rs:89-100 | src/daft-local-execution/src/streaming_sink/base.rs:101-110 \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":"src/daft-local-execution/src/sinks/blocking_sink.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8e17ecf53fce2f1f9c21c4730fe05440154849f924a0d15d6d323a11dc8b0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): src/daft-logical-plan/src/ops/project.rs:99-108 | src/daft-logical-plan/src/ops/shard.rs:56-67 | src/daft-logical-plan/src/ops/vllm.rs:59-65 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab99a629da5915e251bd097e60219b67bcaf63051ea8f5060535e6ca1b4118d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): benchmarking/ai/image_classification/daft_main.py:40-43 | benchmarking/ai/image_classification/ray_data_main.py:26-29 \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":"benchmarking/ai/image_classification/daft_main.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f40c864fc950a36803a3b50d3e46becd28bd43d5d00da8ee487b4e1ade67016"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): src/daft-functions-list/src/count_distinct.rs:35-42 | src/daft-functions-tokenize/src/decode.rs:60-68 | src/daft-functions-tokenize/src/encode.rs:70-80 \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":"src/daft-functions-list/src/count_distinct.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df4b8c90381a90f2424c7326fe71882ef42dbfcb158a992b3e0a7c67bbf2cff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): daft/functions/image.py:86-100 | daft/series.py:1179-1183 \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":"daft/functions/image.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5140782e2e432d1cefba3435cf28ec88faf07bd003c592c9bbb7c8322281209e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): daft/ai/google/provider.py:56-65 | daft/ai/openai/provider.py:64-73 \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":"daft/ai/google/provider.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3d3ef8474cc86b5f706d2616c4a284451003b02f759db4462b4edd19e50112"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/daft-core/src/python/series.rs:422-425 | src/daft-recordbatch/src/python.rs:444-447 \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":"src/daft-core/src/python/series.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"70793cb3ddf7d360468be1000d3b3c0944e7bb0bc3b774fa79eaa918b3978435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-distributed/src/pipeline_node/mod.rs:480-489 | src/daft-local-execution/src/pipeline.rs:386-395 \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":"src/daft-distributed/src/pipeline_node/mod.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"291d68ac0335f817bd99bdbe3f50a23c9977ceb01cad024550d585b407420454"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): src/daft-local-execution/src/intermediate_ops/project.rs:204-211 | src/daft-local-execution/src/sinks/dedup.rs:178-185 | src/daft-logical-plan/src/partitioning.rs:137-145 | src/daft-logical-plan/src/partitioning.rs:397-405 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/project.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab3644cb7db2e8b3c79689030d5941f7aa631964258f8a0dd8da42f7465d930"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 12\u002B corresponding lines): src/daft-local-execution/src/sinks/dedup.rs:105-116 | src/daft-local-execution/src/sinks/grouped_aggregate.rs:333-345 | src/daft-local-execution/src/sinks/window_order_by_only.rs:84-95 | src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:103-115 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:94-106 | src/daft-local-execution/src/sinks/window_partition_only.rs:80-92 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/dedup.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d38f4465f85c6fdfe446b24ce9d91e42be9ec4a1e6779ecd90b71ca5dd0522f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/common/io-config/src/python.rs:532-538 | src/daft-catalog/src/python/mod.rs:199-205 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/python.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e35a3ade230ca959ff60547266edfcd11ec8673da730c72ea42c5af18549639"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-recordbatch/src/ops/window_states/first_last_value.rs:65-71 | src/daft-recordbatch/src/ops/window_states/minmax.rs:98-107 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/window_states/first_last_value.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d5794b530da81f042d5b8360f1003eef81111fde59733fa6b3707519cf1629"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): daft/ai/google/provider.py:26-37 | daft/ai/openai/provider.py:27-38 \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":"daft/ai/google/provider.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a90f44715394e8ea46c7d7a4f9be013fbb596f24442b000c403f2b5ac6a666e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/daft-core/src/series/mod.rs:152-159 | src/daft-recordbatch/src/column/mod.rs:135-142 \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":"src/daft-core/src/series/mod.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f32b99a23119866aa7e067157ca458f600de90dca0ea7db4e2ffd8b675cbdf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): daft/ai/lm_studio/provider.py:48-58 | daft/ai/openai/provider.py:47-55 \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":"daft/ai/lm_studio/provider.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d940a091db97857727971456a51f2b4626dbf99473c2a1e8e927e7f850900c49"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): daft/recordbatch/micropartition.py:107-109 | daft/recordbatch/recordbatch.py:112-114 \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":"daft/recordbatch/micropartition.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e384f33eee6c63e35997a785bb610f9247383c8397c70c4c041425e53ce4698"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): daft/recordbatch/micropartition.py:272-274 | daft/recordbatch/recordbatch.py:311-313 \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":"daft/recordbatch/micropartition.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"94eb0e5d2dbc20bd000f30796f9e58b2c94c5609948e4789c0f807c0b8a46089"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-distributed/src/pipeline_node/mod.rs:471-477 | src/daft-local-execution/src/pipeline.rs:378-384 \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":"src/daft-distributed/src/pipeline_node/mod.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"03eb9e9bc25e5cd8f5c8e64fb9c1dc4e26931f9726657aecb03ce5b44eb4928e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-dsl/src/expr/mod.rs:1315-1324 | src/daft-dsl/src/functions/sketch/mod.rs:43-52 \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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea956981da667ce45a8beaaeb785621d243af632421f9d7e5a11b3720d01487d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-local-execution/src/sinks/gather.rs:80-91 | src/daft-local-execution/src/sinks/into_partitions.rs:157-165 \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":"src/daft-local-execution/src/sinks/gather.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee6363de4cd6e64310bbc776606a92bcd44b50ec86d2d64d84a76df07aa07e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): daft/io/delta_lake/delta_lake_write.py:196-199 | daft/io/iceberg/iceberg_write.py:257-260 \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":"daft/io/delta_lake/delta_lake_write.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"74409cba289ad44be63eb0590b204ad109e45f5acdff318cfa02156881e94cdb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/common/daft-config/src/lib.rs:8-14 | src/daft-local-execution/src/runtime_stats/mod.rs:54-60 \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":"src/common/daft-config/src/lib.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22b91685a10a36071a655e9a0a59624aab26a2aeda12efa4f4d8de31d86e42d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:385-396 | src/daft-local-execution/src/join/join_node.rs:135-151 | src/daft-local-execution/src/streaming_sink/base.rs:518-529 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"src/daft-local-execution/src/intermediate_ops/intermediate_op.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a2135b09df6169acf6887d850bbe8b700a49c0c3cce3c1e0b67fde4c0a69ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-local-execution/src/sinks/dedup.rs:68-76 | src/daft-local-execution/src/sinks/window_base.rs:52-60 \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":"src/daft-local-execution/src/sinks/dedup.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2029892435fe300b2dc8d04a0ff92cad41a99b192318183e10f39ed8cdbaa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): src/daft-local-execution/src/sinks/aggregate.rs:33-41 | src/daft-local-execution/src/sinks/pivot.rs:32-40 | src/daft-local-execution/src/sinks/sort.rs:32-40 \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":"src/daft-local-execution/src/sinks/aggregate.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"957edc1320b30548c928bdb61c9fd31d277c6a52c666f14798551081c1693c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/daft-local-execution/src/sources/scan_task.rs:54-69 | src/daft-local-execution/src/sources/shuffle_read.rs:43-58 \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":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e9be44083bf41deb7917a88067de846f67f2359e9f5f949c9747c537a5bf41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): src/common/io-config/src/azure.rs:94-101 | src/common/io-config/src/config.rs:205-212 | src/common/io-config/src/http.rs:61-68 | src/common/io-config/src/huggingface.rs:70-77 | src/common/io-config/src/s3.rs:272-279 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/azure.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"703f7b57caaf3a6606263b7d79160100e711d06e89853aa394676921c66ef811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-core/src/array/fixed_size_list_array.rs:133-139 | src/daft-core/src/array/list_array.rs:141-148 \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":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b3b59d6ec4498cdc44133cdd4b7ab9ad2dbe8f490e47696fb74ddd7478ff59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/daft-core/src/python/series.rs:277-280 | src/daft-recordbatch/src/python.rs:65-70 \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":"src/daft-core/src/python/series.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c45cde7767a0fef139faf25f4c27aa519fc9ac82805b1e227d02b9b74d6e28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/daft-functions/src/numeric/mod.rs:62-66 | src/daft-functions/src/numeric/round.rs:45-52 \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":"src/daft-functions/src/numeric/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c78a01933cd7d4e27faad85d135da70ad05757b42af7491bafc639fc05d22d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): daft/recordbatch/micropartition.py:199-201 | daft/recordbatch/recordbatch.py:236-238 \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":"daft/recordbatch/micropartition.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"200c007b69ab3c0af36709df3bee5c81469acb1a164cc14f986ccc0fc946bc3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): daft/recordbatch/micropartition.py:211-213 | daft/recordbatch/recordbatch.py:254-256 \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":"daft/recordbatch/micropartition.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbd214e34da92cfc07a52c819b76606f55006c7c7f6b25ca9a362c439a4ffcac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/daft-csv/src/options.rs:113-121 | src/daft-json/src/options.rs:82-89 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/options.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ac8b410e4da920dffb40f18d087726e9b7a23fa5ce71c0976976e6c54bb182"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-distributed/src/pipeline_node/into_partitions.rs:305-311 | src/daft-distributed/src/pipeline_node/random_shuffle.rs:148-157 \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":"src/daft-distributed/src/pipeline_node/into_partitions.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"39256391a4e0ad6f92eac81668eb25cdc9da2ae10aca6fa2e02949d4b99b629c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/daft-functions-binary/src/codecs.rs:47-56 | src/daft-image/src/functions/hash_method.rs:53-62 \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":"src/daft-functions-binary/src/codecs.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"830e2b70ef5c4d55824f6de3aa588d35d27cd7350a78c8c944819e33f841295d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/daft-io/src/gravitino.rs:20-28 | src/daft-io/src/unity.rs:20-28 \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":"src/daft-io/src/gravitino.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"153f2db25ecfd6e62e492d8efb28f81514db2e4a0bd9d3243b73ef897b02dc87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/daft-local-execution/src/sinks/grouped_aggregate.rs:133-141 | src/daft-local-execution/src/sinks/window_base.rs:23-26 \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":"src/daft-local-execution/src/sinks/grouped_aggregate.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fced9737bfce34844764e8c80d1db506c68271c089b8801d4b6919c7f552913"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): daft/catalog/__iceberg.py:279-284 | daft/catalog/__paimon.py:269-274 | daft/catalog/__unity/_catalog.py:154-159 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"daft/catalog/__iceberg.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0022a9dcd88f625bf8da8ce0e61d6174b7d86211c7664f46c3e54aff3f5e8d34"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-local-execution/src/run.rs:773-779 | src/daft-local-execution/src/runtime_stats/mod.rs:595-601 \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":"src/daft-local-execution/src/run.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec319dd7e1a8c6e8bf6ad590ab7f8938894b71f4a2afea271b2b3ea9396fff66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): daft/ai/transformers/protocols/image_classifier.py:94-104 | daft/ai/transformers/protocols/text_classifier.py:73-82 \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":"daft/ai/transformers/protocols/image_classifier.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"90323e0410a44c27f5628bc76ac6a4efcf5eff51f597f82824d00b03fb3ac507"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): src/daft-file/src/functions.rs:66-72 | src/daft-functions-list/src/count.rs:44-49 | src/daft-functions-list/src/list_map.rs:47-53 \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":"src/daft-file/src/functions.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"809b32230b91382c4f0a47e420f25fc1a82abcb9780ab6cb6e6183d5c45f69ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): benchmarking/ai/document_embedding/daft_main.py:65-69 | benchmarking/ai/document_embedding/ray_data_main.py:49-51 \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":"benchmarking/ai/document_embedding/daft_main.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"101c07f38198c64c9e4e066f0cfb45eac71e8c11e7d58022255d7e5eb9750afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): daft/functions/misc.py:125-137 | daft/functions/numeric.py:247-284 \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":"daft/functions/misc.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"63eb1b5812cb5ec9abfa6fe2a29540d590c11c831b1a0d24bfe6d958d85c14fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-local-execution/src/intermediate_ops/udf.rs:564-570 | src/daft-local-execution/src/streaming_sink/vllm.rs:458-464 \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":"src/daft-local-execution/src/intermediate_ops/udf.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"5001f799a9b9e18aeca331fb900fe01ee8138cf3748013e26492e80ab241f522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): src/common/io-config/src/python.rs:499-506 | src/daft-dashboard/src/import.rs:69-74 \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":"src/common/io-config/src/python.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7a3af1689f2cacf589784089b98e245806a3693a0522e1a4c280806be7c33e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/daft-functions-utf8/src/ilike.rs:26-30 | src/daft-functions-utf8/src/like.rs:27-31 \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":"src/daft-functions-utf8/src/ilike.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefddfe607b4d6fe6f4a195443b1e4bdb1eb73e4996960c551c14bd2e584af7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/daft-io/src/gravitino.rs:228-231 | src/daft-io/src/unity.rs:167-170 \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":"src/daft-io/src/gravitino.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8896fd30431f9ad44f60617eb90f27ad0518af34a5be6f41623062ebfdead73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): src/daft-io/src/gravitino.rs:233-236 | src/daft-io/src/unity.rs:172-175 \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":"src/daft-io/src/gravitino.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2fe7f27c108f0ae1012ff42c0c5fcec6f2af8afe45301469a9dac4eb3b508c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): benchmarking/tpch/__main__.py:117-120 | benchmarking/tpch/ray_job_runner.py:78-81 \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":"benchmarking/tpch/__main__.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"710d515649aa61b6be77ad20490710ab73e6f987bb4fc41197a90a94d1a72903"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): daft/io/bigtable/bigtable_data_sink.py:204-213 | daft/io/turbopuffer/turbopuffer_data_sink.py:224-234 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/bigtable/bigtable_data_sink.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3d3a50bfe6689455ffdca5361fbc620e2341479ad46d4ce0ccec3a24158880"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): daft/recordbatch/micropartition.py:510-519 | daft/recordbatch/recordbatch.py:530-539 \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":"daft/recordbatch/micropartition.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5e115ccf9d0922d07a37a107805474cab8bda5254f7f02d1af25fa91b71018"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/daft-csv/src/metadata.rs:59-69 | src/daft-json/src/schema.rs:59-70 \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":"src/daft-csv/src/metadata.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8018dcbc72180a0f23d20549653f54681d20113b1a1b1775ce02057503f95a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): src/daft-ext-internal/src/aggregate.rs:73-80 | src/daft-ext-internal/src/function.rs:92-96 \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":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28aa55aa0b8855b90ffad531aa9daa8c9751cab4f6793bca0f58ce7410716eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-micropartition/src/python.rs:143-149 | src/daft-recordbatch/src/python.rs:577-583 \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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f85da9db989274f0af0846f8264d2e27d5c57f877f8deffecbf657fcc8c88f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): daft/__init__.py:185-187 | daft/io/__init__.py:53-55 \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":"daft/__init__.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d9f34a9d82ced386e9bca2b413c89cf314bb954239157b5f1aa676b182f68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): daft/functions/bitwise.py:9-12 | daft/functions/misc.py:308-337 \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":"daft/functions/bitwise.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de6887b0e735f058e63e9878db784ca1ea79d6ffc6e9d7c52c37730916d69d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): daft/io/_sql.py:378-391 | daft/io/clickhouse/clickhouse_data_sink.py:78-94 \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":"daft/io/_sql.py"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bafc285d88df312e1dfdcb2f3fcb1007ab178044ae3221b75e5e646fcf9576c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/daft-local-execution/src/sinks/aggregate.rs:25-31 | src/daft-local-execution/src/sinks/pivot.rs:24-30 \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":"src/daft-local-execution/src/sinks/aggregate.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"14b9039b2614f1424939320361cd81635d243618e61e7ff1a0e11e01d3fec7be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (102 lines \u00D7 2): src/daft-writers/src/csv_writer.rs:210-311 | src/daft-writers/src/json_writer.rs:171-272 \u2014 before extracting anything, compare \u0060src/daft-writers/src/csv_writer.rs\u0060 and \u0060src/daft-writers/src/json_writer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-writers/src/csv_writer.rs:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea68636833036f46e47bb1e014385928402dc889fe4894b32798fff3969eb54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (50 lines \u00D7 2): src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:139-188 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:130-179 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs\u0060 and \u0060src/daft-local-execution/src/sinks/window_partition_and_order_by.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:139\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a80d651101000df9f8fa04c0ca02b0910a822e275c3f28830e5e018f5f89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): src/daft-functions-temporal/src/date_construction.rs:213-251 | src/daft-functions-temporal/src/date_construction.rs:380-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 \u0060src/daft-functions-temporal/src/date_construction.rs:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_construction.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b5c98479b94efce07dd62a07ec0d39f8b5ec3554f70a429218d4dc8afb69c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 3): src/daft-local-plan/src/plan.rs:159-196 | src/daft-local-plan/src/plan.rs:212-249 | src/daft-local-plan/src/plan.rs:262-299 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-plan/src/plan.rs:159\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d06deb1312ddd111091f5dbc8f23a23645f83afd9156d63de4b8982e1868b6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): src/daft-logical-plan/src/builder/mod.rs:1048-1083 | src/daft-logical-plan/src/builder/mod.rs:1123-1157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/builder/mod.rs:1048\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-logical-plan/src/builder/mod.rs:1122\u0060 calls \u0060enrich_with_stats\u0060, \u0060Some\u0060, \u0060clone\u0060 and \u0060src/daft-logical-plan/src/builder/mod.rs:1047\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":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67764deda80ef18c664ba2ea15943bb6a6f8090cca515bfb03274ddae0a7e89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): src/daft-csv/src/read.rs:256-289 | src/daft-json/src/read.rs:76-109 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-json/src/read.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"1837ba89b8e855f2064a5d032ee5ec0dcd237f19617ee0b9b42593cc109d4899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 3): src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:50-82 | src/daft-distributed/src/pipeline_node/join/stats.rs:32-64 | src/daft-local-execution/src/join/stats.rs:54-86 \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 \u0060src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:50\u0060 it does not close everything it opens, so those exact 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, \u0060src/daft-distributed/src/pipeline_node/join/stats.rs:31\u0060 calls \u0060key_values_from_context\u0060 and \u0060src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:49\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":"src/daft-distributed/src/pipeline_node/join/broadcast_join.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3020ebdbc17ff8c043d5f922d8b302dc557685702d12fa856ea2896cdfd07d04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/daft-dsl/src/functions/python/mod.rs:120-152 | src/daft-dsl/src/functions/python/mod.rs:165-197 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/functions/python/mod.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/python/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab31b0e2eb215596d31af64b4badb8c79b8f8311a3c9f82578c4d25b3c7f5bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): src/daft-image/src/ops.rs:347-379 | src/daft-image/src/ops.rs:383-415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060arr\u0060 to \u0060\u0026ImageArray\u0060 in one and \u0060\u0026FixedShapeImageArray\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":"src/daft-image/src/ops.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc41ba56d6f651cc4e188e007ee1b650c3589b409ad9361b696ee6bb7b0d1d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/daft-io/src/http.rs:173-203 | src/daft-io/src/http.rs:220-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/http.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. 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 \u0060source\u0060 to \u0060reqwest_middleware::reqwest::Error\u0060 in one and \u0060reqwest_middleware::Error\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":"src/daft-io/src/http.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5b2e91b68c441009a7e29c53d3e460dc494bf1543b102fb21ed1bde256d23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (72 lines \u00D7 2): src/daft-functions-temporal/src/date_construction.rs:119-190 | src/daft-functions-temporal/src/date_construction.rs:286-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-temporal/src/date_construction.rs:119\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_construction.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fac38984f061e9a2394acbfdd223f0868def802e3a36bceef52851a7fb940e3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/daft-local-execution/src/intermediate_ops/project.rs:226-255 | src/daft-local-execution/src/intermediate_ops/udf.rs:573-602 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from 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":"src/daft-local-execution/src/intermediate_ops/project.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bbc07a64a589daf5f08c28dfc1522291f3fb27d1b6ced754118e8833ef7be72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): src/daft-local-execution/src/join/left_right_join.rs:62-91 | src/daft-local-execution/src/join/left_right_join.rs:142-171 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/left_right_join.rs:62\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4198a88ed97d65c111d1a1655debb2dbbf7baf2757f21c9779f0ba30063cd46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:124-152 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:115-143 | src/daft-local-execution/src/sinks/window_partition_only.rs:101-129 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs\u0060 and \u0060src/daft-local-execution/src/sinks/window_partition_and_order_by.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"1541981413cc6b771d37dd6a52ca995f8255e7bcd4888761f69dc48b00817e4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): src/daft-distributed/src/pipeline_node/sink.rs:50-77 | src/daft-local-execution/src/sinks/write.rs:53-81 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-distributed/src/pipeline_node/sink.rs:50\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/sink.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cf5c8e9d3be7bc9cbdd72cb59016ee41202b623ed160cfe4412c81ec9385f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3): src/common/io-config/src/cos.rs:94-120 | src/common/io-config/src/goosefs.rs:128-154 | src/common/io-config/src/tos.rs:84-110 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/cos.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9cf5709318ebac0aeb8e74f19e725a9164c53f47211b600cd0cc0382d7f0083"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 3): src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:216-241 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:230-255 | src/daft-local-execution/src/sinks/window_partition_only.rs:141-167 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs\u0060 and \u0060src/daft-local-execution/src/sinks/window_partition_and_order_by.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:216\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c421578bfdbc989080988bf2be5a6a56d7e361e92636be52c7d49819023f70a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/daft-csv/src/read.rs:385-411 | src/daft-json/src/read.rs:212-237 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-json/src/read.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"84459c1ba6962ca076330cced50c6ccba480415608cee4795c300f2e3e4b162d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:240-266 | src/daft-functions-list/src/kernels.rs:306-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 \u0060src/daft-functions-list/src/kernels.rs:240\u0060 it begins part-way through the construct above it, so those exact 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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e443c964e3373cbd120ae482df51d85e9d9d80d1c0f31e374b1170a26d7b1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/daft-local-execution/src/intermediate_ops/udf.rs:126-152 | src/daft-local-execution/src/streaming_sink/async_udf.rs:118-144 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/intermediate_ops/udf.rs\u0060 and \u0060src/daft-local-execution/src/streaming_sink/async_udf.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/udf.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3effeff856d25ac10bb30610ead1844c58d0432d8d90450be15230d90f82c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:1207-1233 | src/daft-recordbatch/src/lib.rs:1538-1564 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:1207\u0060 it does not close everything it opens, so those exact 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e39d91e95ccf777321b3bbf6616aee4b693322874c734afa9d42d0b44fc9a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201326 lines \u00D7 5): src/daft-csv/src/local.rs:200-223 | src/daft-csv/src/read.rs:316-341 | src/daft-csv/src/read.rs:456-481 | src/daft-json/src/read.rs:162-185 | src/daft-json/src/read.rs:319-343 \u2014 before extracting anything, compare \u0060src/daft-csv/src/local.rs\u0060 and \u0060src/daft-csv/src/read.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-csv/src/local.rs:196\u0060 calls \u0060strip_file_uri_to_path\u0060, \u0060unwrap_or\u0060, \u0060open\u0060 and \u0060src/daft-csv/src/read.rs:455\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":"src/daft-csv/src/local.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"140f23aeaa6545f4870de8bbcc8e8e5da3df7305949ede54d563a06734b26d28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/daft-functions/src/similarity/bitwise_hamming.rs:92-117 | src/daft-functions/src/similarity/bitwise_hamming.rs:137-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 \u0060src/daft-functions/src/similarity/bitwise_hamming.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/similarity/bitwise_hamming.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbdf8fb251c58bdf25bf2de720a200017b7207068aebaafa94c2db91b504c2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/daft-logical-plan/src/ops/limit.rs:56-80 | src/daft-logical-plan/src/ops/top_n.rs:98-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/limit.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8962ddd31724785429a0538bb941962f047f5c8cc80c80bc925a22f973b4744"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:1240-1265 | src/daft-recordbatch/src/lib.rs:1571-1596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:1240\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bafc4dff63a477e4f217898751b35f8007612aa3001b3665cf0f5dd62c40f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): src/daft-writers/src/pyarrow.rs:142-167 | src/daft-writers/src/pyarrow.rs:184-208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-writers/src/pyarrow.rs:142\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/pyarrow.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5f7ddc3d1ad4896dd18f3ebb281cee0a6c77fd5beeec4ccfacb744d195c604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 3): src/daft-io/src/s3_like.rs:273-297 | src/daft-io/src/s3_like.rs:306-329 | src/daft-io/src/s3_like.rs:338-361 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/s3_like.rs:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ec01a5f0b06eeaa525bd7b62482c2d5f0dd0354a73f6a02482268639ff6333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/daft-algebra/src/simplify/boolean.rs:120-144 | src/daft-algebra/src/simplify/boolean.rs:214-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-algebra/src/simplify/boolean.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-algebra/src/simplify/boolean.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9768071e206b829c3db731245b9749ff78ebba74c620972452cb8e771156bae6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/daft-csv/src/read.rs:518-542 | src/daft-json/src/read.rs:382-406 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-json/src/read.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:518\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"78af3a53ff241a3763eaf0a2bb509fc20abf1598ae6a42d637a8c9372aa9c4f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201325 lines \u00D7 2): src/daft-logical-plan/src/ops/sort.rs:35-58 | src/daft-logical-plan/src/ops/top_n.rs:56-80 \u2014 before extracting anything, compare \u0060src/daft-logical-plan/src/ops/sort.rs\u0060 and \u0060src/daft-logical-plan/src/ops/top_n.rs\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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/ops/sort.rs:35\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/sort.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"228105ec3d1b3bac6f93b95e3e5a58e38bb8864b472787f09e93593a0171fa00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/daft-functions-utf8/src/pad.rs:60-82 | src/daft-functions-utf8/src/utils.rs:144-166 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/pad.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":"src/daft-functions-utf8/src/pad.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4134563c5d2026d91113190eb0f71c4f0f02463891be15177c5c32eb33bc0a84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/daft-distributed/src/pipeline_node/actor_udf.rs:255-276 | src/daft-distributed/src/pipeline_node/udf.rs:189-210 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-distributed/src/pipeline_node/actor_udf.rs:255\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/actor_udf.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46cdc7500b595a8373f49f5464089cac703ac2e2dbef102fd879e9fab7ae005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/daft-dsl/src/expr/mod.rs:561-582 | src/daft-dsl/src/expr/mod.rs:738-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 \u0060src/daft-dsl/src/expr/mod.rs:561\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"157f71797ffe918b0b6e9c2ba217e6aba0d5bc6de87faf826f1855dd2433821b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/daft-micropartition/src/micropartition.rs:292-313 | src/daft-micropartition/src/micropartition.rs:384-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-micropartition/src/micropartition.rs:292\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cc3a577af709cd7eeda0e8b70851f5d399d971e57060855b84c792fa7209c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:1000-1021 | src/daft-recordbatch/src/ops/inline_agg.rs:1091-1112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1000\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e4b8dac8ecbdcf7d1b093cdf5afaae257c319c01bcd96971f6b1757549b134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/daft-scan/src/python/wrappers.rs:223-244 | src/daft-scan/src/python/wrappers.rs:404-425 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-scan/src/python/wrappers.rs:223\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060src/daft-scan/src/python/wrappers.rs:220\u0060 calls \u0060call_method1\u0060, \u0060Ok\u0060, \u0060datasource_task_ref_from_py\u0060 and \u0060src/daft-scan/src/python/wrappers.rs:403\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":"src/daft-scan/src/python/wrappers.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"02377cf744206ed3f3584c671ebd6c5b7147fa15e7beb117c45f9249a1a65ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/daft-core/src/array/struct_array.rs:139-159 | src/daft-core/src/array/union_array.rs:159-179 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-core/src/array/struct_array.rs:139\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/struct_array.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2291616ea5f73392bf5991d51de1615a94cb3d69e46df0907ff126f394ec816b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/daft-dsl/src/python.rs:211-231 | src/daft-dsl/src/python.rs:275-295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/python.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5be8b7fd77285a577c229ed8cff69958db021965b6e94cf15e2b2081c87acb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201321 lines \u00D7 2): src/daft-io/src/google_cloud.rs:438-455 | src/daft-io/src/s3_like.rs:1473-1493 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-io/src/google_cloud.rs:438\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-io/src/google_cloud.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"113c1eb8700c11834adf2a02318788c571ad876778b258cf0a2be9c2d74df305"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): src/daft-logical-plan/src/logical_plan.rs:305-325 | src/daft-logical-plan/src/logical_plan.rs:338-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/logical_plan.rs:305\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"69964d899005594c0af88c3f13674e352eb5f9d498c3b6cd73b72d1a4f996530"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:1811-1831 | src/daft-stats/src/table_stats.rs:184-204 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"65aafbadc27822b733dba77f9ca2f40fd8a3ad8808f8e75cc700430ff9673ece"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 5): src/daft-recordbatch/src/ops/inline_agg.rs:965-984 | src/daft-recordbatch/src/ops/inline_agg.rs:992-1011 | src/daft-recordbatch/src/ops/inline_agg.rs:1055-1074 | src/daft-recordbatch/src/ops/inline_agg.rs:1083-1102 | src/daft-recordbatch/src/ops/inline_agg.rs:1412-1431 \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 \u0060src/daft-recordbatch/src/ops/inline_agg.rs:965\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be7a0483623aae9549e45cbb1462290409c637faa23d84d7dea85cb3c48b91f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 3): src/daft-csv/src/read.rs:510-529 | src/daft-json/src/read.rs:374-393 | src/daft-warc/src/lib.rs:578-596 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-json/src/read.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:510\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-csv/src/read.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa6b00da61d8ece6a0ce3b20689d7543989f5312a391c450e1cc0ae17bb4c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/daft-core/src/kernels/search_sorted.rs:45-64 | src/daft-core/src/kernels/search_sorted.rs:167-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/kernels/search_sorted.rs:45\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"2096452c2f12c6723c84221abef6f7f62867785b259ec5807a8ee9b6921b9a8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/daft-distributed/src/pipeline_node/join/asof_join.rs:114-133 | src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:111-130 \u2014 before extracting anything, compare \u0060src/daft-distributed/src/pipeline_node/join/asof_join.rs\u0060 and \u0060src/daft-distributed/src/pipeline_node/join/sort_merge_join.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":"src/daft-distributed/src/pipeline_node/join/asof_join.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"45752b8bf52ff40e9bfd95c4b4555a86fc1a15617ebf3b10da0055085d814925"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): src/daft-distributed/src/pipeline_node/shuffles/pre_shuffle_merge.rs:133-152 | src/daft-distributed/src/pipeline_node/shuffles/pre_shuffle_merge.rs:158-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/shuffles/pre_shuffle_merge.rs:133\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/shuffles/pre_shuffle_merge.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a0b186ed88e7fcfbfc02584d75aef2a1869fd044490224b25427dd4a47f50f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:408-427 | src/daft-functions-list/src/kernels.rs:785-803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/kernels.rs:408\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c6840d2b2fad9956fd7076537547007df35b77d345bb208ebc5b6ad40571449"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/daft-local-execution/src/join/left_right_join.rs:116-135 | src/daft-local-execution/src/join/outer_join.rs:98-116 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 and \u0060src/daft-local-execution/src/join/outer_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/left_right_join.rs:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-local-execution/src/join/outer_join.rs:97\u0060 calls \u0060mark_used\u0060 and \u0060src/daft-local-execution/src/join/left_right_join.rs:115\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":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"255f6cb544c68dbda13ac5a0b3937b5243e0fba26dac41c1a8cfac8212ea960b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs:910-929 | src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs:930-949 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ac1b79989f314a622372bc214b06659c9c982a71f9983c2c0bfe9a4d4e347c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/daft-sql/src/modules/window.rs:75-94 | src/daft-sql/src/modules/window.rs:124-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-sql/src/modules/window.rs:75\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/window.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d562430b9ee855a7426d4c8938efd160ae9605fe0d5b322bb2799fc630d5f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/daft-sql/src/table_provider/read_csv.rs:48-67 | src/daft-sql/src/table_provider/read_parquet.rs:49-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-sql/src/table_provider/read_csv.rs:48\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/read_csv.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d2a8c461ccc592371dd0c4f70348e09e2e04aabac256a4bc140346a7a8c839"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 4): src/daft-csv/src/read.rs:348-366 | src/daft-csv/src/read.rs:488-505 | src/daft-json/src/read.rs:193-208 | src/daft-json/src/read.rs:351-369 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-json/src/read.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:348\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-csv/src/read.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c6b2c2a4939972700bc2479357fcbedb3459763889ccd6a9fcb049929eccf45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/daft-local-execution/src/pipeline.rs:553-571 | src/daft-local-execution/src/pipeline.rs:591-609 | src/daft-local-execution/src/pipeline.rs:623-641 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/pipeline.rs:553\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"c504b46acf0d1b001ad1ac9b90bad8901a9051228a0793bff6daeea424951405"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/daft-core/src/array/fixed_size_list_array.rs:83-101 | src/daft-core/src/array/list_array.rs:94-112 \u2014 before extracting anything, compare \u0060src/daft-core/src/array/fixed_size_list_array.rs\u0060 and \u0060src/daft-core/src/array/list_array.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/fixed_size_list_array.rs:83\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e97d884f3fa41ee46d36ee5c2be7fc98527595bf029a3d0e51e9d0f09ed057a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/daft-logical-plan/src/logical_plan.rs:1048-1066 | src/daft-logical-plan/src/logical_plan.rs:1083-1101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/logical_plan.rs:1048\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":1048}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3a8000a8dfe58ba477892d1a324ba2acf28570223edb66fda2f7f55ed4bbfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201319 lines \u00D7 2): src/daft-scan/src/glob.rs:236-254 | src/daft-scan/src/glob.rs:344-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 \u0060src/daft-scan/src/glob.rs:236\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/daft-scan/src/glob.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcf3f6b9c58d2aaa246572a59ddb7be800775466858b77930f561d3296d5c1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): src/daft-sql/src/modules/temporal.rs:656-681 | src/daft-sql/src/modules/temporal.rs:721-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-sql/src/modules/temporal.rs:656\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a218d6400260ad3a2e1ecbb30dc626ff0934d837e4d733d8727f61b2491f047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 4): src/daft-writers/src/lib.rs:170-186 | src/daft-writers/src/lib.rs:191-208 | src/daft-writers/src/lib.rs:213-230 | src/daft-writers/src/lib.rs:240-255 \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 \u0060src/daft-writers/src/lib.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":"src/daft-writers/src/lib.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af124da199ee7694badf2aacaa6947ac2b5028a3223083481b68793ee9899ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/daft-functions-temporal/src/date_construction.rs:68-85 | src/daft-functions-temporal/src/date_construction.rs:217-234 | src/daft-functions-temporal/src/date_construction.rs:384-401 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-functions-temporal/src/date_construction.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dfb2626e17ea2a11c71e0089407970e72f27a65973d2ce2e766469880bfa79"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/daft-io/src/s3_like.rs:855-872 | src/daft-io/src/s3_like.rs:928-945 | src/daft-io/src/s3_like.rs:1036-1053 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/s3_like.rs:855\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"826c4099b9808b44e1166ec1aa38a4fbe034196f5cb369f2d7a21d19c671c6ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/daft-logical-plan/src/logical_plan.rs:436-453 | src/daft-logical-plan/src/logical_plan.rs:1034-1051 | src/daft-logical-plan/src/logical_plan.rs:1069-1086 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/logical_plan.rs:436\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-logical-plan/src/logical_plan.rs:1052\u0060 calls \u0060Intersect\u0060, \u0060Union\u0060 and \u0060src/daft-logical-plan/src/logical_plan.rs:454\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d19dd33d910a98dadce5e75e621ad9c32d04ff30f82a2ae2b046a85a088fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): src/daft-recordbatch/src/ops/joins/hash_join.rs:151-168 | src/daft-recordbatch/src/ops/joins/hash_join.rs:261-278 | src/daft-recordbatch/src/ops/joins/hash_join.rs:344-361 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c79860422b3b92d7d0288c91908fb95e155feb89ed0411bcf85d8ce1f320ed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/daft-functions-utf8/src/regexp_extract.rs:30-47 | src/daft-functions-utf8/src/regexp_extract_all.rs:32-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/regexp_extract.rs:30\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/regexp_extract.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c70697f0d64b0f74a87fd9abc93ef3771ead8160013123d290dbc2ea8379201"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/daft-io/src/azure_blob.rs:741-758 | src/daft-io/src/azure_blob.rs:800-817 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/azure_blob.rs:741\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f399f169028fd1fcb15de23e0644967c6fc088fea7477e1d293e589c1ea933e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/daft-mcap/src/read.rs:434-451 | src/daft-mcap/src/read.rs:462-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-mcap/src/read.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"1551fc2cfaaa81577e776077c7cb26a8c9b489d097c9847cf17ec3e5cdf319b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:1011-1028 | src/daft-recordbatch/src/lib.rs:1138-1155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3a2231bac5abf5ff9fc1966a4e3d4bc74d38b828caa221e6da3bf2d6dd36db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:1179-1196 | src/daft-recordbatch/src/ops/inline_agg.rs:1424-1440 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1179\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":1179}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc3d93ec08419c63dd98927e9bceb1361fcf561da5e569e5420a63085a5aaab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:1227-1242 | src/daft-recordbatch/src/ops/inline_agg.rs:1253-1270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1227\u0060 it begins part-way through the construct above it, so those exact 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, \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1250\u0060 calls \u0060is_null\u0060, \u0060push\u0060 and \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1226\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":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd2457f53d624f7a59ffc04ee97fa8db191067c8ddea8c8e5a67dc79925b62e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): src/common/io-config/src/gcs.rs:66-82 | src/common/io-config/src/http.rs:41-55 | src/common/io-config/src/s3.rs:174-190 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/common/io-config/src/gcs.rs:66\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/gcs.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"2955c96c288461d6af7d2b80ba8633016b1621676d1c04c6712f58de0963c9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/daft-dashboard/src/state.rs:375-389 | src/daft-dashboard/src/state.rs:487-503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/state.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7aee32bfe43c09a94483e352efca2a22758738ee35ce4735a9183295312667"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:468-484 | src/daft-functions-list/src/kernels.rs:489-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4286456eb6ba81501f248045b0881bed87ae25ca8dbf3da89e3fd732365096f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:880-896 | src/daft-functions-list/src/kernels.rs:900-916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"467e6207044abcdbebfa889b581f2d55f860f3613c7b47961099b0fbd54c9767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): src/daft-io/src/http.rs:272-288 | src/daft-io/src/huggingface/mod.rs:120-133 \u2014 before extracting anything, compare \u0060src/daft-io/src/http.rs\u0060 and \u0060src/daft-io/src/huggingface/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/http.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3588f9936efd1f4cfa72def2db9d97f56ff786e30b5ba554efe38c42e164f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): src/daft-local-execution/src/join/left_right_join.rs:100-115 | src/daft-local-execution/src/join/outer_join.rs:80-96 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 and \u0060src/daft-local-execution/src/join/outer_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/left_right_join.rs:100\u0060 it does not close everything it opens, so those exact 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, \u0060src/daft-local-execution/src/join/outer_join.rs:97\u0060 calls \u0060mark_used\u0060 and \u0060src/daft-local-execution/src/join/left_right_join.rs:116\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":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4206164654b7beaeb528a2911c7e45f5a77f204889999ec26d88509e480ad7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/daft-local-execution/src/join/outer_join.rs:224-238 | src/daft-local-execution/src/join/outer_join.rs:264-280 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/outer_join.rs:224\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/outer_join.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"49405a6ec3f83d09f6fc242809bc3798a5b2c55e5d731284217cbcdd301c90b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/daft-local-execution/src/sinks/sort.rs:112-128 | src/daft-local-execution/src/sinks/top_n.rs:156-172 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/sort.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"84afacb5958af7ff367fe37227c2b5f523b91ed14d5a3b56b9f3d41f2e4bbce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/daft-logical-plan/src/ops/sort.rs:81-97 | src/daft-logical-plan/src/ops/top_n.rs:126-142 \u2014 before extracting anything, compare \u0060src/daft-logical-plan/src/ops/sort.rs\u0060 and \u0060src/daft-logical-plan/src/ops/top_n.rs\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. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-logical-plan/src/ops/sort.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ecf6706d40bb72ff0deb99686f1ba3af33ac834a268eb43d405b489e7d62d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): src/daft-scan/src/expr_rewriter.rs:196-212 | src/daft-scan/src/expr_rewriter.rs:234-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-scan/src/expr_rewriter.rs:196\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-scan/src/expr_rewriter.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"d434e8106bf95753dd0ba15e221133d7f8904990f9e117a8b53d8baf3ca6a8fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/daft-scan/src/python/wrappers.rs:205-221 | src/daft-scan/src/python/wrappers.rs:379-393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-scan/src/python/wrappers.rs:205\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/python/wrappers.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"57eff646fd78736257c165622f84663f10454e8dc65018fce72d144437220a0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): src/daft-recordbatch/src/ops/joins/hash_join.rs:53-68 | src/daft-recordbatch/src/ops/joins/hash_join.rs:153-168 | src/daft-recordbatch/src/ops/joins/hash_join.rs:263-278 | src/daft-recordbatch/src/ops/joins/hash_join.rs:346-361 \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":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db926407e694e96c9e42340e0ce0e2de04a0d5a51f76e360af6f7268464ba2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 3): src/daft-core/src/series/utils/python_fn.rs:53-67 | src/daft-core/src/series/utils/python_fn.rs:85-100 | src/daft-core/src/series/utils/python_fn.rs:146-161 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/series/utils/python_fn.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/utils/python_fn.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef070ad17b2f8e45c7e03e65f238a78f25e183cc7fad2f51d061c2d900ed831c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/daft-avro/src/read.rs:130-145 | src/daft-avro/src/read.rs:161-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-avro/src/read.rs:130\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-avro/src/read.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf75e40adf83229701bcb62025107f56cc6bc4edfe66b5df94eddffc38aec079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/daft-core/src/array/growable/struct_growable.rs:27-42 | src/daft-core/src/array/growable/union_growable.rs:32-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/growable/struct_growable.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ff69895846bd3eea42073737bdef283eda013ec043976dad0e5f1a60fd6b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/daft-core/src/series/from_lit.rs:130-145 | src/daft-core/src/series/from_lit.rs:150-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/series/from_lit.rs:130\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/from_lit.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"40267d7b6f1c852052b1184157b05e7376460e0be1324a46625083a1e7e80522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/daft-distributed/src/pipeline_node/into_batches.rs:147-162 | src/daft-distributed/src/pipeline_node/into_batches.rs:171-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/into_batches.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"067ccc2bcfd6490b38ee8190c2af9cb8a4e2bfa1729d05a69c39297d4733974b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/daft-io/src/object_store_glob.rs:473-488 | src/daft-io/src/object_store_glob.rs:614-626 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/object_store_glob.rs:473\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1ae416222aa407df45644f24491197331f3a2c7a190999e00d9e3a88776751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/daft-io/src/s3_like.rs:1132-1147 | src/daft-io/src/s3_like.rs:1263-1278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":1132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9ab964f7d7a2d93ef71bb1f70489c9c8e21ebd3522f3c5a0a3c07746770125"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): src/daft-local-execution/src/intermediate_ops/udf.rs:520-535 | src/daft-local-execution/src/streaming_sink/async_udf.rs:351-363 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/intermediate_ops/udf.rs\u0060 and \u0060src/daft-local-execution/src/streaming_sink/async_udf.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/intermediate_ops/udf.rs:520\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/udf.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de2d4cc3beb9da307323b32cd02d9c6908f748717c20b1d87fe8f573d715af9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/daft-logical-plan/src/ops/set_operations.rs:180-195 | src/daft-logical-plan/src/ops/set_operations.rs:487-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/ops/set_operations.rs:180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc139207e5cce0f41e83947b7596f9c7899728a44414328507f183f0142e1a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): src/daft-logical-plan/src/ops/udf.rs:51-64 | src/daft-logical-plan/src/ops/window.rs:96-111 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-logical-plan/src/ops/udf.rs:51\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/udf.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"586de36f0cd63cd1d0d3e01350fc9f4078631817b8d986a9a2f230edb2d9709f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/split_udfs.rs:275-290 | src/daft-logical-plan/src/optimization/rules/split_udfs.rs:346-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/split_udfs.rs:275\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-logical-plan/src/optimization/rules/split_udfs.rs:291\u0060 calls \u0060Ok\u0060, \u0060no\u0060 and \u0060src/daft-logical-plan/src/optimization/rules/split_udfs.rs:362\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":"src/daft-logical-plan/src/optimization/rules/split_udfs.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"e584729753001cdd1e522717af4536caf70e5fcafd5a6ce392928fdae6bbff0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): src/daft-local-execution/src/join/inner_join.rs:51-65 | src/daft-local-execution/src/join/left_right_join.rs:55-69 | src/daft-local-execution/src/join/left_right_join.rs:135-149 | src/daft-local-execution/src/join/outer_join.rs:116-130 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/inner_join.rs\u0060 and \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/inner_join.rs:51\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/inner_join.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"03670078fb6665ad2da43dd9bc31286074b24a14328eb87719811159dcfaead6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): src/daft-distributed/src/pipeline_node/sort.rs:526-540 | src/daft-distributed/src/pipeline_node/sort.rs:551-564 | src/daft-distributed/src/pipeline_node/sort.rs:624-637 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/sort.rs:526\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/sort.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca0d316d9c32f4ae529be53af52a1da67463c86eab35d5984195573ebb34276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-algebra/src/simplify/boolean.rs:93-107 | src/daft-algebra/src/simplify/boolean.rs:187-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-algebra/src/simplify/boolean.rs:93\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-algebra/src/simplify/boolean.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0573d97ee1051af496d399e7d380d08ed3ed2bbca5a6386ef792c36156fc8f4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-core/src/array/struct_array.rs:37-51 | src/daft-core/src/array/union_array.rs:40-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-core/src/array/struct_array.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":"src/daft-core/src/array/struct_array.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9e27c889185303e5fb6748a23beb2b3eee18d2cbb453e4e80e576508ee3d5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-distributed/src/pipeline_node/join/cross_join.rs:85-99 | src/daft-distributed/src/pipeline_node/join/cross_join.rs:106-120 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/join/cross_join.rs:85\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-distributed/src/pipeline_node/join/cross_join.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f28b88e45140938e84372f60ad3ed1a8b0a8a2dd216e688841ca511adcc0840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:499-513 | src/daft-functions-list/src/kernels.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 \u0060src/daft-functions-list/src/kernels.rs:499\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"425c51e8ec4f72e8f2119000522578f943418c6adebf78cd74a33d3a14bfcdc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-functions-temporal/src/date_arithmetic.rs:177-191 | src/daft-functions-temporal/src/date_arithmetic.rs:393-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-temporal/src/date_arithmetic.rs:177\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-functions-temporal/src/date_arithmetic.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2301e0f742f1d42968bbe9eb990544a3d8e5d4712a2f4c751fff77449796e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-local-execution/src/join/inner_join.rs:31-45 | src/daft-local-execution/src/join/left_right_join.rs:41-55 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/inner_join.rs\u0060 and \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/inner_join.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-local-execution/src/join/left_right_join.rs:40\u0060 calls \u0060mark_used\u0060 and \u0060src/daft-local-execution/src/join/inner_join.rs:30\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":"src/daft-local-execution/src/join/inner_join.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ca0447fb05dbcb545754f87264b1c1338c7d020ca8207e2b0e3b2c2b5242c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/daft-local-execution/src/join/left_right_join.rs:34-48 | src/daft-local-execution/src/join/outer_join.rs:91-104 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 and \u0060src/daft-local-execution/src/join/outer_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/left_right_join.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e324438301fb502c779b6e62a9eca69f4e9fd489e3973ac3dfc877cf533dcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): src/daft-local-execution/src/sinks/dedup.rs:125-139 | src/daft-local-execution/src/sinks/grouped_aggregate.rs:354-366 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-local-execution/src/sinks/dedup.rs:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/dedup.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccb83fb4b49c3a3e78527501fcffb8b98fa402d0b906c3cfc817d0b0d69d54b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:572-586 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:638-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:572\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"03756506933bcb0cfb7ff83d2cfe5e47725c253d45f8b7f9557016a32e5b1196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/split_udfs.rs:249-263 | src/daft-logical-plan/src/optimization/rules/split_udfs.rs:315-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 \u0060src/daft-logical-plan/src/optimization/rules/split_udfs.rs:249\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/split_udfs.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efe6ab0814433cf5c6dc9d0d45b05ba6e8063db538b83ba61782f90758329cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs:470-484 | src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs:496-510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs:470\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ce56a3503d9a9e697f2cac713fce13d5c54163364d6139d14ff2999c9fcaca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:982-996 | src/daft-recordbatch/src/lib.rs:1360-1371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:982\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060expr\u0060 to \u0060BoundExpr\u0060 in one and \u0060\u0026BoundExpr\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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"480ec0078b5b630214a125e2f7ac70992b3613113ffd3e7ff1aa164768d312fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): src/common/image/src/image.rs:200-213 | src/common/image/src/image.rs:218-231 | src/common/image/src/image.rs:236-249 | src/common/image/src/image.rs:254-267 \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 \u0060src/common/image/src/image.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/image/src/image.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"a232ec897a1913901ef69af310340ee19fad0f715fcf547fc683d0e1e376958e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): src/daft-distributed/src/pipeline_node/actor_udf.rs:258-270 | src/daft-distributed/src/pipeline_node/udf.rs:192-204 | src/daft-logical-plan/src/ops/udf.rs:109-122 \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 \u0060src/daft-distributed/src/pipeline_node/actor_udf.rs:258\u0060 it begins part-way through the construct above it, so those exact lines 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":"src/daft-distributed/src/pipeline_node/actor_udf.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bfff179adc0618df12985c4012a4eddca3dd706417fbc38d37880b19ebb7d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): src/daft-ext-internal/src/aggregate.rs:192-202 | src/daft-ext-internal/src/function.rs:123-134 | src/daft-ext-internal/src/function.rs:165-178 \u2014 before extracting anything, compare \u0060src/daft-ext-internal/src/aggregate.rs\u0060 and \u0060src/daft-ext-internal/src/function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-ext-internal/src/function.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f42eecab10c6be912d4ad384749586cb2bee83bb1b7be8f8fedc0d2e3394a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/daft-local-execution/src/join/join_node.rs:68-81 | src/daft-local-execution/src/sinks/blocking_sink.rs:470-483 | src/daft-local-execution/src/streaming_sink/base.rs:454-467 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/join_node.rs\u0060 and \u0060src/daft-local-execution/src/sinks/blocking_sink.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/join_node.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, \u0060src/daft-local-execution/src/join/join_node.rs:82\u0060 calls \u0060unwrap\u0060 and \u0060src/daft-local-execution/src/sinks/blocking_sink.rs:484\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":"src/daft-local-execution/src/join/join_node.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64e937fd18d9481dcb8f06ae6f7d561fa0c78973cf17e2099d2837db7b53314"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-dsl/src/python_udf/batch.rs:97-110 | src/daft-dsl/src/python_udf/row_wise.rs:93-106 \u2014 before extracting anything, compare \u0060src/daft-dsl/src/python_udf/batch.rs\u0060 and \u0060src/daft-dsl/src/python_udf/row_wise.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/python_udf/batch.rs:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-dsl/src/python_udf/row_wise.rs:109\u0060 calls \u0060clone\u0060 and \u0060src/daft-dsl/src/python_udf/batch.rs:112\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":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d399d91385cd740bb4f100ce58a070f68fc2440912a28f79fc4a31de5862b69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-dsl/src/python_udf/row_wise.rs:130-143 | src/daft-dsl/src/python_udf/row_wise.rs:165-178 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python_udf/row_wise.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e47c8ca44f6536f097ef467a302ab51fa4d131047648eb1763e778d1f260dc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:278-291 | src/daft-functions-list/src/kernels.rs:338-351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/kernels.rs:278\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba5fecf4ae9f1c3e8275eecc93957ef8ecc7d3bbe50b66db100ddc5da08c283"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:1226-1239 | src/daft-functions-list/src/kernels.rs:1260-1273 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/kernels.rs:1226\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"59cb82ebbcc37109db9456ec14d4427ed4eb3c76fba73c64735d7831adf280fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-functions-temporal/src/date_arithmetic.rs:68-81 | src/daft-functions-temporal/src/date_arithmetic.rs:120-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 \u0060src/daft-functions-temporal/src/date_arithmetic.rs:68\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_arithmetic.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9118add2765398bab031731e0459db950611af32594c6d3fa5f39e2b6343de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-functions/src/numeric/log.rs:40-53 | src/daft-functions/src/numeric/log.rs:109-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions/src/numeric/log.rs:40\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/numeric/log.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c262673f3b75d1cd4d5d1aa42da8fe5bb8337d73fa70285c5fb8eb2f9d6d252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-local-execution/src/intermediate_ops/udf.rs:475-488 | src/daft-local-execution/src/streaming_sink/async_udf.rs:317-330 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/intermediate_ops/udf.rs\u0060 and \u0060src/daft-local-execution/src/streaming_sink/async_udf.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/udf.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5284279289209fa07ad1399986faf7e55fbcc8c796db9390983f931e67e7eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-local-execution/src/join/left_right_join.rs:187-200 | src/daft-local-execution/src/join/outer_join.rs:186-199 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 and \u0060src/daft-local-execution/src/join/outer_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"e657b6e7b682dff2fbe753838151063c0a33a4af0b494f422087493bfdd2da8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/daft-local-execution/src/pipeline.rs:650-662 | src/daft-local-execution/src/pipeline.rs:731-744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/pipeline.rs:650\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdec49a32ad49f5cf95e5dc9ec713cadb6865130b9456fe1ab69d903f280a58a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:954-967 | src/daft-recordbatch/src/lib.rs:1339-1351 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:954\u0060 it begins part-way through the construct above it, so those exact lines 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bddfb7c831bc29aac71ce0b02285fedeb74b668a0f5b695a23287c411760b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-recordbatch/src/ops/joins/hash_join.rs:38-51 | src/daft-recordbatch/src/ops/joins/hash_join.rs:331-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/joins/hash_join.rs:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc7430bb9b403f3ad5b90201f50c7e55e5d56984ef8454e85348a3fae515639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-recordbatch/src/ops/joins/hash_join.rs:102-115 | src/daft-recordbatch/src/ops/joins/hash_join.rs:221-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/joins/hash_join.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":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"7658f1018df55263ae348b715db799ff8b76f1d363d01e52a35445b257123f49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): src/daft-file/src/functions.rs:123-135 | src/daft-file/src/functions.rs:217-229 | src/daft-file/src/functions.rs:310-321 | src/daft-file/src/functions.rs:402-413 \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 \u0060src/daft-file/src/functions.rs:123\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-file/src/functions.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b4b473dd2ece8117ac509ec385ac64cb80b987e6aec89c35bdf1a82dd79096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): src/daft-functions-utf8/src/regexp_extract.rs:86-97 | src/daft-functions-utf8/src/repeat.rs:88-100 | src/daft-functions-utf8/src/replace.rs:132-143 | src/daft-functions-utf8/src/translate.rs:83-94 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/regexp_extract.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2622f59cd270beceb6a601d3db5f22d6bc2b1ddea38da5b570a3c39c9cd97ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): src/daft-writers/src/avro_writer.rs:150-162 | src/daft-writers/src/batch_file_writer.rs:120-131 | src/daft-writers/src/parquet_writer.rs:445-456 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/daft-writers/src/avro_writer.rs:150\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/avro_writer.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b13d215e72c8d95eea440f32940598aafda649928aa242a38668cb6d4e8f270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/common/macros/src/function_args.rs:360-378 | src/common/macros/src/function_args.rs:384-402 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/common/macros/src/function_args.rs:360\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/macros/src/function_args.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe939c40c72c670b077d51c04b7626dac32fc9ebc14aa21dbcc49099f0df72a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/daft-core/src/kernels/search_sorted.rs:128-140 | src/daft-core/src/kernels/search_sorted.rs:297-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/kernels/search_sorted.rs:128\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/kernels/search_sorted.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbea13617c7ef72da2850a4aeedb8d2dd634ace858e35342b13cf782cc44db33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/daft-csv/src/local.rs:628-639 | src/daft-warc/src/lib.rs:598-610 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-warc/src/lib.rs:598\u0060 it begins part-way through the construct above it, so those exact lines 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":"src/daft-csv/src/local.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"7012acf9908db5792eef930462f959d7a9e09b3da7de86a79caf143bf9684426"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-csv/src/metadata.rs:252-264 | src/daft-csv/src/metadata.rs:276-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/metadata.rs:252\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/metadata.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d76a2a55c1345e27e4f815d2568bf48a494c3cfe4bd5a54264272164b968121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-csv/src/read.rs:209-221 | src/daft-parquet/src/read.rs:194-206 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-parquet/src/read.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:209\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bb1f8b23b60ae3f4822caa39d070cd2c3118d2922905c824ceb81aab21f6fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/daft-distributed/src/pipeline_node/join/asof_join.rs:152-163 | src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:144-156 \u2014 before extracting anything, compare \u0060src/daft-distributed/src/pipeline_node/join/asof_join.rs\u0060 and \u0060src/daft-distributed/src/pipeline_node/join/sort_merge_join.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 \u0060src/daft-distributed/src/pipeline_node/join/asof_join.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":"src/daft-distributed/src/pipeline_node/join/asof_join.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"877193d555f74291d463e21c105f46ca6d8285290ec67b11540e01d0aef46814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/daft-distributed/src/pipeline_node/sort.rs:664-676 | src/daft-distributed/src/pipeline_node/top_n.rs:86-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/sort.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-distributed/src/pipeline_node/sort.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4d307cbe355b65540a06f7ffcd13d0f5fb9822ed8a55e0f069078265bf00ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/daft-distributed/src/scheduling/scheduler/default.rs:122-132 | src/daft-distributed/src/scheduling/scheduler/linear.rs:111-123 \u2014 before extracting anything, compare \u0060src/daft-distributed/src/scheduling/scheduler/default.rs\u0060 and \u0060src/daft-distributed/src/scheduling/scheduler/linear.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/scheduling/scheduler/default.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":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"13344092eb9a3570254d3467c268265541aab40d27a22956c4917059cb6a7cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-ext-macros/src/lib.rs:125-137 | src/daft-ext-macros/src/lib.rs:301-313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-ext-macros/src/lib.rs:125\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-ext-macros/src/lib.rs:123\u0060 calls \u0060Some\u0060, \u0060parse\u0060 and \u0060src/daft-ext-macros/src/lib.rs:301\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":"src/daft-ext-macros/src/lib.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"c05ab92e9bddeb310e42bca5750ac543bef62f91ff1c5875a9fea9ebaf09935a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-functions-utf8/src/regexp_extract_all.rs:95-107 | src/daft-functions-utf8/src/split.rs:111-123 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"src/daft-functions-utf8/src/regexp_extract_all.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d895ea96e5b8e79a2835126c7b8a8ef224a4385539060cc6b2f2126d4d622c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-functions-utf8/src/split_part.rs:102-114 | src/daft-functions-utf8/src/substring_index.rs:100-112 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/split_part.rs:102\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"985dd7abbca42715e9e50c1329b63d962a043148fa92b5342252657867cb25b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-io/src/azure_blob.rs:857-869 | src/daft-io/src/azure_blob.rs:906-918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"955280fbb5a418e2822294a01a6a08281df9fdff58bf6d6fa84df7c241bd1843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-io/src/object_store_glob.rs:448-460 | src/daft-io/src/object_store_glob.rs:584-596 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/object_store_glob.rs:448\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f890e6636944e37e6fedecf63029a32558df3863342fe4dd1e9151b43032843"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/daft-io/src/object_store_glob.rs:524-535 | src/daft-io/src/object_store_glob.rs:630-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/object_store_glob.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":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b93263233748724136901838afd6793d91fe2e00156fcb132d95c19f6aca6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/daft-local-execution/src/join/inner_join.rs:26-38 | src/daft-local-execution/src/join/left_right_join.rs:111-122 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/inner_join.rs\u0060 and \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/inner_join.rs:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/inner_join.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c959197b225322e9754fcbc7852ebb5bdbb97aeb28a131b24d4ca8535bd80917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): src/daft-local-execution/src/join/inner_join.rs:73-85 | src/daft-local-execution/src/join/outer_join.rs:147-157 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/inner_join.rs\u0060 and \u0060src/daft-local-execution/src/join/outer_join.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 41 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/inner_join.rs:73\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/inner_join.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c511051df976603386d03cc803ea55cdf67ba39b3694c7a0a6e5cc1cfd498e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-local-execution/src/join/probe.rs:237-249 | src/daft-local-execution/src/join/probe.rs:288-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/probe.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":"src/daft-local-execution/src/join/probe.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede6aeb3d2fd109aaae0297dc6c95e393ea25b181ef1bec09a0efbc65112a163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-local-execution/src/sources/scan_task.rs:404-416 | src/daft-micropartition/src/micropartition.rs:493-505 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec2a09d3666a32e09983c9c939c3b74975651576556ab40bce34650872a74fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-logical-plan/src/builder/mod.rs:1035-1047 | src/daft-logical-plan/src/builder/mod.rs:1109-1121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"399d6a107d5ce9b75fe43ae91f0cbac78b11782772c5446ba57f7d97bd1df4a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:213-225 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:241-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:213\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:240\u0060 calls \u0060clone\u0060 and \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:212\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":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"951a263e619c62bcc4e3d81dbfec3e327ede191c6f980e2864ce4024cef7cd02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:302-314 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:338-347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.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":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c1bc8cc84494c3be44e868d6384e46a8cee01dcd06f855564f9c03c745faf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs:125-137 | src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs:343-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1076b5f8fe5a0ce5f1128d49867f64a339db7d038b1779d58b4f966039f2cf60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-parquet/src/reader/rg_processor.rs:127-139 | src/daft-parquet/src/reader/rg_processor.rs:229-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-parquet/src/reader/rg_processor.rs:127\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/reader/rg_processor.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"477b5a8b220a4035f840b769f2edad39df9ad999355ff10a4d8a18caf734e9f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-scan/src/expr_rewriter.rs:182-194 | src/daft-scan/src/expr_rewriter.rs:220-232 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-scan/src/expr_rewriter.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":"src/daft-scan/src/expr_rewriter.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8954dde18ed12cd60ff12305e835a5675ca45a012210567f7767a4bbff79f00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): src/daft-file/src/functions.rs:97-108 | src/daft-file/src/functions.rs:191-202 | src/daft-file/src/functions.rs:285-295 | src/daft-file/src/functions.rs:377-387 \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 \u0060src/daft-file/src/functions.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":"src/daft-file/src/functions.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab87a60bc55106e8e848c0d0558daa2eaa8296c38514db3b640e6cb8ad1ac04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/daft-sql/src/modules/config.rs:126-137 | src/daft-sql/src/modules/config.rs:210-221 | src/daft-sql/src/modules/config.rs:287-298 | src/daft-sql/src/modules/config.rs:422-433 \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 \u0060src/daft-sql/src/modules/config.rs:126\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/config.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"18685b5ce6fffd9419fb4744abd6b66e82c2d28adfa9509000d36d3793bd62e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): src/daft-writers/src/pyarrow.rs:31-42 | src/daft-writers/src/pyarrow.rs:88-99 | src/daft-writers/src/pyarrow.rs:138-149 | src/daft-writers/src/pyarrow.rs:180-191 \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":"src/daft-writers/src/pyarrow.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"aadd6c9ceefbe015d14a23b1e4ca6892c3a380b8d55faa67f3958ab1b8232b6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/daft-distributed/src/pipeline_node/aggregate.rs:196-207 | src/daft-distributed/src/pipeline_node/aggregate.rs:209-220 | src/daft-local-execution/src/sinks/grouped_aggregate.rs:280-291 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/aggregate.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d034e5293d28e195a18827c4e7f421b282912af7f154e2c8cdb352de4f2b6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/daft-distributed/src/pipeline_node/window.rs:111-122 | src/daft-distributed/src/pipeline_node/window.rs:162-173 | src/daft-distributed/src/pipeline_node/window.rs:209-220 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-distributed/src/pipeline_node/window.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"0221386a5231bffcb9abcd7abda42812630d70e76d49a829498546c738147343"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/daft-functions-temporal/src/epoch_conversions.rs:68-79 | src/daft-functions-temporal/src/epoch_conversions.rs:110-121 | src/daft-functions-temporal/src/epoch_conversions.rs:151-162 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-functions-temporal/src/epoch_conversions.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4d192edb4ebbbc09e9f3309c6f7793b9ced1c36c8375f211a60558402ea69a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/daft-local-execution/src/join/probe.rs:244-255 | src/daft-local-execution/src/join/probe.rs:295-306 | src/daft-local-execution/src/join/probe.rs:377-388 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/probe.rs:244\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/probe.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"7720c78285a2ef8e4faa639c18982f5a633e1dc598d8dc5e04812f7bdceae0e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs:306-317 | src/daft-logical-plan/src/optimization/rules/push_down_filter.rs:467-478 | src/daft-logical-plan/src/optimization/rules/push_down_limit.rs:296-307 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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, \u0060src/daft-logical-plan/src/optimization/rules/push_down_limit.rs:295\u0060 calls \u0060Shuffle\u0060 and \u0060src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs:305\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":"src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bb0f1efa6939a75d42f9a9151f3fc56a9b8ff6db50452407e6a535e02c970a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:182-191 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:214-225 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:242-253 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:182\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:240\u0060 calls \u0060clone\u0060 and \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:212\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":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e217a3aa7641c3de43ca586036d3f12d472fff9dc7e256726be9e43615af8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/common/image/src/image.rs:272-285 | src/common/image/src/image.rs:290-303 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/common/image/src/image.rs:272\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/image/src/image.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f247b9ea9ba7cc6ac1baa64acabd7119e92fe6e852e743a6131598256cdd9261"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-csv/src/local.rs:316-327 | src/daft-csv/src/read.rs:575-586 \u2014 before extracting anything, compare \u0060src/daft-csv/src/local.rs\u0060 and \u0060src/daft-csv/src/read.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/local.rs:316\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/local.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c30f3e1411264ae373b9446d136ebbf742eca27bbd18914dad197b07565ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-csv/src/read.rs:226-237 | src/daft-parquet/src/read.rs:211-222 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-parquet/src/read.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"3737b85f47a873a1a610b491a25db0cd1335d7124d99bd60a58f76ee2d3a37d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-dashboard/src/engine.rs:701-712 | src/daft-dashboard/src/engine.rs:721-732 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cca018f53ae70f75702c701f8317f946f9450720a3e2dc4bedaa52143929bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-distributed/src/pipeline_node/join/asof_join.rs:688-699 | src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:283-294 \u2014 before extracting anything, compare \u0060src/daft-distributed/src/pipeline_node/join/asof_join.rs\u0060 and \u0060src/daft-distributed/src/pipeline_node/join/sort_merge_join.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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/join/asof_join.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"050775f29487085fb62b5ba7bd44c5b1d114a17e9bcf6844f3beaf33f6eaf34a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:327-338 | src/daft-distributed/src/pipeline_node/join/key_filtering_join.rs:356-367 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:327\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/join/broadcast_join.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ea1b5b416dc58165098e48c9fc045c34ede50d241b922ed9f2a11798bc52eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-dsl/src/python_udaf.rs:83-94 | src/daft-dsl/src/python_udaf.rs:116-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/python_udaf.rs:83\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-dsl/src/python_udaf.rs:80\u0060 calls \u0060as_ref\u0060 and \u0060src/daft-dsl/src/python_udaf.rs:113\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":"src/daft-dsl/src/python_udaf.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b3378a662b31acb4a2902c42fcdb0c46dfb2f0fd27c3d5e2e6b412c2aa9fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:478-489 | src/daft-functions-list/src/kernels.rs:890-900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/kernels.rs:478\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d36822bc524c7e8af32902e998545a25ebd9f9befe1857dcbcb7e6391f666c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-functions-utf8/src/chr.rs:32-43 | src/daft-functions-utf8/src/space.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 \u0060src/daft-functions-utf8/src/chr.rs:32\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/chr.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e162dc42289c3eaa768993f494bfa27ff3792ee3ec9f036dcbad46ada298b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-functions-utf8/src/damerau_levenshtein.rs:10-21 | src/daft-functions-utf8/src/levenshtein.rs:9-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/damerau_levenshtein.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8e2a7a10e0f6db8ead61dbbe9780f094c6716f1e7267ba7813df58be4de282"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-functions-utf8/src/split_part.rs:116-127 | src/daft-functions-utf8/src/substring_index.rs:114-125 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/split_part.rs:116\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ea21feb0ee05ff619809fd16093006ad0bfb714dbafcdf0520f4afa148b5ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-functions-utf8/src/split_part.rs:136-149 | src/daft-functions-utf8/src/substring_index.rs:133-146 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/split_part.rs:136\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93f8f85a70a71b98ffc3f5940bfe432f16bbfebf5a11e25538c85d532ac70b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-image/src/functions/decode.rs:45-56 | src/daft-image/src/functions/decode_image_file.rs:49-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-image/src/functions/decode.rs:45\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-image/src/functions/decode.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56e03c94b15792d5204a8de3334dd4962fa919afb979e07edf71c79bb80befd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/daft-io/src/google_cloud.rs:271-282 | src/daft-io/src/google_cloud.rs:302-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":"src/daft-io/src/google_cloud.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceff25e56da0cefe22f20fa4173e96fded36a19692d4990fcf54ebae6488aa35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-io/src/gravitino.rs:99-110 | src/daft-io/src/unity.rs:79-90 \u2014 before extracting anything, compare \u0060src/daft-io/src/gravitino.rs\u0060 and \u0060src/daft-io/src/unity.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/gravitino.rs:99\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/gravitino.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"df0964d0bcd871e162eaf5e8b7236f5dfc2f50041df19f0f87aa6e11f68cfd3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-io/src/gravitino.rs:133-144 | src/daft-io/src/unity.rs:113-124 \u2014 before extracting anything, compare \u0060src/daft-io/src/gravitino.rs\u0060 and \u0060src/daft-io/src/unity.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/gravitino.rs:133\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/gravitino.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa95c527877669c5d83617e40a4a20f140b5b3fc98f9474c889ca26d8fbe75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/daft-local-execution/src/intermediate_ops/explode.rs:36-47 | src/daft-local-execution/src/runtime_stats/values.rs:58-68 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/daft-local-execution/src/intermediate_ops/explode.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fd47361746c9db3f3f9279e7eba9467bb57cba14520122be6c2d95fb858e76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-local-execution/src/join/outer_join.rs:67-78 | src/daft-local-execution/src/join/outer_join.rs:173-184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/outer_join.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa3aee4e3155c177b1049ab5b16b0d8880026bb9591cf09442ffa634eb51b28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/filter_null_join_key.rs:114-125 | src/daft-logical-plan/src/optimization/rules/filter_null_join_key.rs:126-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/filter_null_join_key.rs:114\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/filter_null_join_key.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"12369f35804e46bd763a07ef8335d52c003691012c4ba2672b71a8b8ee250f98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-micropartition/src/ops/partition.rs:42-53 | src/daft-micropartition/src/ops/partition.rs:60-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/ops/partition.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"764a539b7662926ac8651d5dc22110f2d866e1e9a7d5c7e22552e7d0cb6fbf3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:896-907 | src/daft-recordbatch/src/lib.rs:1304-1314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:896\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"acaf37322c20f9999e2acd6cbb35a137fb99558b052511214317b70ddbb58200"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:1044-1070 | src/daft-recordbatch/src/lib.rs:1391-1416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:1044\u0060 it begins part-way through the construct above it, so those exact lines 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1044}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa5220dc0b96c0e902656cf1dcf6b70f7f4e7b6b857bcd1d7ab3cbb55b1fb5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): src/daft-schema/src/dtype.rs:191-199 | src/daft-schema/src/dtype.rs:230-241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-schema/src/dtype.rs:230\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-schema/src/dtype.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"9174d41a20cffecaade1546a1a12c1ac24fcfc9cf5c4dc1a0d83d3cc734dca4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-sql/src/planner.rs:658-670 | src/daft-sql/src/planner.rs:806-817 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-sql/src/planner.rs:806\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5e0c6efb0d7b9fc816186ff4bb22647ac583b00aa7bb0bae3b569c395bc71e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 5): src/daft-core/src/array/ops/broadcast.rs:63-73 | src/daft-core/src/array/ops/broadcast.rs:90-99 | src/daft-core/src/array/ops/broadcast.rs:111-120 | src/daft-core/src/array/ops/broadcast.rs:134-143 | src/daft-core/src/array/ops/broadcast.rs:157-166 \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 \u0060src/daft-core/src/array/ops/broadcast.rs:63\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-core/src/array/ops/broadcast.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf9a237700469c6432eb1d19d91a8266d6b443813d62ac47c76cfec2c506dd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): src/daft-distributed/src/pipeline_node/explode.rs:62-72 | src/daft-distributed/src/pipeline_node/filter.rs:62-72 | src/daft-distributed/src/pipeline_node/stage_checkpoint_keys.rs:97-107 | src/daft-distributed/src/pipeline_node/udf.rs:60-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/explode.rs:62\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-distributed/src/pipeline_node/explode.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2986051f3985e6cc70d3dd37503e7967aec564d2284ed7c19e293bf57efe039"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/daft-json/src/local.rs:153-163 | src/daft-json/src/local.rs:173-183 | src/daft-json/src/local.rs:365-375 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-json/src/local.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c3ee097843e825de3d5cdd1d7e65746184232081cd0ccf2524153044b9b577"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/daft-local-execution/src/join/join_node.rs:98-108 | src/daft-local-execution/src/sinks/blocking_sink.rs:499-509 | src/daft-local-execution/src/streaming_sink/base.rs:484-494 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/join_node.rs\u0060 and \u0060src/daft-local-execution/src/sinks/blocking_sink.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/join_node.rs:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/join_node.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"e053aff9fef0e1febb45cff674073e0b049f77e31e48b89c53af156172a3d5b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:105-115 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:96-106 | src/daft-local-execution/src/sinks/window_partition_only.rs:82-92 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs\u0060 and \u0060src/daft-local-execution/src/sinks/window_partition_and_order_by.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:105\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5fb3a5dcda2a0f0c27651fc56aa46fb25e488a54358f3086b5d8f557874aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs:246-256 | src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs:262-272 | src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs:288-298 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs:246\u0060 it does not close everything it opens, so those exact 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":"src/daft-logical-plan/src/optimization/rules/push_down_anti_semi_join.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41685898f18ff81dc951c7a569f42010a6a06169decb77a03d210d9efaad65c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:553-563 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:581-591 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:647-657 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:553\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf5cb4cefc7fe2f2b877d06140e644281cc47b39959f3a00972897be727521f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/common/image/src/image.rs:65-75 | src/common/image/src/image.rs:77-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/image/src/image.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bf86f956609c471acd99ab7228e2ce9cf3bafee6c2c03c5b8619a86cba3b3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-core/src/array/growable/python_growable.rs:30-41 | src/daft-core/src/array/growable/struct_growable.rs:45-55 \u2014 before extracting anything, compare \u0060src/daft-core/src/array/growable/python_growable.rs\u0060 and \u0060src/daft-core/src/array/growable/struct_growable.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 \u0060src/daft-core/src/array/growable/python_growable.rs:30\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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, \u0060src/daft-core/src/array/growable/python_growable.rs:42\u0060 calls \u0060with_capacity\u0060 and \u0060src/daft-core/src/array/growable/struct_growable.rs:56\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":"src/daft-core/src/array/growable/python_growable.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5facf96e2c7ad5bc32307d518d909b430bfafe0a302181da4a46c5c174b798"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-core/src/array/serdes.rs:144-154 | src/daft-core/src/array/serdes.rs:196-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/serdes.rs:144\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/serdes.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d14d75575f3e41d1aad89d0140a2fe452546b7cf38a5d6dd9d4bdb96e5753aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-csv/src/read.rs:116-126 | src/daft-warc/src/lib.rs:459-469 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-warc/src/lib.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.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":"src/daft-csv/src/read.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbedca275445c8d493dbc27b6c474776b88d58a48117d99cd8a73b7744425472"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-decoding/src/deserialize.rs:155-165 | src/daft-decoding/src/deserialize.rs:173-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-decoding/src/deserialize.rs:155\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-decoding/src/deserialize.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f7132394a50f1f6b27e4cabb5328f3471d7aaf5d60f421d671f547d081f197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-distributed/src/pipeline_node/filter.rs:38-48 | src/daft-local-execution/src/intermediate_ops/filter.rs:48-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/filter.rs:38\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/filter.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"214edecb0a1d4b3bf89a83eecc2c92247db3525aacb625c22da38fedb971f630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/daft-distributed/src/pipeline_node/sink.rs:311-321 | src/daft-logical-plan/src/ops/sink.rs:109-118 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-distributed/src/pipeline_node/sink.rs:311\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-distributed/src/pipeline_node/sink.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"52b48f5bf9fc0847a4b41b6725cac2ffd0b20a953aba33822e1752ff094191f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-dsl/src/python_udaf.rs:71-81 | src/daft-dsl/src/python_udaf.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 \u0060src/daft-dsl/src/python_udaf.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-dsl/src/python_udaf.rs:82\u0060 calls \u0060as_ref\u0060 and \u0060src/daft-dsl/src/python_udaf.rs:116\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":"src/daft-dsl/src/python_udaf.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ce90ca052d7d0adf7df02436b827dde6ec340e358c434179277b2479c34ae1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-functions/src/distance/cosine.rs:9-19 | src/daft-functions/src/similarity/cosine.rs:9-19 \u2014 \u0060src/daft-functions/src/distance/cosine.rs\u0060 and \u0060src/daft-functions/src/similarity/cosine.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 31 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":"src/daft-functions/src/distance/cosine.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"db18a6e8ce3fba2c375630e57d65c78ad03b625970aa3f140ee52f0c6f46697e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-functions/src/similarity/bitwise_hamming.rs:119-129 | src/daft-functions/src/similarity/bitwise_hamming.rs:169-179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions/src/similarity/bitwise_hamming.rs:119\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/similarity/bitwise_hamming.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d5b92d3ebf8a29c0f79d93006d4f22b82b5b9d06c4a9d1dbf7c80f028cdf3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/daft-io/src/azure_blob.rs:548-557 | src/daft-io/src/azure_blob.rs:809-819 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/azure_blob.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":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"0081e9dc4e81122087acddd557fdb71c22b77bc25b616f8ec14a515fa6463009"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-local-execution/src/join/left_right_join.rs:177-187 | src/daft-local-execution/src/join/left_right_join.rs:226-236 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6cb7946471bb45c5f36b604599a29b1f619a8a6104d5609d0e397a075a111a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-logical-plan/src/ops/asof_join.rs:199-209 | src/daft-logical-plan/src/ops/join.rs:305-315 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-logical-plan/src/ops/asof_join.rs:199\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/asof_join.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"50de5b1141ff43416a46f5ab91eeabd29d9d238ee39ef2fd96da06c9d5eb2ee4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-micropartition/src/python.rs:341-351 | src/daft-recordbatch/src/python.rs:120-130 \u2014 before extracting anything, compare \u0060src/daft-micropartition/src/python.rs\u0060 and \u0060src/daft-recordbatch/src/python.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-micropartition/src/python.rs:341\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"54a1ab2604bcdc2733e51b83ce52d076528402a9d93f112b7e8afc2e20652106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:296-306 | src/daft-recordbatch/src/ops/inline_agg.rs:359-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c458d65a0918d8f335d03c49d1cfb5a34cb5fd305b04a96e187e09bb29dc86b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-recordbatch/src/ops/window_states/sum.rs:67-77 | src/daft-recordbatch/src/ops/window_states/sum.rs:89-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/window_states/sum.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/window_states/sum.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0cc57a196f0c8735bd8e8de6ffc160e5daaf69bf413a9bca892fac94e0c41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-scan/src/python.rs:887-897 | src/daft-scan/src/python.rs:936-946 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-scan/src/python.rs:887\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/python.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db89bc5858c9340f70137a25e508bd2c61b1742e7b4c261d78a5cdc9f604b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/daft-sql/src/modules/partitioning.rs:41-50 | src/daft-sql/src/modules/partitioning.rs:68-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-sql/src/modules/partitioning.rs:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/partitioning.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"49587fcce81fb79efb2fa4002359c37434982f18470d3fdc9ec88e60f8950677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:331-339 | src/daft-local-execution/src/join/join_node.rs:78-86 | src/daft-local-execution/src/sources/source.rs:203-212 | src/daft-local-execution/src/streaming_sink/base.rs:464-472 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/join_node.rs\u0060 and \u0060src/daft-local-execution/src/streaming_sink/base.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:331\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/intermediate_op.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66994ea1d534ee03aa2f046deb164d8b3f87499d9c6aab864a70c4bff43ca84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/daft-core/src/array/growable/fixed_size_list_growable.rs:37-46 | src/daft-core/src/array/growable/python_growable.rs:30-40 | src/daft-core/src/array/growable/struct_growable.rs:45-54 \u2014 before extracting anything, compare \u0060src/daft-core/src/array/growable/python_growable.rs\u0060 and \u0060src/daft-core/src/array/growable/struct_growable.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 \u0060src/daft-core/src/array/growable/fixed_size_list_growable.rs:37\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-core/src/array/growable/python_growable.rs:42\u0060 calls \u0060with_capacity\u0060 and \u0060src/daft-core/src/array/growable/struct_growable.rs:56\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":"src/daft-core/src/array/growable/fixed_size_list_growable.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"328705a23bcf4c921880d03ecce047382d943ab32b6abf442728c96d41e01c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/daft-ext/src/abi/arrow.rs:68-77 | src/daft-ext/src/abi/arrow.rs:87-96 | src/daft-ext/src/abi/arrow.rs:106-115 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-ext/src/abi/arrow.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"40fbbbe1bd443f60bcc165315ce650f4289aea8e5a29de8082167ed7932dee18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/daft-ext/src/abi/arrow.rs:215-224 | src/daft-ext/src/abi/arrow.rs:234-243 | src/daft-ext/src/abi/arrow.rs:253-262 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-ext/src/abi/arrow.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"527e56eb12643b5e9e0b1928846ad479066aab2d918d7c1d59d00e8a6f916b1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/daft-io/src/object_store_glob.rs:491-500 | src/daft-io/src/object_store_glob.rs:523-532 | src/daft-io/src/object_store_glob.rs:559-568 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/object_store_glob.rs:491\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaee7e0bc01975c37bc2f140f51fc4a5194c90b00c5c546612528de5a1459f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 3): src/daft-local-plan/src/plan.rs:199-208 | src/daft-local-plan/src/plan.rs:252-259 | src/daft-local-plan/src/plan.rs:302-309 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-plan/src/plan.rs:199\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fed9c6597042832ce879047c1fedcba8b55212065492eb81f85fb3983cd5791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/daft-recordbatch/src/ops/inline_agg.rs:1049-1058 | src/daft-recordbatch/src/ops/inline_agg.rs:1077-1086 | src/daft-recordbatch/src/ops/inline_agg.rs:1223-1232 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1049\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1974ddd145ef90f9999422cc5e9bc34691ab72b77dadad41fefdc136d17a665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/daft-scan/src/python.rs:92-102 | src/daft-scan/src/python.rs:887-896 | src/daft-scan/src/python.rs:936-945 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-scan/src/python.rs:92\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/python.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"837a152a36d125bb4b25d4d52e9318d43b7d3ea21dbfd047c9ca1c0520f8710c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/common/io-config/src/python.rs:1967-1976 | src/common/io-config/src/python.rs:2245-2254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/common/io-config/src/python.rs:1967\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/python.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0470997d3e47db1d5a58b8383b8397668e83fdf65e684414480a5ea8f2c48b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-algebra/src/simplify/numeric.rs:49-59 | src/daft-algebra/src/simplify/numeric.rs:70-80 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-algebra/src/simplify/numeric.rs:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-algebra/src/simplify/numeric.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce99289306fe47ca2dedf177483eb1cc52389fad379cdf3f8f57b38a474d6f38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-catalog/src/python/wrappers.rs:95-104 | src/daft-catalog/src/python/wrappers.rs:164-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-catalog/src/python/wrappers.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f88e95bc4dfde08d7f217fa20d9c83b3c025c1ff1c2e4895e4a069dc079f1df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-core/src/array/ops/compare_agg.rs:123-132 | src/daft-core/src/array/ops/compare_agg.rs:182-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/ops/compare_agg.rs:123\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/compare_agg.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"9efc1992aaaa7d020025d18f8d74db3d8d70016fb61afa30d5ba582da0aeaf75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-core/src/array/ops/comparison.rs:389-399 | src/daft-core/src/array/ops/comparison.rs:497-507 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/ops/comparison.rs:389\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060lhs\u0060 to \u0060Option\u003CSeries\u003E\u0060 in one and \u0060\u0026StructArray\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":"src/daft-core/src/array/ops/comparison.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"79fa721d7ff3985eb5b1ce6fc0b8b3ff861f8ecf03ac1f50e9afa10a5d1073fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-core/src/series/ops/arithmetic.rs:175-184 | src/daft-core/src/series/ops/arithmetic.rs:273-282 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/series/ops/arithmetic.rs: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":"src/daft-core/src/series/ops/arithmetic.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b1c0d90bb9afa3733d8f89565c200553bc30fa20c961427db1685cd02d6dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-csv/src/local.rs:233-242 | src/daft-csv/src/read.rs:744-753 \u2014 before extracting anything, compare \u0060src/daft-csv/src/local.rs\u0060 and \u0060src/daft-csv/src/read.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-csv/src/local.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9c446ddd760d2edcefdf7470bcc9622d33362236c6a1dbf6d0b45a5f2e31a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/daft-csv/src/read.rs:121-136 | src/daft-csv/src/read.rs:412-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-csv/src/read.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"005502ea8c6dd5cb1aabff05aaa3492f8779b2c966da51fa0301bd16523a7ac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-csv/src/read.rs:244-253 | src/daft-parquet/src/read.rs:229-238 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-parquet/src/read.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:244\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddd0a518f0f976eeb4b307e0208af8b9d8e9b8b997f7cd42331cef42b64c9ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-ext/src/abi/arrow.rs:126-135 | src/daft-ext/src/abi/arrow.rs:147-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext/src/abi/arrow.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb48575091a895f1bbd301c85034e2013687bf0d3ce24bfd06271567e527c96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-ext/src/abi/arrow.rs:273-282 | src/daft-ext/src/abi/arrow.rs:294-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":"src/daft-ext/src/abi/arrow.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2d4bb0b64d5b3c610c376c4d01951a86e61d3b783c96b7c291b104b29d5814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-ext/src/aggregate.rs:66-75 | src/daft-ext/src/function.rs:55-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-ext/src/aggregate.rs:66\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext/src/aggregate.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36074ecd5ca625c6083b1779567a1ba5e3e69635f2cad2a6a186041e18020c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-functions-temporal/src/date_navigation.rs:55-64 | src/daft-functions-temporal/src/date_navigation.rs:137-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-temporal/src/date_navigation.rs:55\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_navigation.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d249f5770c51b1281fea871dd24391a72de8c49513e38bc9861d1d4526cbf5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-functions-utf8/src/hamming.rs:84-93 | src/daft-functions-utf8/src/utils.rs:327-336 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-functions-utf8/src/hamming.rs:84\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/hamming.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f4373253f97ce36b527d6bc8e8f2f7938ba817c4be4dd48f3baca1d37b7254"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): src/daft-image/src/functions/resize.rs:59-77 | src/daft-image/src/functions/resize.rs:84-102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-image/src/functions/resize.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-image/src/functions/resize.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e829967dac4a0a2aed220c4c6277373404323e802d2c70a37f38ac01d3ae88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-io/src/azure_blob.rs:941-950 | src/daft-io/src/google_cloud.rs:253-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/azure_blob.rs:941\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb01ed20b95c3885084360bc66a10f950e9f8cf8c0e07173a68eef582c7957b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-io/src/google_cloud.rs:567-576 | src/daft-io/src/http.rs:314-323 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060config\u0060 to \u0060\u0026GCSConfig\u0060 in one and \u0060\u0026HTTPConfig\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":"src/daft-io/src/google_cloud.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac400bc395076d1f98f605e1db089aab0a2bd3ad7e61b70c9581271f666bd14e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/daft-io/src/gravitino.rs:115-130 | src/daft-io/src/unity.rs:95-110 \u2014 before extracting anything, compare \u0060src/daft-io/src/gravitino.rs\u0060 and \u0060src/daft-io/src/unity.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/gravitino.rs:115\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/gravitino.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"294bd3c6a9de197c1280a51ca3a0d0d0134d7ab903386f229ff5359d92b92f26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): src/daft-io/src/http.rs:430-437 | src/daft-io/src/huggingface/mod.rs:381-390 \u2014 before extracting anything, compare \u0060src/daft-io/src/http.rs\u0060 and \u0060src/daft-io/src/huggingface/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/http.rs:430\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/http.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa09ea0836b45c4aa9f34f5befb77d31f9c08a3d4dcf7dc2e584bd655557a023"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): src/daft-io/src/multipart.rs:45-54 | src/daft-io/src/multipart.rs:84-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/multipart.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/multipart.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8cbb0dce5cee507a1c3b5f85e0794f74a6e899e75255e145937db66433fd3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-json/src/local.rs:140-149 | src/daft-json/src/local.rs:354-363 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-json/src/local.rs:140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/local.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb8ac9929733371904aa944c20fe205fa7846880552ec7b58ba6b1cc8a15290"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-local-execution/src/join/anti_semi_join.rs:92-101 | src/daft-local-execution/src/join/outer_join.rs:37-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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/anti_semi_join.rs:92\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/anti_semi_join.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ebc62b38a609864f3d0dbcce5406e434c48a5808c75a6a3288a229aadcc0f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-local-execution/src/pipeline.rs:1433-1442 | src/daft-local-execution/src/pipeline.rs:1520-1529 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/pipeline.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-local-execution/src/pipeline.rs:1432\u0060 calls \u0060clone\u0060 and \u0060src/daft-local-execution/src/pipeline.rs:1519\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":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"136c996d0efd7721cdcdbf2174cba93f3eaf1c1f41541a3a9006d9813ccce4e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/daft-local-execution/src/sinks/sort.rs:85-94 | src/daft-local-execution/src/sinks/top_n.rs:124-132 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/sort.rs:85\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-local-execution/src/sinks/sort.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e276ae18a722b88fb1a966e03a7bb9cb0d954def1406cc5c636867b4e4f7f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-local-execution/src/sinks/sort.rs:120-129 | src/daft-logical-plan/src/ops/sort.rs:89-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/sort.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-logical-plan/src/ops/sort.rs:99\u0060 calls \u0060Materialized\u0060, \u0060push\u0060 and \u0060src/daft-local-execution/src/sinks/sort.rs:130\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":"src/daft-local-execution/src/sinks/sort.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"318a79a4a119a7335df682f1ed534fb73c66221278eba70a5a9f07d8ba389bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-local-execution/src/sinks/window_order_by_only.rs:198-207 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:290-299 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-local-execution/src/sinks/window_order_by_only.rs:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/window_order_by_only.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95c55a838eb8c6db87db59cd3312905bc2be4fe6b5970419b8e5cd9903ad679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-local-execution/src/streaming_sink/base.rs:248-257 | src/daft-local-execution/src/streaming_sink/base.rs:261-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/streaming_sink/base.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22c609edb9750c7f896c703013a4d67a0575a1767c0587bf5d4b94d089e4da9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-local-plan/src/plan.rs:1199-1208 | src/daft-local-plan/src/plan.rs:1279-1288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":1199}}}],"partialFingerprints":{"codehealthFindingId/v1":"368230667edb5dd2e5feecafcbaaebdb7ce7df948fe43d3e76bc2c011c5670de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/daft-logical-plan/src/ops/project.rs:398-406 | src/daft-logical-plan/src/ops/project.rs:433-442 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/ops/project.rs:398\u0060 it does not close everything it opens, so those exact lines 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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"a827ac6eb1f873b6d0e812285fe8404bcf1b5360ba6fc5702ad140677b6e1149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-logical-plan/src/ops/project.rs:453-462 | src/daft-logical-plan/src/ops/project.rs:531-540 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/ops/project.rs:453\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"8366c7517d93e7df1fb239dc1367a64b3ddad22999dae0264bd1a8c9bdaae02f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-logical-plan/src/ops/set_operations.rs:370-379 | src/daft-logical-plan/src/ops/set_operations.rs:380-389 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab69c31afd132e8a2ec50a99b6076184999275d976d0651f1ace8f45984222b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-parquet/src/python.rs:203-212 | src/daft-parquet/src/python.rs:258-267 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-parquet/src/python.rs:203\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/python.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e83e5143bd8bab553f3525b7e4b7320502a344452dcd43985ac1a5cbbb199cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:913-922 | src/daft-recordbatch/src/lib.rs:1316-1324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:913\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"babd257c89246a776f63a55991d55b50f5d74371622ae66b12dcbc9fc412c2ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-schema/src/field.rs:136-145 | src/daft-schema/src/field.rs:152-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 \u0060src/daft-schema/src/field.rs:136\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-schema/src/field.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"89803d8cca3ed5359df6a62379ea7ca9e1125a9572c2599ae18445ce0874483f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-sql/src/modules/aggs.rs:101-110 | src/daft-sql/src/modules/aggs.rs:143-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/aggs.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b96ee240bae60ab6847f1cf02bc47750eb4abeb54a5e63ad93ffe48aec5eac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 2): src/daft-sql/src/modules/temporal.rs:218-227 | src/daft-sql/src/modules/temporal.rs:1023-1028 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-sql/src/modules/temporal.rs:218\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b62a79971b54589ee3a757422ca4112abc4eabbc2f77e3f954df1c5b42d6eb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): src/daft-core/src/array/growable/fixed_size_list_growable.rs:35-43 | src/daft-core/src/array/growable/list_growable.rs:40-48 | src/daft-core/src/array/growable/python_growable.rs:29-36 | src/daft-core/src/array/growable/struct_growable.rs:43-51 \u2014 before extracting anything, compare \u0060src/daft-core/src/array/growable/python_growable.rs\u0060 and \u0060src/daft-core/src/array/growable/struct_growable.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-core/src/array/growable/list_growable.rs:50\u0060 calls \u0060iter\u0060, \u0060offsets\u0060 and \u0060src/daft-core/src/array/growable/fixed_size_list_growable.rs:44\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/growable/fixed_size_list_growable.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e80aabf2d8326156900f20f6730d8be8f1d94fbb9d75b20f7416e94b1f7863"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:215-223 | src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:225-233 | src/daft-distributed/src/pipeline_node/sort.rs:505-513 \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":"src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31d00589e802eee533381dcb7358793efe70dd5b802fb1b06e23d06991d0192"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/daft-distributed/src/python/mod.rs:129-137 | src/daft-distributed/src/python/mod.rs:148-156 | src/daft-distributed/src/python/mod.rs:175-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 \u0060src/daft-distributed/src/python/mod.rs:129\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"007fb8fdf8e78684cbc09441b184b1cb955a87eff80e0d4f970ff5ad23acefe2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): src/daft-json/src/inference.rs:148-157 | src/daft-json/src/local.rs:468-477 | src/daft-json/src/schema.rs:215-224 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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":"src/daft-json/src/inference.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a11ce978143dad465adab6896988843d8c0b4f70b72e53cccfe78723728f129"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/daft-local-execution/src/sinks/sort.rs:120-128 | src/daft-logical-plan/src/ops/sort.rs:89-97 | src/daft-logical-plan/src/ops/top_n.rs:134-142 \u2014 before extracting anything, compare \u0060src/daft-logical-plan/src/ops/sort.rs\u0060 and \u0060src/daft-logical-plan/src/ops/top_n.rs\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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/sort.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/sort.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c0cef8b76c652de659337c7617f4c8270b9194f43ecc167c6f6e74ad7db5b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/daft-local-execution/src/sinks/window_order_by_only.rs:198-206 | src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs:281-291 | src/daft-local-execution/src/sinks/window_partition_and_order_by.rs:290-298 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/sinks/window_partition_and_dynamic_frame.rs\u0060 and \u0060src/daft-local-execution/src/sinks/window_partition_and_order_by.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 128 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/window_order_by_only.rs:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-local-execution/src/sinks/window_order_by_only.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afb2cb512df6b222a4d289e3797cd5ee6f6c70c42cc00c1ce355bc375c04118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): src/daft-logical-plan/src/ops/project.rs:454-461 | src/daft-logical-plan/src/ops/project.rs:505-513 | src/daft-logical-plan/src/ops/project.rs:532-539 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/ops/project.rs:454\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c7f5f176593127543e4707e9f8d9d3f4edd10e7f2261ec638c45e3fc87834e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/common/io-config/src/python.rs:2022-2030 | src/common/io-config/src/python.rs:2307-2315 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/common/io-config/src/python.rs:2022\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/io-config/src/python.rs"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b27c068cd9fde61c1a6611f403a1535da8597603a254615b110e6516a607a00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-core/src/array/ops/hash.rs:409-417 | src/daft-core/src/array/ops/hash.rs:450-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 \u0060src/daft-core/src/array/ops/hash.rs:409\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-core/src/array/ops/hash.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"8288862bf0e7d1f6a1262784bf879f5510c052e20f3aa6f6bc4bdb8770c7014b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-dashboard/src/engine.rs:587-595 | src/daft-dashboard/src/engine.rs:656-664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c517d96a748e9d6d632685e371e8b09366d8dea1f7bb1fd47f56c801a80320"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-distributed/src/pipeline_node/explode.rs:159-167 | src/daft-local-execution/src/intermediate_ops/explode.rs:151-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/explode.rs:159\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/explode.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b623e0f539fc09e3818e2f754a222e987944cdab95cd5e03f262ddc8f20e0f23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-distributed/src/pipeline_node/join/asof_join.rs:380-388 | src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:222-230 \u2014 before extracting anything, compare \u0060src/daft-distributed/src/pipeline_node/join/asof_join.rs\u0060 and \u0060src/daft-distributed/src/pipeline_node/join/sort_merge_join.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 \u0060src/daft-distributed/src/pipeline_node/join/asof_join.rs:380\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/join/asof_join.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5aa70e63aff3e8b340b09e521b17272d97202dcc2f0a32a023b7692acea91c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-distributed/src/pipeline_node/join/hash_join.rs:105-113 | src/daft-distributed/src/pipeline_node/join/sort_merge_join.rs:91-99 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/join/hash_join.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf23cf99690d45304c7b1450a8d6f68a5590b3d14f45e6be3dde8c17432bc3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-distributed/src/pipeline_node/sink.rs:293-301 | src/daft-logical-plan/src/ops/sink.rs:92-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-distributed/src/pipeline_node/sink.rs:293\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/sink.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da7c2fda133cce669e8dc881383cb70b9141aafc08ad5c9e8210261fcb0e6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-distributed/src/pipeline_node/sort.rs:239-247 | src/daft-distributed/src/pipeline_node/sort.rs:293-301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/sort.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":"src/daft-distributed/src/pipeline_node/sort.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b55f5275b0aa88c0634dec091553a7ecd418464b578d2f770dd7701150f406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-distributed/src/pipeline_node/unpivot.rs:82-90 | src/daft-logical-plan/src/ops/unpivot.rs:120-128 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/unpivot.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fadeb5d6885f67640a7596301422ceaf972eacd4de8f18682d65c5c87a6e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-dsl/src/expr/display.rs:32-40 | src/daft-dsl/src/functions/mod.rs:108-116 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-dsl/src/expr/display.rs:32\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/display.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"678dba565a85e3df3d32c3fc1763d39a0e313867777fc50f9bbce54d31f9cfbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-ext/src/abi/arrow.rs:378-386 | src/daft-ext/src/abi/arrow.rs:446-454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext/src/abi/arrow.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a339c84883448f98aefbc1e64a39b5472ff904f1bd89b0f7cf9784551cacbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:225-233 | src/daft-functions-list/src/kernels.rs:296-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/kernels.rs:225\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc59139fb3948f8994501b54adad64ef091e110d76347a59e7bee2fb6ffd684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:374-382 | src/daft-functions-list/src/kernels.rs:759-767 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/kernels.rs:374\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b473784f1acd3f7c154c5893d88a82f20140c603709ec493163e10a2c7d513b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-functions-list/src/series.rs:239-247 | src/daft-functions-list/src/series.rs:250-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 \u0060src/daft-functions-list/src/series.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":"src/daft-functions-list/src/series.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"4677ac366b8bb2981d052c2b7cf46240a01b5eb1656f40cfa5befbc6b725f2d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-functions-utf8/src/lpad.rs:40-51 | src/daft-functions-utf8/src/rpad.rs:40-51 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/lpad.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":"src/daft-functions-utf8/src/lpad.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde24de3f9748efcb04608e4b552d66e21ad02df75063dcde11128a52730edcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-functions-utf8/src/split_part.rs:156-164 | src/daft-functions-utf8/src/substring_index.rs:152-160 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/split_part.rs:156\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"695a448a7823f9fdf7b4273242b2816787a7e5d54b85221f2982e670a004c374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/daft-io/src/http.rs:390-396 | src/daft-io/src/huggingface/mod.rs:267-275 \u2014 before extracting anything, compare \u0060src/daft-io/src/http.rs\u0060 and \u0060src/daft-io/src/huggingface/mod.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/http.rs:390\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/http.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"808a387ed2ef2b2b26f69ed5de952c775621eab940c2506b4726052e5d571d25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-io/src/s3_like.rs:1033-1041 | src/daft-io/src/s3_like.rs:1169-1177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/s3_like.rs:1033\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"09314e94ae998049b55eef340a7e551dbe5a40d643f84af3b7a25cd2ab580f2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): src/daft-json/src/read.rs:243-251 | src/daft-parquet/src/read.rs:373-378 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-json/src/read.rs:243\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-json/src/read.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c62ced33d2fd1f92311b818b9db36181f5f456756f89e705f4a3e44152f9aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-local-execution/src/concat.rs:134-142 | src/daft-local-execution/src/streaming_sink/base.rs:475-483 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-local-execution/src/concat.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/concat.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03df767406013b757d6b9eb9639c2b54eeed80b8aec22e0a807c4d5434c1001"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:342-350 | src/daft-local-execution/src/join/join_node.rs:89-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:342\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/intermediate_op.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"20246743816281efe5d36eca0d01d4296e9c4caeb6dfc08e95ca1b57070c3f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-local-execution/src/join/asof_join.rs:223-231 | src/daft-local-execution/src/join/asof_join.rs:276-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/asof_join.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"73281c5c6208099459c186b5cc2996f15c8ba8ad26c93f3da566417e7e5c47b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 2): src/daft-local-execution/src/join/inner_join.rs:24-30 | src/daft-local-execution/src/join/left_right_join.rs:31-39 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/inner_join.rs\u0060 and \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/inner_join.rs:24\u0060 it does not close everything it opens, so those exact 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, \u0060src/daft-local-execution/src/join/left_right_join.rs:40\u0060 calls \u0060mark_used\u0060 and \u0060src/daft-local-execution/src/join/inner_join.rs:31\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":"src/daft-local-execution/src/join/inner_join.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63b683649aeeefb15336727cda7eca139d6669601c153998ea9fae4849cc4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-local-execution/src/join/left_right_join.rs:205-213 | src/daft-local-execution/src/join/left_right_join.rs:253-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"a063b82db794f1578d4eed6d0b37d1e567407fc595c275fcc4610af6002519af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-local-execution/src/join/outer_join.rs:213-221 | src/daft-local-execution/src/join/outer_join.rs:245-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/outer_join.rs:213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/outer_join.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecbe03f8382ea6b1b0e1dcc44f6a57b500f8af3e26384f7b8877e5d001f903bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-local-execution/src/sources/scan_task.rs:188-196 | src/daft-local-execution/src/sources/shuffle_read.rs:160-168 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sources/scan_task.rs:188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-local-execution/src/sources/scan_task.rs:187\u0060 calls \u0060is_none\u0060 and \u0060src/daft-local-execution/src/sources/shuffle_read.rs:159\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":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7f9452c99dd1f936e5646314fd760b34d4557acacf68e4a24791a385eea1264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/daft-local-plan/src/agg.rs:166-173 | src/daft-local-plan/src/agg.rs:178-186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-local-plan/src/agg.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"777b6deaf464096fb360f61641d92f7af3deee9df37292073eb163954b76d26a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): src/daft-local-plan/src/agg.rs:206-220 | src/daft-local-plan/src/agg.rs:241-256 \u2014 both copies are in the same file, so extract the block 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":"src/daft-local-plan/src/agg.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5365015b15fc765332d01c657686ee25a19bfb31f8f09531bf5e324f07ac0f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-micropartition/src/micropartition.rs:684-692 | src/daft-micropartition/src/micropartition.rs:708-716 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5207176c10aedf45caea976ba3c44f4f404c467d6323c3bfeebaa5144cdc8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/daft-micropartition/src/micropartition.rs:724-732 | src/daft-parquet/src/read.rs:548-555 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-micropartition/src/micropartition.rs:724\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":724}}}],"partialFingerprints":{"codehealthFindingId/v1":"500c73b3f9031d4b0001ff87a219838566efbc33cf448f8a449e734f699b1ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-micropartition/src/python.rs:1058-1066 | src/daft-micropartition/src/python.rs:1091-1099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-micropartition/src/python.rs:1067\u0060 calls \u0060Some\u0060 and \u0060src/daft-micropartition/src/python.rs:1100\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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"223e86ef57c79d79245cd96e2889c087d9a32e841d72dd4c43ca128ebc87ce4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-parquet/src/metadata.rs:286-294 | src/daft-parquet/src/metadata.rs:423-431 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-parquet/src/metadata.rs:286\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/metadata.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"4991766d7db28fa51afc05aee81f3b881a6e71180d5c73f23e201d38f86258f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:1182-1190 | src/daft-recordbatch/src/lib.rs:1516-1524 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f76328d9e5f209e7718ba9d57320107db6faf343cf6b49a6d1b14065f84714a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:1856-1863 | src/daft-schema/src/schema.rs:303-311 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:1856\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1856}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7ceacc65ca18076917e5cf9f77d59d111cab1fdb8754a726143ec987fca2b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:1329-1338 | src/daft-recordbatch/src/ops/inline_agg.rs:1341-1350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1329\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9eff34fefe5bad8f9b8ae45b67e91c38b7cedb0e0162db3685120aea6f9de7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-scan/src/anonymous.rs:86-94 | src/daft-scan/src/glob.rs:678-686 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-scan/src/anonymous.rs:86\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/anonymous.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db12ea31a23d4b0c3643039485b20c5ab1e17b33bd94ec3d016f2be791bf410"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-writers/src/csv_writer.rs:140-148 | src/daft-writers/src/json_writer.rs:108-116 \u2014 before extracting anything, compare \u0060src/daft-writers/src/csv_writer.rs\u0060 and \u0060src/daft-writers/src/json_writer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-writers/src/csv_writer.rs:140\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"a211407ace247f22dc683a31b4ca1c2dd7280702e3f182ef65cc960eacd8637b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/daft-local-execution/src/intermediate_ops/explode.rs:36-44 | src/daft-local-execution/src/intermediate_ops/filter.rs:46-54 | src/daft-local-execution/src/intermediate_ops/stage_checkpoint_keys.rs:43-50 | src/daft-local-execution/src/intermediate_ops/udf.rs:62-70 | src/daft-local-execution/src/runtime_stats/values.rs:58-65 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/intermediate_ops/explode.rs:36\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-local-execution/src/intermediate_ops/filter.rs:55\u0060 calls \u0060f64_gauge\u0060 and \u0060src/daft-local-execution/src/intermediate_ops/explode.rs:45\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":"src/daft-local-execution/src/intermediate_ops/explode.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb641e48cc48f8f421ce39c30250e99511da5391b190dc876c9d4f44ac84be75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/daft-io/src/s3_like.rs:854-861 | src/daft-io/src/s3_like.rs:927-934 | src/daft-io/src/s3_like.rs:1035-1042 | src/daft-io/src/s3_like.rs:1171-1178 \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 \u0060src/daft-io/src/s3_like.rs:854\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460df0549ce03be8a7142fdf1e67a235890254c147fc6748c3c36d248faa108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/daft-recordbatch/src/ops/joins/hash_join.rs:73-81 | src/daft-recordbatch/src/ops/joins/hash_join.rs:178-186 | src/daft-recordbatch/src/ops/joins/hash_join.rs:374-382 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/joins/hash_join.rs:73\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-recordbatch/src/ops/joins/hash_join.rs:383\u0060 calls \u0060set_bit\u0060 and \u0060src/daft-recordbatch/src/ops/joins/hash_join.rs:187\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":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31d7cc16d56f2691128ccf2d8ca8d208996bee1c36e2503de876cffafbc4565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/common/io-config/src/cos.rs:77-84 | src/common/io-config/src/tos.rs:67-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/common/io-config/src/cos.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea74d4c5cd59c11cf66730f743c2dbccfa68612802a149058d66ed118dec40b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-avro/src/write.rs:103-110 | src/daft-avro/src/write.rs:144-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-avro/src/write.rs:111\u0060 calls \u0060new_empty\u0060 and \u0060src/daft-avro/src/write.rs:153\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":"src/daft-avro/src/write.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3feea816f191b9f3e50a39b5e4f6f90c4762d7eb6704de6382af5a35e554eb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-core/src/array/ops/arithmetic.rs:252-259 | src/daft-core/src/array/ops/arithmetic.rs:292-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/ops/arithmetic.rs:252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/arithmetic.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34cab601b00a4d4ef7207165a1ccc6a06134dbe6cab3f0ba7783b98867716ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-core/src/array/ops/broadcast.rs:122-129 | src/daft-core/src/array/ops/broadcast.rs:168-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/ops/broadcast.rs:122\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/broadcast.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"649bf2def139d151cc3e2f9056be15c7c4c86bf94bc6d6412914d0f71c873334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-core/src/datatypes/agg_ops.rs:7-16 | src/daft-core/src/datatypes/agg_ops.rs:25-34 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/datatypes/agg_ops.rs:7\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/agg_ops.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"692291b280983a809bc4d2bf5103d0e6834ec76acb30e56b72f108a364277d0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-distributed/src/pipeline_node/explode.rs:85-92 | src/daft-distributed/src/pipeline_node/filter.rs:85-92 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-distributed/src/pipeline_node/explode.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":"src/daft-distributed/src/pipeline_node/explode.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2a4666542624d435671224f4ed95cb7ec141f2b5cf76fbf00a7a1a7ee70a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-distributed/src/scheduling/scheduler/default.rs:49-56 | src/daft-distributed/src/scheduling/scheduler/linear.rs:29-36 \u2014 before extracting anything, compare \u0060src/daft-distributed/src/scheduling/scheduler/default.rs\u0060 and \u0060src/daft-distributed/src/scheduling/scheduler/linear.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce32cb53b56e410fbc5e4a20a22125b7e331cd192fa8bf7916378d58a2fbe2cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-functions-temporal/src/date_navigation.rs:72-79 | src/daft-functions-temporal/src/date_navigation.rs:154-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 \u0060src/daft-functions-temporal/src/date_navigation.rs:72\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_navigation.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff72d0eb095d2dbc77bbb91840707339ce042ea7ba2c69ca3cb12bfe9c73cd28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-functions-temporal/src/time.rs:213-220 | src/daft-functions-temporal/src/time.rs:289-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-temporal/src/time.rs:213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-functions-temporal/src/time.rs:287\u0060 calls \u0060as_deref\u0060, \u0060transpose\u0060 and \u0060src/daft-functions-temporal/src/time.rs:211\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":"src/daft-functions-temporal/src/time.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9675fcce8c6ddd2e5189dc93d31f17a9320eeff620ff44c7597312bcaa323634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-functions-utf8/src/substr.rs:153-160 | src/daft-functions-utf8/src/substr.rs:188-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/substr.rs:153\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-functions-utf8/src/substr.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ef29ea33786fa7fbe6dde7847ade0bc504816987141d36fed8edab3d1549ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/daft-functions/src/numeric/exp.rs:37-43 | src/daft-functions/src/numeric/trigonometry.rs:40-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions/src/numeric/exp.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":"src/daft-functions/src/numeric/exp.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2d0a40e1bf4437a40f9995068366a1b73c2732dffb42943218a3fcf60ac2386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-logical-plan/src/ops/set_operations.rs:203-211 | src/daft-logical-plan/src/ops/set_operations.rs:507-514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/ops/set_operations.rs:203\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da8cf0943625ac9349a585b3e387a4518407af7edcab061b3cf5ae6421a22e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-logical-plan/src/ops/window.rs:176-190 | src/daft-logical-plan/src/ops/window.rs:193-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/window.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a6ab765c477cbbc844aaf71f07c787797ded3d503c9f8b69db0696321b038d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/eliminate_cross_join.rs:236-243 | src/daft-logical-plan/src/optimization/rules/eliminate_cross_join.rs:250-257 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/eliminate_cross_join.rs:236\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-logical-plan/src/optimization/rules/eliminate_cross_join.rs:244\u0060 calls \u0060Some\u0060 and \u0060src/daft-logical-plan/src/optimization/rules/eliminate_cross_join.rs:260\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":"src/daft-logical-plan/src/optimization/rules/eliminate_cross_join.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"06127ab29975586a57a0e4c60e5092aa7ec43de788a3edca2c4a619f3b9815a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:329-336 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:366-373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:329\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5fb47af2cd527f247b62cd573fa41ab2b9f1ba104bc115eda5850329a5e3ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/daft-mcap/src/lib.rs:146-153 | src/daft-mcap/src/lib.rs:209-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-mcap/src/lib.rs:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-mcap/src/lib.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5f62710834eaa9f1fdc2b8b32a4879b1a6fe74c612dd2bb6c23894983ba58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-micropartition/src/python.rs:642-649 | src/daft-recordbatch/src/python.rs:400-407 \u2014 before extracting anything, compare \u0060src/daft-micropartition/src/python.rs\u0060 and \u0060src/daft-recordbatch/src/python.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-micropartition/src/python.rs:642\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad69f112b229974952ab0d70b4f7c27727743de09179de2ef52e6e6b98fbb15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-parquet/src/python.rs:214-221 | src/daft-parquet/src/python.rs:268-275 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-parquet/src/python.rs:214\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-parquet/src/python.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d0e1ba7df92de69cbdceb0d34113e272c66896afae2b117591233c8bfece44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-parquet/src/statistics/column_range.rs:274-283 | src/daft-parquet/src/statistics/column_range.rs:298-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/statistics/column_range.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc187f0c5e5c6c8a649449297d6114f24d7964d028e971d3a7e0036250687ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:827-836 | src/daft-recordbatch/src/lib.rs:848-857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f5a32566bb307a99df28f6ae1a0784d2d3e976beaef45bf6cd766866f51f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-recordbatch/src/lib.rs:1350-1357 | src/daft-recordbatch/src/lib.rs:1372-1379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a760483c190034f6fa84b5d28e18b41432abf5bf663ed7fb54d755c6f69452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:269-276 | src/daft-recordbatch/src/ops/inline_agg.rs:332-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:269\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8341474a92e62bbb6c3a383ccba1c4922449337fbff22b519cd23d5018fa39f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-scan/src/scan_task_iters/mod.rs:321-328 | src/daft-scan/src/scan_task_iters/split_jsonl/mod.rs:129-136 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-scan/src/scan_task_iters/mod.rs:321\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/scan_task_iters/mod.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"650a52fa8bed005df2b53a9b2f37bd600c5aa50f8732df4d0f9f040262b402ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-writers/src/csv_writer.rs:73-80 | src/daft-writers/src/json_writer.rs:48-55 \u2014 before extracting anything, compare \u0060src/daft-writers/src/csv_writer.rs\u0060 and \u0060src/daft-writers/src/json_writer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"25594cf5978551794bbf705d1b070aa26abf5b6685478eacf228d34aaf696bc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-writers/src/csv_writer.rs:199-206 | src/daft-writers/src/json_writer.rs:154-161 \u2014 before extracting anything, compare \u0060src/daft-writers/src/csv_writer.rs\u0060 and \u0060src/daft-writers/src/json_writer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-writers/src/csv_writer.rs:199\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-writers/src/json_writer.rs:163\u0060 calls \u0060is_none\u0060, \u0060Ok\u0060 and \u0060src/daft-writers/src/csv_writer.rs:207\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":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e78d9a5723a593f7c43ff6a45bb9732fa2d74f87571ea85b87c37cf0205b264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): src/daft-core/src/array/ops/compare_agg.rs:26-33 | src/daft-core/src/array/ops/compare_agg.rs:108-115 | src/daft-core/src/array/ops/compare_agg.rs:167-174 | src/daft-core/src/array/ops/compare_agg.rs:230-237 | src/daft-core/src/array/ops/compare_agg.rs:299-306 \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 \u0060src/daft-core/src/array/ops/compare_agg.rs:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/compare_agg.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4241c4eeebb4d1c0c0db3a4e025f7706b36e5903cfd92a38154cc26f74a80e77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/daft-local-execution/src/join/inner_join.rs:53-59 | src/daft-local-execution/src/join/left_right_join.rs:57-63 | src/daft-local-execution/src/join/left_right_join.rs:137-143 | src/daft-local-execution/src/join/left_right_join.rs:186-192 | src/daft-local-execution/src/join/outer_join.rs:118-124 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/inner_join.rs\u0060 and \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-local-execution/src/join/inner_join.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed206bfd8abf801669b02e4878f3d12b6f0cc8e13feb5bb9a8f5719e0298edb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/daft-local-execution/src/join/left_right_join.rs:207-213 | src/daft-local-execution/src/join/left_right_join.rs:255-261 | src/daft-local-execution/src/join/outer_join.rs:222-228 | src/daft-local-execution/src/join/outer_join.rs:262-268 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 and \u0060src/daft-local-execution/src/join/outer_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/outer_join.rs:262\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-local-execution/src/join/left_right_join.rs:204\u0060 calls \u0060get_columns_by_name\u0060 and \u0060src/daft-local-execution/src/join/outer_join.rs:261\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":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9b2bbee8187a28492fad81d51b1e23cc163087b60243e62770d0cce2bbee7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/daft-sql/src/modules/temporal.rs:164-170 | src/daft-sql/src/modules/temporal.rs:822-828 | src/daft-sql/src/modules/temporal.rs:938-944 | src/daft-sql/src/modules/temporal.rs:980-986 \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 \u0060src/daft-sql/src/modules/temporal.rs:164\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4480f063bc78050942602eaf8f9563d4ec4a7910408bc38c86398eb810968df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/daft-distributed/src/pipeline_node/udf.rs:44-50 | src/daft-local-execution/src/intermediate_ops/udf.rs:65-71 | src/daft-local-execution/src/streaming_sink/async_udf.rs:63-69 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/intermediate_ops/udf.rs\u0060 and \u0060src/daft-local-execution/src/streaming_sink/async_udf.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-distributed/src/pipeline_node/udf.rs:51\u0060 calls \u0060clone\u0060 and \u0060src/daft-local-execution/src/streaming_sink/async_udf.rs:70\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":"src/daft-distributed/src/pipeline_node/udf.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1987d128e4c9aa3cf5cb15c192af73c76a31e14db6c8a07081a55a5de79da8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 3): src/daft-functions-utf8/src/to_datetime.rs:124-130 | src/daft-functions-utf8/src/to_datetime.rs:144-149 | src/daft-functions-utf8/src/to_datetime.rs:156-162 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/to_datetime.rs:124\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/to_datetime.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30c53efad8e1766ba815744e2dc9f7fe3897ea3c495ecd15088e8593912f146"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/daft-functions/src/numeric/log.rs:40-46 | src/daft-functions/src/numeric/log.rs:109-115 | src/daft-functions/src/numeric/pow.rs:43-49 \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 \u0060src/daft-functions/src/numeric/log.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/numeric/log.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e125752791a33703b3e1183947ba874ca9c5923515155cef92b48ad940a274"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/daft-logical-plan/src/logical_plan.rs:454-460 | src/daft-logical-plan/src/logical_plan.rs:1054-1060 | src/daft-logical-plan/src/logical_plan.rs:1089-1095 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce5d118ed44cff6a751e2fcc9f73506436c52a29df4d705497253538ed7097d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-catalog/src/python/wrappers.rs:273-279 | src/daft-catalog/src/python/wrappers.rs:290-296 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-catalog/src/python/wrappers.rs:273\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff1df1bcc7ea1b672c74b717845bc3faf2d7350d34322e60b14a694d0f3e5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-core/src/kernels/hashing.rs:651-657 | src/daft-core/src/kernels/hashing.rs:755-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/kernels/hashing.rs:651\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb0c5ad3f57a08680d7c5c26d03986e2fbfd3be4637fc1a29309163e14571694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-csv/src/local.rs:933-939 | src/daft-csv/src/read.rs:777-783 \u2014 before extracting anything, compare \u0060src/daft-csv/src/local.rs\u0060 and \u0060src/daft-csv/src/read.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/local.rs:933\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-csv/src/local.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"339f6eebbbac78d6617ac83b0471299d73a7092dc4aad309c23b5c68057db9ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-distributed/src/pipeline_node/window.rs:97-103 | src/daft-distributed/src/pipeline_node/window.rs:199-205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/pipeline_node/window.rs:97\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/window.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a11b8617ef001df32e38d5a33efe08353a9a8bf2a74337efc2b964123f9c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/daft-ext-internal/src/aggregate.rs:102-107 | src/daft-ext-internal/src/function.rs:152-158 \u2014 before extracting anything, compare \u0060src/daft-ext-internal/src/aggregate.rs\u0060 and \u0060src/daft-ext-internal/src/function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"8855a6e979f78bb907525f80e63133a98ffd5812541921904e99bdb1dd4d7eff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-ext-internal/src/aggregate.rs:125-131 | src/daft-ext-internal/src/aggregate.rs:233-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d635df2d3d72b59142a0ef50cb6704b16fd0fcd5cf75820ee31e93723e7e7532"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-file/src/functions.rs:507-513 | src/daft-file/src/functions.rs:551-557 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-file/src/functions.rs:507\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-file/src/functions.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98b020283f0aa4db778944c53679e11d65c9622d55c4f56aa7b6fb4a789fe55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-functions-list/src/kernels.rs:539-548 | src/daft-functions-list/src/kernels.rs:589-598 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/kernels.rs:539\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d544da9d2c4330dcfe3d26abb646971d26ca349249daeea0867b636be3083fe4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-functions-temporal/src/date_navigation.rs:38-44 | src/daft-functions-temporal/src/date_navigation.rs:122-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 \u0060src/daft-functions-temporal/src/date_navigation.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":"src/daft-functions-temporal/src/date_navigation.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74d072dfcaafc14a3c652d1ad84e6b5d5b960eb9f6c1899d02679362c30d58f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-functions-utf8/src/chr.rs:60-66 | src/daft-functions-utf8/src/space.rs:59-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/chr.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":"src/daft-functions-utf8/src/chr.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cb2cb3ae9c37ff0cf19e63446cca1481623f673786a9605451ddd2f03bdfc2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-functions-utf8/src/regexp_extract.rs:58-64 | src/daft-functions-utf8/src/regexp_extract_all.rs:60-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/regexp_extract.rs:58\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/regexp_extract.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee186a6965730cbde3b93ed8914041a8d74384fbd4d1c72b00cd5507a3bcbfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-io/src/http.rs:383-389 | src/daft-io/src/http.rs:422-428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/http.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"219555d880498ccc396a0f143fdb6dc4da1fc1dfa94ea4d50aed7eb898de5eb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-local-execution/src/join/left_right_join.rs:235-241 | src/daft-local-execution/src/join/outer_join.rs:201-207 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 and \u0060src/daft-local-execution/src/join/outer_join.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 108 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-local-execution/src/join/left_right_join.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec873633fc5c08050082a2c3b9939a0998720e21e2b804cf6be774c64f4dbb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-local-plan/src/plan.rs:1186-1192 | src/daft-local-plan/src/plan.rs:1271-1277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9dbed54c4f8cf2756ed26a5a53ab56fb7ca5e148460c9a29c889a02421d83c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:338-344 | src/daft-logical-plan/src/optimization/rules/push_down_projection.rs:376-382 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6f60635a407507e4b3abaeff086be8d14469f606913dee0d4e4a52f63fc04c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/split_udfs.rs:420-427 | src/daft-logical-plan/src/optimization/rules/split_udfs.rs:432-439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/split_udfs.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"7defd0a776eead17827736bd19644fd0b0c19d640bc46cf3696e5a44e9cbe0d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-logical-plan/src/partitioning.rs:200-206 | src/daft-logical-plan/src/partitioning.rs:371-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/partitioning.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a29d8a7d7cd2c297fdfd6b4f8c7142b2d97ed5dcaa71429522909ffb78f5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-scan/src/python.rs:640-646 | src/daft-scan/src/python.rs:649-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/python.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eecbb33d3f5380485886a1d881c9dcf53cab7414965afa3caa9ed20ac69fe18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-session/src/session.rs:403-409 | src/daft-session/src/session.rs:432-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 \u0060src/daft-session/src/session.rs:403\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/daft-session/src/session.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea2183d026325937515be49c3b37ba48135ad477f1cdfc0c18f9b3d1aa95abe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-session/src/session.rs:532-538 | src/daft-session/src/session.rs:557-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-session/src/session.rs:532\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-session/src/session.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ce8f671bbba521004a5d5d2f5e6e7800b3d695d8ef8ca721ed424774f49119"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): src/daft-sql/src/modules/image/decode.rs:17-22 | src/daft-sql/src/modules/image/to_mode.rs:16-22 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-sql/src/modules/image/decode.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c17b4ec87e0e198e0c26279bc5d7949949a23c8bc0f1ed4efa5016e09b0c66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-writers/src/csv_writer.rs:57-63 | src/daft-writers/src/json_writer.rs:32-38 \u2014 before extracting anything, compare \u0060src/daft-writers/src/csv_writer.rs\u0060 and \u0060src/daft-writers/src/json_writer.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 134 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-writers/src/csv_writer.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"14408dcaab1936d952105a4c799339ccc43c7b9638b43af2943d35fbf7a28ec9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/daft-dsl/src/python_udf/batch.rs:174-181 | src/daft-dsl/src/python_udf/batch.rs:217-224 | src/daft-dsl/src/python_udf/row_wise.rs:216-223 \u2014 before extracting anything, compare \u0060src/daft-dsl/src/python_udf/batch.rs\u0060 and \u0060src/daft-dsl/src/python_udf/row_wise.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/python_udf/batch.rs:174\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e2d1391ee749e6f88544afd74dabcb1909b80f39d70bd808038696ff43baa84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/daft-functions-utf8/src/chr.rs:59-65 | src/daft-functions-utf8/src/space.rs:58-64 | src/daft-functions-utf8/src/utils.rs:216-222 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/daft-functions-utf8/src/chr.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/chr.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b27c581a266da98d7c9b886a76352968e230ef669fdeba2ceaf3ef94d48141c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/daft-functions/src/float/is_inf.rs:40-45 | src/daft-functions/src/float/is_nan.rs:42-47 | src/daft-functions/src/float/not_nan.rs:39-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions/src/float/is_inf.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/float/is_inf.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3217783dba5b1f0f0292b8e1f74afcd4181ba74a709e8a73b775e2f393c8d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/daft-recordbatch/src/ops/inline_agg.rs:162-167 | src/daft-recordbatch/src/ops/inline_agg.rs:281-286 | src/daft-recordbatch/src/ops/inline_agg.rs:344-349 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:162\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1362e63ac720c4d62257a140e8c24b146a14853e20bd297d8c611d57e5b803"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/common/runtime/src/joinset.rs:70-75 | src/common/runtime/src/joinset.rs:88-93 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/common/runtime/src/joinset.rs:70\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/runtime/src/joinset.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5c62546d2356440188e49755ada5184c642a1d915cab0a40211de850a00c65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-csv/src/metadata.rs:80-85 | src/daft-json/src/schema.rs:83-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/metadata.rs:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/metadata.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4725d097c8baf1e7eab5ac1924f9ba674e857a5a1fe8e92e5e9c3a22cedb1aa6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-distributed/src/pipeline_node/join/broadcast_join.rs:116-126 | src/daft-distributed/src/pipeline_node/join/stats.rs:93-103 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/daft-distributed/src/pipeline_node/join/broadcast_join.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a83f6b1c914a4d7386513ed4e8c4a927e5618f298ca896dc17bd3dd3933ce43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): src/daft-dsl/src/python_udf/batch.rs:161-166 | src/daft-dsl/src/python_udf/batch.rs:207-212 | src/daft-dsl/src/python_udf/row_wise.rs:193-195 \u2014 before extracting anything, compare \u0060src/daft-dsl/src/python_udf/batch.rs\u0060 and \u0060src/daft-dsl/src/python_udf/row_wise.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/python_udf/batch.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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, \u0060src/daft-dsl/src/python_udf/batch.rs:166\u0060 calls \u0060Ok\u0060, \u0060cast\u0060, \u0060rename\u0060 and \u0060src/daft-dsl/src/python_udf/row_wise.rs:195\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":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5340cd64f01ce17cc55aeea7ee40b2ef8155a1e8ef4e8ff0fe08be3812564ece"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-dsl/src/python_udf/batch.rs:240-245 | src/daft-dsl/src/python_udf/row_wise.rs:453-458 \u2014 before extracting anything, compare \u0060src/daft-dsl/src/python_udf/batch.rs\u0060 and \u0060src/daft-dsl/src/python_udf/row_wise.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/python_udf/batch.rs:240\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"244753406cf8230e23524fae0239ae8295812d45df9f31100f1841976c2e84fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-dsl/src/python_udf/row_wise.rs:200-205 | src/daft-dsl/src/python_udf/row_wise.rs:373-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/python_udf/row_wise.rs:200\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python_udf/row_wise.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"ace96e8fda821780736523dce6298e208a4f7f3130d00fc236a75399695bac0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-ext-internal/src/module.rs:147-154 | src/daft-ext-internal/src/module.rs:190-195 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-ext-internal/src/module.rs:147\u0060 it does not close everything it opens, so those exact lines 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":"src/daft-ext-internal/src/module.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"2133ab03bb02aa72c52bcbeced90622f46d6e1ec578351e5b31fb0e001596bab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-functions-binary/src/decode.rs:63-68 | src/daft-functions-binary/src/decode.rs:71-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-binary/src/decode.rs:63\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-binary/src/decode.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2232dc806bf4c63b42e4f3a0d621140823a7a6d8267a0811aac01dcd611f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-functions-binary/src/decode.rs:118-123 | src/daft-functions-binary/src/decode.rs:126-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-binary/src/decode.rs:118\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-binary/src/decode.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8cec289ba76467aebb34f14f1cb4ec401c564e4b18847420ae205b607007ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-functions-serde/src/format/json.rs:13-18 | src/daft-functions-serde/src/format/json.rs:52-57 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-serde/src/format/json.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb484ede904537dd179375865120013703f9c50cbec338ffb99df972e5af35e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 3): src/daft-functions/src/numeric/pmod.rs:101-102 | src/daft-functions/src/numeric/pmod.rs:130-135 | src/daft-functions/src/numeric/pmod.rs:143-148 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions/src/numeric/pmod.rs:101\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-functions/src/numeric/pmod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4ca9c077364457411608fd5a8e6a164756882e3aec0e13151e99b81409011c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-logical-plan/src/ops/set_operations.rs:241-246 | src/daft-logical-plan/src/ops/set_operations.rs:527-532 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/ops/set_operations.rs:241\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b106f65312b6ee5712a971b765b438ed89c95018ee07077789fd27ff5b2e057"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:821-826 | src/daft-recordbatch/src/ops/inline_agg.rs:835-840 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:821\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a27bae3ea32ed9e6cfee911b080ce2c0c17b8bb6443858cad6f82d1de2049d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-recordbatch/src/ops/joins/mod.rs:134-139 | src/daft-recordbatch/src/ops/joins/mod.rs:148-153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/joins/mod.rs:134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/mod.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"219cf85b481972898cb4a3816974111fa36f883f7e576e0d1aa640930fbac100"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-sql/src/modules/config.rs:487-492 | src/daft-sql/src/modules/config.rs:608-613 \u2014 both copies are in the same file, so extract the block 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, \u0060src/daft-sql/src/modules/config.rs:484\u0060 calls \u0060into\u0060 and \u0060src/daft-sql/src/modules/config.rs:606\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":"src/daft-sql/src/modules/config.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"aceb01becdf7e6e241c1661bb26f47a6b44abcaf27eaf2c41c3f5343b75c5bbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-writers/src/json_writer.rs:114-119 | src/daft-writers/src/parquet_writer.rs:165-170 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-writers/src/json_writer.rs:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/json_writer.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13469b40dd58c3be6815e198655f804cc9f2a8a4c0cde8df37d6c4accfc9104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): src/daft-local-plan/src/plan.rs:164-168 | src/daft-local-plan/src/plan.rs:217-221 | src/daft-local-plan/src/plan.rs:267-271 | src/daft-logical-plan/src/logical_plan.rs:439-443 | src/daft-logical-plan/src/logical_plan.rs:1037-1041 | src/daft-logical-plan/src/logical_plan.rs:1072-1076 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-logical-plan/src/logical_plan.rs:444\u0060 calls \u0060Offset\u0060 and \u0060src/daft-local-plan/src/plan.rs:169\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":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bd35d3877f6ac6a3c336634ea5f95a984c5c88ea0f9863cefb341f50ff5c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/daft-csv/src/read.rs:395-401 | src/daft-csv/src/read.rs:509-514 | src/daft-json/src/read.rs:222-227 | src/daft-json/src/read.rs:373-378 | src/daft-warc/src/lib.rs:577-581 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-json/src/read.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:395\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5346a9c3e67947ed1a2f446665eb368497a58a452d2e9c61f0bb9b27668142d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/daft-local-execution/src/join/inner_join.rs:26-30 | src/daft-local-execution/src/join/left_right_join.rs:34-39 | src/daft-local-execution/src/join/left_right_join.rs:111-115 | src/daft-local-execution/src/join/outer_join.rs:91-96 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/inner_join.rs\u0060 and \u0060src/daft-local-execution/src/join/left_right_join.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/join/inner_join.rs:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-local-execution/src/join/left_right_join.rs:40\u0060 calls \u0060mark_used\u0060 and \u0060src/daft-local-execution/src/join/inner_join.rs:31\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":"src/daft-local-execution/src/join/inner_join.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab1e51b075e8394bfa7dc6d4a677b2cba7002b060ca5a05897cbbd02425508e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/daft-core/src/array/ops/compare_agg.rs:115-119 | src/daft-core/src/array/ops/compare_agg.rs:174-178 | src/daft-core/src/array/ops/compare_agg.rs:237-241 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/ops/compare_agg.rs:115\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/compare_agg.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"388b3430cd4723eea4e101db5cb766d870f220e6eb84b57ddec8b8f20a2bbe46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/daft-core/src/kernels/hashing.rs:469-474 | src/daft-core/src/kernels/hashing.rs:518-523 | src/daft-core/src/kernels/hashing.rs:743-748 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/kernels/hashing.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":"src/daft-core/src/kernels/hashing.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc835f6cd840c35a0c6f114e2f73ef73cea098edc66e3160d8548d52b8ecda3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/daft-logical-plan/src/ops/project.rs:676-680 | src/daft-logical-plan/src/ops/project.rs:690-694 | src/daft-logical-plan/src/ops/project.rs:704-708 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/ops/project.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":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"1420c43e77ab137cff283d649f0be116136d2a37db279d6da3885e873bcec77f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/daft-micropartition/src/python.rs:1058-1062 | src/daft-micropartition/src/python.rs:1091-1095 | src/daft-micropartition/src/python.rs:1128-1132 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-micropartition/src/python.rs"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"5045142d0e5bb30b06276c7637d3d991584a9594dc8a8aefc44b7a3bd345b0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/daft-sql/src/table_provider/read_csv.rs:25-29 | src/daft-sql/src/table_provider/read_json.rs:46-50 | src/daft-sql/src/table_provider/read_parquet.rs:23-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-sql/src/table_provider/read_csv.rs:25\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/read_csv.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf116c9ce79e703058a7dfba9d667792630042710ecc2841758b13f93578fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-core/src/array/ops/arithmetic.rs:263-267 | src/daft-core/src/array/ops/arithmetic.rs:303-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/ops/arithmetic.rs:263\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/arithmetic.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f82e88fe5f38bd6544ddd38bacf4cb31f154585be16cf0aff10a6a810f455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-core/src/array/ops/full.rs:162-166 | src/daft-core/src/array/ops/full.rs:202-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/full.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8203996789162359881b10fbf9bf7e9204d3303f563c247af08000c806dddada"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-core/src/lit/deserializer.rs:313-320 | src/daft-core/src/lit/deserializer.rs:364-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/lit/deserializer.rs:313\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/lit/deserializer.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e992d709de5f3986564af1610751901c6536ea22d4b7551ebfe858a185183c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): src/daft-core/src/series/utils/python_fn.rs:40-44 | src/daft-core/src/series/utils/python_fn.rs:77-79 | src/daft-core/src/series/utils/python_fn.rs:135-139 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/series/utils/python_fn.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-core/src/series/utils/python_fn.rs:140\u0060 calls \u0060from\u0060, \u0060to_pylist\u0060 and \u0060src/daft-core/src/series/utils/python_fn.rs:81\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":"src/daft-core/src/series/utils/python_fn.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"55dfa4dbfb0046616c182b147d1ce5b05c5e5e80741f43428671af97199e2f08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-distributed/src/python/ray/worker_manager.rs:581-586 | src/daft-distributed/src/python/ray/worker_manager.rs:747-752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/python/ray/worker_manager.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":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"61cbbe21c72fcf59cdcde830b211b58f7ab11aaee629030ddd56cb81df732ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-ext-internal/src/module.rs:125-130 | src/daft-ext-internal/src/module.rs:168-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-ext-internal/src/module.rs:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext-internal/src/module.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf28fa2cb9e1965fc6ef462203b3cd0b4363b16aca9f4e34af8787dea6dd193"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-ext/src/aggregate.rs:111-116 | src/daft-ext/src/function.rs:79-84 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"src/daft-ext/src/aggregate.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8b96918783250049713fae4c2f80af6e567229df185f8b7968204cbc72ad4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-functions-list/src/bool_and.rs:36-41 | src/daft-functions-list/src/bool_or.rs:34-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/bool_and.rs:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/bool_and.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"de963f77df6b3bc8d51fad2aeeb75c38fa2e7038b0da0fb79955fc4cada2be49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-functions-temporal/src/time.rs:242-246 | src/daft-functions-temporal/src/time.rs:323-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-temporal/src/time.rs:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/daft-functions-temporal/src/time.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07f7cf4aede4a770221b3e62dc078674c47e819830e9d54ac7ef2c2aa7341a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-functions-utf8/src/pad.rs:110-114 | src/daft-functions-utf8/src/repeat.rs:100-104 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/pad.rs:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/pad.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8324f79d040bee1b911c4f9a1c21214db32d23fc27cd2c095e9701b79dcd4e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-image/src/ops.rs:521-526 | src/daft-image/src/ops.rs:914-919 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-image/src/ops.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c311bf12cb151fce9dfead67ef865ca3a4af0439614b153971658e15de83522"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-logical-plan/src/optimization/rules/granular_projections.rs:189-193 | src/daft-logical-plan/src/optimization/rules/granular_projections.rs:206-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/granular_projections.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c107631561d0dcf600f6c4da2aa0b1a4af23f3f5f4f7ce2c931e0051ecce9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20135 lines \u00D7 3): src/daft-recordbatch/src/lib.rs:1625-1629 | src/daft-recordbatch/src/lib.rs:1642-1646 | src/daft-recordbatch/src/lib.rs:1673-1674 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/lib.rs:1625\u0060 it begins part-way through the construct above it, so those exact lines 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, \u0060src/daft-recordbatch/src/lib.rs:1642\u0060 calls \u0060derive_eval_schema\u0060 and \u0060src/daft-recordbatch/src/lib.rs:1673\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":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1625}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3af703194384147278195d9be631c7965e98a24c817866e843402ae7c3fe10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:219-223 | src/daft-recordbatch/src/ops/inline_agg.rs:224-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e25e70edc5e66bfa4421c811c723704a3e1615269e7fefcf3b9279601e575a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:237-241 | src/daft-recordbatch/src/ops/inline_agg.rs:242-246 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37f8fcefac206fd769012ad82ebbe23fee1c57428c182cec290add48fd37d87"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:612-618 | src/daft-recordbatch/src/ops/inline_agg.rs:649-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:612\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cff15b6b3c74acaaded348ef782304d797b749584b3c99db977a6a0a15a16c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:1142-1147 | src/daft-recordbatch/src/ops/inline_agg.rs:1403-1407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f54bd4ea40b024c424a57a425a5c00fb8b5b8b18480612c80a68cac08b1c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:1301-1305 | src/daft-recordbatch/src/ops/inline_agg.rs:1309-1313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/inline_agg.rs:1301\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":1301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1833058349881538e632d40061c8285095f8e88f4e87ede5cbe33a9346ea871a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-recordbatch/src/ops/joins/hash_join.rs:27-34 | src/daft-recordbatch/src/ops/joins/hash_join.rs:315-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-recordbatch/src/ops/joins/hash_join.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/hash_join.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f9ed0f8e0bfc54279846ab167e89002d779dbcb8a7621e451555d719b1074d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): src/common/resource-request/src/lib.rs:259-265 | src/daft-csv/src/options.rs:143-149 | src/daft-csv/src/options.rs:302-308 | src/daft-csv/src/options.rs:386-392 | src/daft-json/src/options.rs:106-112 | src/daft-json/src/options.rs:156-162 | src/daft-json/src/options.rs:230-236 \u2014 there are 7 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 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/resource-request/src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"572b3658bfea0bfe0f998d552ad869db8db2bd58cb75c5063a3c55c0652db61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-core/src/array/fixed_size_list_array.rs:271-276 | src/daft-core/src/array/list_array.rs:259-264 \u2014 before extracting anything, compare \u0060src/daft-core/src/array/fixed_size_list_array.rs\u0060 and \u0060src/daft-core/src/array/list_array.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"92262f4b6fff8cc402b562a0ccb5e26ff38e683a08dbde352b5f4457b3d3be22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-csv/src/read.rs:155-165 | src/daft-parquet/src/read.rs:401-411 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-parquet/src/read.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5e7f1f722bae77908addc6279c8cfc00033df412721a3204b788a7d7dc24fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/daft-decoding/src/deserialize.rs:217-224 | src/daft-json/src/decoding.rs:335-342 | src/daft-json/src/inference.rs:231-238 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060time_unit\u0060 to \u0060TimeUnit\u0060 in one and \u0060\u0026TimeUnit\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":"src/daft-decoding/src/deserialize.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed4fc9cb84ba7f4ce4b17390f5889f13930fe05c6b4071b8a146b435b1719b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-distributed/src/pipeline_node/limit.rs:216-221 | src/daft-local-execution/src/streaming_sink/limit.rs:116-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"src/daft-distributed/src/pipeline_node/limit.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcffc58ab1dd22b7b83e77bdc0805f0555b89e9ff3a642ea66733dee3d110911"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-distributed/src/scheduling/scheduler/default.rs:65-77 | src/daft-distributed/src/scheduling/scheduler/linear.rs:43-55 \u2014 before extracting anything, compare \u0060src/daft-distributed/src/scheduling/scheduler/default.rs\u0060 and \u0060src/daft-distributed/src/scheduling/scheduler/linear.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-distributed/src/scheduling/scheduler/default.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":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a8e2b29dea898623f8daaeee9f80321dfa6c9590e73611fa16ed4900d12654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-distributed/src/scheduling/scheduler/default.rs:79-86 | src/daft-distributed/src/scheduling/scheduler/linear.rs:57-64 \u2014 before extracting anything, compare \u0060src/daft-distributed/src/scheduling/scheduler/default.rs\u0060 and \u0060src/daft-distributed/src/scheduling/scheduler/linear.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3273daec81c5fb055f26b73954969f570d4b7e41faaa10772aa754a57d6934a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/daft-distributed/src/statistics/task_lifecycle.rs:24-30 | src/daft-local-execution/src/run.rs:320-326 | src/daft-local-execution/src/runtime_stats/mod.rs:64-70 \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":"src/daft-distributed/src/statistics/task_lifecycle.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b8a4ea56f91e9d34e1765be2230803e5e1e0472e77b4f3af3a6e349f34a13c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-dsl/src/python_udf/batch.rs:88-92 | src/daft-dsl/src/python_udf/row_wise.rs:84-88 \u2014 before extracting anything, compare \u0060src/daft-dsl/src/python_udf/batch.rs\u0060 and \u0060src/daft-dsl/src/python_udf/row_wise.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d473f34e0b68d87d8a5185568178934b26f197170222f81e548945786fd9769b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-ext-internal/src/aggregate.rs:21-27 | src/daft-ext-internal/src/function.rs:31-37 \u2014 before extracting anything, compare \u0060src/daft-ext-internal/src/aggregate.rs\u0060 and \u0060src/daft-ext-internal/src/function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"559fafffb0b1bb9caa7e7122df2d1d8efe79402bd913654121c99471e2b63a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-ext-internal/src/aggregate.rs:29-39 | src/daft-ext-internal/src/function.rs:40-50 \u2014 before extracting anything, compare \u0060src/daft-ext-internal/src/aggregate.rs\u0060 and \u0060src/daft-ext-internal/src/function.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 39 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other 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":"src/daft-ext-internal/src/aggregate.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b8f9f05327056ea4414fda6c7409c5ad794bfe87e7d58f0b5869815762ffab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): src/daft-functions/src/distance/cosine.rs:58-67 | src/daft-functions/src/distance/dot_product.rs:52-61 | src/daft-functions/src/distance/euclidean.rs:56-65 | src/daft-functions/src/similarity/cosine.rs:64-73 | src/daft-functions/src/similarity/jaccard.rs:66-75 | src/daft-functions/src/similarity/pearson.rs:73-82 \u2014 \u0060src/daft-functions/src/distance/cosine.rs\u0060 and \u0060src/daft-functions/src/similarity/cosine.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 31 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 \u0060src/daft-functions/src/distance/cosine.rs:58\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/distance/cosine.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b1bbb80d33f853c25966e316587b14aca055f0124f06fb1bee4dcd81c3a7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-functions/src/numeric/e.rs:39-47 | src/daft-functions/src/numeric/pi.rs:39-47 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions/src/numeric/e.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":"src/daft-functions/src/numeric/e.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e48061cb17d168cbc925f782573ec8a2a77736240d8b63fd386c51187f67cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): src/daft-io/src/azure_blob.rs:984-999 | src/daft-io/src/google_cloud.rs:664-679 | src/daft-io/src/s3_like.rs:1403-1418 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/daft-io/src/azure_blob.rs:984\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"683e115fee92df44538ae5f4cb9584db0c7b359ed403a58b5b65e129c8a19f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-local-execution/src/sinks/gather.rs:138-148 | src/daft-local-execution/src/sinks/into_partitions.rs:194-204 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/sinks/gather.rs:138\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/gather.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc69195060f9c4792c5bc0299e01b3f04b1e0023595a22556335471e581695d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 11): src/daft-logical-plan/src/ops/into_batches.rs:39-44 | src/daft-logical-plan/src/ops/into_partitions.rs:39-44 | src/daft-logical-plan/src/ops/monotonically_increasing_id.rs:60-65 | src/daft-logical-plan/src/ops/pivot.rs:86-91 | src/daft-logical-plan/src/ops/project.rs:92-97 | src/daft-logical-plan/src/ops/repartition.rs:39-44 | src/daft-logical-plan/src/ops/shuffle.rs:50-54 | src/daft-logical-plan/src/ops/sort.rs:73-78 | src/daft-logical-plan/src/ops/udf.rs:76-81 | src/daft-logical-plan/src/ops/vllm.rs:53-57 | src/daft-logical-plan/src/ops/window.rs:113-118 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 11 call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060crate) fn with_materialized_stats(mut\u0060 in one and \u0060mut\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, \u0060src/daft-logical-plan/src/ops/pivot.rs:95\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060src/daft-logical-plan/src/ops/into_partitions.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":"src/daft-logical-plan/src/ops/into_batches.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7f4c1eba1722343635e07cf2145049a6e43c7e37b0fffe7430ad70bc5cb537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-avro/src/lib.rs:48-53 | src/daft-json/src/lib.rs:45-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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060err\u0060 to \u0060AvroError\u0060 in one and \u0060Error\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":"src/daft-avro/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd18544c358f183aad554d0aaf8f6a8e8bcbd05a6e205dd9423a9f823c5f185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/daft-csv/src/read.rs:59-73 | src/daft-json/src/read.rs:57-71 \u2014 before extracting anything, compare \u0060src/daft-csv/src/read.rs\u0060 and \u0060src/daft-json/src/read.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 173 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-csv/src/read.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8be2e317f15b52af3dc94a060181294b7b0dad67d35482bce81c94a5843361"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-distributed/src/pipeline_node/actor_udf.rs:285-293 | src/daft-distributed/src/pipeline_node/vllm.rs:145-153 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/daft-distributed/src/pipeline_node/actor_udf.rs:285\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/actor_udf.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"19550d43de70e4f8e6e71350ab53b92f8d9f561592fbd63d52dae758234d0fb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-ext/src/aggregate.rs:160-164 | src/daft-ext/src/function.rs:93-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext/src/aggregate.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f789afbb77f624ee4771bf62e4163102dd4bf37f6d3eebcf7fc72454438c1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): src/daft-functions-list/src/max.rs:26-30 | src/daft-functions-list/src/mean.rs:27-31 | src/daft-functions-list/src/min.rs:23-27 | src/daft-functions-list/src/sum.rs:27-31 | src/daft-functions-list/src/value_counts.rs:24-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/max.rs:26\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/max.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"47a603d994bee2b3e1555ac847b2242d0594d6b93c8010aa3af3030e6c50f127"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 9): src/daft-functions-utf8/src/case.rs:33-102 | src/daft-functions-utf8/src/case.rs:33-66 | src/daft-functions-utf8/src/case.rs:33-72 | src/daft-functions-utf8/src/case.rs:33-78 | src/daft-functions-utf8/src/case.rs:33-84 | src/daft-functions-utf8/src/case.rs:33-90 | src/daft-functions-utf8/src/case.rs:33-96 | src/daft-functions-utf8/src/lower.rs:27-35 | src/daft-functions-utf8/src/upper.rs:27-35 \u2014 there are 9 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 9 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/case.rs:33\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060inputs\u0060 to \u0060FunctionArgs\u003CSeries\u003E\u0060 in one and \u0060daft_dsl::functions::FunctionArgs\u003CSeries\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":"src/daft-functions-utf8/src/case.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57d55efba7879ea81aa9c1aaacc68595dc3852270740e5c2095b9879c7dd94d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/daft-functions-utf8/src/contains.rs:23-27 | src/daft-functions-utf8/src/endswith.rs:27-31 | src/daft-functions-utf8/src/startswith.rs:27-31 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/daft-functions-utf8/src/contains.rs:23\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/contains.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74cc72160e8195d2171324ffbfab8a47fd74910f7fc822cadff3d1fd03b896d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/daft-functions-utf8/src/lstrip.rs:27-34 | src/daft-functions-utf8/src/rstrip.rs:27-34 | src/daft-functions-utf8/src/strip.rs:27-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/daft-functions-utf8/src/lstrip.rs:27\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/lstrip.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"526f863d354108b1e9d24b0addac9f5ae7d3c9a88df7b32eade71d22ace1385e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6): src/daft-functions/src/distance/cosine.rs:44-52 | src/daft-functions/src/distance/dot_product.rs:38-46 | src/daft-functions/src/distance/euclidean.rs:41-50 | src/daft-functions/src/similarity/cosine.rs:50-58 | src/daft-functions/src/similarity/jaccard.rs:51-60 | src/daft-functions/src/similarity/pearson.rs:58-67 \u2014 \u0060src/daft-functions/src/distance/cosine.rs\u0060 and \u0060src/daft-functions/src/similarity/cosine.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 31 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 \u0060src/daft-functions/src/distance/cosine.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/distance/cosine.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f3849f6fa8875d79f3ca4c335e0b7432589a5c11003da8f92ef4f3e32d0761"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-functions/src/hash.rs:107-117 | src/daft-functions/src/simhash.rs:172-181 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions/src/simhash.rs:172\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/hash.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd93b34703cb595ba3e5743d51bff9a7e3625d9e27cd48d787099d31db23869"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/daft-functions/src/monotonically_increasing_id.rs:28-36 | src/daft-functions/src/uuid.rs:50-58 | src/daft-functions/src/uuid.rs:96-104 \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 \u0060src/daft-functions/src/uuid.rs:50\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/monotonically_increasing_id.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"831601807f94c6819039c4a6597d1fe1a69feaf16057d42638c7f2d4a611d46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-io/src/gravitino.rs:318-323 | src/daft-io/src/unity.rs:211-216 \u2014 before extracting anything, compare \u0060src/daft-io/src/gravitino.rs\u0060 and \u0060src/daft-io/src/unity.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/gravitino.rs:318\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/gravitino.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"53991f413e12e32379f86933137358df0adb465a9fc95e321d5283430e82cdd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-micropartition/src/python.rs:270-278 | src/daft-recordbatch/src/python.rs:38-46 \u2014 before extracting anything, compare \u0060src/daft-micropartition/src/python.rs\u0060 and \u0060src/daft-recordbatch/src/python.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e2e1321d777507889444e6204079601e4ac7b464b64264e476346284388d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-micropartition/src/python.rs:460-469 | src/daft-recordbatch/src/python.rs:217-226 \u2014 before extracting anything, compare \u0060src/daft-micropartition/src/python.rs\u0060 and \u0060src/daft-recordbatch/src/python.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-micropartition/src/python.rs:460\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff06a05c3ebacb9dd80d9c390a4c1049169305c4907e3ea813fc8c9f391e3d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-micropartition/src/python.rs:1005-1009 | src/daft-recordbatch/src/python.rs:603-607 \u2014 before extracting anything, compare \u0060src/daft-micropartition/src/python.rs\u0060 and \u0060src/daft-recordbatch/src/python.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":1005}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f195ebdd50094a3f5113fbc1f2ee646ced29022749ebe843f1942f088fb6d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-micropartition/src/python.rs:1012-1016 | src/daft-recordbatch/src/python.rs:597-601 \u2014 before extracting anything, compare \u0060src/daft-micropartition/src/python.rs\u0060 and \u0060src/daft-recordbatch/src/python.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f81eccd25f7b3f305a13c5ea617ec1f28f2bf65d82afae07543fabf4ad23a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/daft-core/src/series/ops/agg.rs:456-471 | src/daft-core/src/series/ops/agg.rs:482-497 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/series/ops/agg.rs:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/ops/agg.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3304c6405dd1f3537ded810b0838410c2fdfa6201c5629adf9f8b16be847b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-sql/src/modules/temporal.rs:98-112 | src/daft-sql/src/modules/temporal.rs:169-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-sql/src/modules/temporal.rs:98\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"df852f1d6d3f8927449aa1968a6c0dd42dca6f5945cbdece8f25cb9e350a53ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-scan/src/glob.rs:275-288 | src/daft-scan/src/glob.rs:377-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 \u0060src/daft-scan/src/glob.rs:275\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-scan/src/glob.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b8e90b0cb52d8c4f9836284aa03d0a372faad495979a1d162a0c41f44e9ccb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/daft-core/src/python/series.rs:284-297 | src/daft-recordbatch/src/python.rs:451-464 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/python/series.rs:284\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/daft-core/src/python/series.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96883667d5a9d2cafff9006555d9908c9f15add2d2a770cc1e15d0fb7b53a62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/daft-functions-utf8/src/left.rs:38-49 | src/daft-functions-utf8/src/right.rs:45-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/left.rs:38\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/left.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e144501444ba2bdd2f2df4595afadef6684fc730b8e2ab749ba73b4767e16347"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/daft-functions-list/src/seq.rs:43-53 | src/daft-functions/src/numeric/bin.rs:37-43 | src/daft-functions/src/numeric/factorial.rs:37-43 \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 \u0060src/daft-functions-list/src/seq.rs:43\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"src/daft-functions-list/src/seq.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"968c2ee5ae6bda0d40f5af142810decafefa09e825463f69ff92a4c58ee82026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-functions-list/src/append.rs:52-62 | src/daft-functions-list/src/flatten.rs: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 both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/append.rs:52\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-functions-list/src/append.rs:51\u0060 calls \u0060required\u0060, \u0060to_field\u0060 and \u0060src/daft-functions-list/src/flatten.rs:40\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":"src/daft-functions-list/src/append.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac299d942f7f46edc6541bfff13788ebe7828895d8e8a0239af905319b6120f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-core/src/array/fixed_size_list_array.rs:180-190 | src/daft-core/src/array/list_array.rs:191-201 \u2014 before extracting anything, compare \u0060src/daft-core/src/array/fixed_size_list_array.rs\u0060 and \u0060src/daft-core/src/array/list_array.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/fixed_size_list_array.rs:180\u0060 it does not close everything it opens, so those exact 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, \u0060src/daft-core/src/array/list_array.rs:203\u0060 calls \u0060clone\u0060 and \u0060src/daft-core/src/array/fixed_size_list_array.rs:192\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":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5af2ba7aa2349179e908a0463fc60e24825a38be9fe7002946d231a73549b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/daft-core/src/series/ops/arithmetic.rs:245-255 | src/daft-core/src/series/ops/arithmetic.rs:341-351 | src/daft-core/src/series/ops/arithmetic.rs:440-444 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/series/ops/arithmetic.rs:245\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/ops/arithmetic.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"416a834f533870c79dbd92f997f8552ab0aec8072b5336565d592711123dfb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-ext-macros/src/types.rs:297-307 | src/daft-ext-macros/src/types.rs:330-340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-ext-macros/src/types.rs:297\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext-macros/src/types.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f505b30846424e6ab50866880eec9b56bfab61cf374173e9c825faff83ff12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-ext-macros/src/types.rs:147-157 | src/daft-ext-macros/src/types.rs:183-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-ext-macros/src/types.rs:147\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ext-macros/src/types.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"0381f6e137e3e1b69bf63ad5caaf6e24d0683752b2d67f85be3a2609aaf4238d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/common/io-config/src/goosefs.rs:172-182 | src/common/io-config/src/hdfs.rs:51-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060src/common/io-config/src/goosefs.rs:172\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/common/io-config/src/goosefs.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3190407eccab6c72d1998e0d2b2a3ac341e706db2c017fef40e9af8bd4865f1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/daft-core/src/array/fixed_size_list_array.rs:180-190 | src/daft-core/src/array/list_array.rs:191-201 | src/daft-core/src/array/struct_array.rs:238-245 \u2014 before extracting anything, compare \u0060src/daft-core/src/array/fixed_size_list_array.rs\u0060 and \u0060src/daft-core/src/array/list_array.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/fixed_size_list_array.rs:180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/daft-core/src/array/list_array.rs:203\u0060 calls \u0060clone\u0060 and \u0060src/daft-core/src/array/fixed_size_list_array.rs:192\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":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8653730be7eb29ed211047114b04a38bba1be9dc5f013b4a1f0ff191c3fb1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/daft-functions/src/numeric/exp.rs:40-50 | src/daft-functions/src/numeric/power.rs:45-55 | src/daft-functions/src/numeric/trigonometry.rs:44-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/daft-functions/src/numeric/exp.rs:40\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/numeric/exp.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"05af257169ee189acb03cb2eb75c6a2da59aa92cc34f46afc2e82abe739ed071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 8): src/daft-functions-utf8/src/left.rs:83-92 | src/daft-functions-utf8/src/regexp_extract.rs:86-95 | src/daft-functions-utf8/src/repeat.rs:88-98 | src/daft-functions-utf8/src/replace.rs:132-141 | src/daft-functions-utf8/src/right.rs:90-99 | src/daft-functions-utf8/src/split_part.rs:102-111 | src/daft-functions-utf8/src/substring_index.rs:100-109 | src/daft-functions-utf8/src/translate.rs:83-92 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/left.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f84faecd747c8371470633f9e21482893be2a620bf855d13961aec1c1155ef60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-io/src/s3_like.rs:897-906 | src/daft-io/src/s3_like.rs:1092-1102 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-io/src/s3_like.rs:897\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/s3_like.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8021727f593d7cab16a979f1355a7836f5eb4a0841d3e22238e6b9bfb8be1d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-image/src/functions/decode.rs:86-96 | src/daft-image/src/functions/decode_image_file.rs:124-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-image/src/functions/decode.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":"src/daft-image/src/functions/decode.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca420a09393d2523d64129d13f336e0ed0c4585f26995ca254af904a7a456f40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/daft-parquet/src/reader/chunk_source.rs:433-443 | src/daft-parquet/src/reader/chunk_source.rs:449-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 \u0060src/daft-parquet/src/reader/chunk_source.rs:433\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/reader/chunk_source.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"a334cfb5c457abcadce74fbaae1880759b37b166f737a230cd80b631a639cc7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-functions-binary/src/encode.rs:36-45 | src/daft-functions-binary/src/encode.rs:91-99 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-binary/src/encode.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0391d732da797946a1c9ff851df69311d4817c3d2b9978549bbcb01dd67dbe50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/daft-functions-temporal/src/time.rs:160-169 | src/daft-functions-temporal/src/time.rs:244-250 | src/daft-functions-temporal/src/time.rs:325-331 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-temporal/src/time.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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-functions-temporal/src/time.rs:243\u0060 calls \u0060parse_timezone\u0060 and \u0060src/daft-functions-temporal/src/time.rs:159\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":"src/daft-functions-temporal/src/time.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe8c0cff1e77b89657bf55f2bf4d82d6144b352fdcd5a7c5379f18fc94cd624"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-catalog/src/python/wrappers.rs:119-128 | src/daft-catalog/src/python/wrappers.rs:192-198 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-catalog/src/python/wrappers.rs:119\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7dab8a7ea4b4ffd02e5f8dd9be0bcba934ad13327015f791f78f46317b120a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-catalog/src/impls/memory.rs:424-433 | src/daft-catalog/src/table.rs:164-173 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-catalog/src/impls/memory.rs:424\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/impls/memory.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96867e42fe93cec1081dd07bf5e7b1c47caa9c721f987c47938242e8490e718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-avro/src/python.rs:69-78 | src/daft-json/src/python.rs:68-77 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-avro/src/python.rs:69\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-avro/src/python.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a74b152d8713c6b7bb526aee29f31426db0c1910d59aec3bb266fcd8bb0ddc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-functions-utf8/src/split_part.rs:49-58 | src/daft-functions-utf8/src/substring_index.rs:47-56 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/split_part.rs:49\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0057762c9a054cdbc2bae23fa2be2a22dfd7d5da60046c9f53d241abf91096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-parquet/src/reader/field_reader.rs:498-507 | src/daft-parquet/src/reader/field_reader.rs:610-618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-parquet/src/reader/field_reader.rs:498\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/reader/field_reader.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4dc843d21a5dcbe73c9a03156681e9fea58c7bb13daefc58cee06c6696ce08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/daft-dashboard/src/client.rs:124-133 | src/daft-dashboard/src/client.rs:138-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dashboard/src/client.rs:124\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/client.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"034f9a7085f6b65354cea5556cec1795bb854f194463f20e8e8d928355f2ffa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-ai/src/python.rs:25-31 | src/daft-catalog/src/python/wrappers.rs:33-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-ai/src/python.rs:25\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-ai/src/python.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3b7878294eeff389ab582ac25ea18c1dfdc94629bd89382c1d1a047beb596b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/daft-local-execution/src/sources/scan_task.rs:405-413 | src/daft-micropartition/src/micropartition.rs:494-502 | src/daft-recordbatch/src/lib.rs:1980-1988 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b12ff99e612d910daef474126a729d16a20149dac38cbe5272a76ea28982f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): src/daft-local-execution/src/concat.rs:134-142 | src/daft-local-execution/src/intermediate_ops/intermediate_op.rs:342-350 | src/daft-local-execution/src/join/join_node.rs:89-97 | src/daft-local-execution/src/sinks/blocking_sink.rs:490-498 | src/daft-local-execution/src/streaming_sink/base.rs:475-483 \u2014 before extracting anything, compare \u0060src/daft-local-execution/src/join/join_node.rs\u0060 and \u0060src/daft-local-execution/src/sinks/blocking_sink.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-local-execution/src/concat.rs:134\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/concat.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0807d454c1277d16d2e764aa2251e6101120f8eec3ea750907cc1374d53eba4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-dashboard/src/engine.rs:332-340 | src/daft-dashboard/src/engine.rs:366-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dashboard/src/engine.rs:332\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"4110159571ca51c0cb10713f1e74990dcc7380f86d2bcc0a28d28224b248d9d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-dashboard/src/engine.rs:940-948 | src/daft-dashboard/src/engine.rs:969-976 \u2014 both copies are in the same file, so extract the block 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":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee568a37706cf5f0df5f941faf1496975e724ec1b65a985ad24fb9f07629388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-core/src/array/ops/cast.rs:1579-1587 | src/daft-core/src/array/ops/cast.rs:1693-1701 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/array/ops/cast.rs:1579\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5cd89ed2e313606c894fe3afe7a755e95c04a69ed02431b273068c48b8ceeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-core/src/datatypes/agg_ops.rs:74-82 | src/daft-core/src/datatypes/agg_ops.rs:87-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/datatypes/agg_ops.rs:74\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/agg_ops.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebeff58f984753d9819983220793a78bb39b3d611b9c14df448793f0faeff7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/daft-sql/src/modules/config.rs:109-116 | src/daft-sql/src/modules/config.rs:280-287 | src/daft-sql/src/modules/config.rs:415-422 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-sql/src/modules/config.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"7082802db1add7b3ff0042ed8a10a09aa8531343207b3ec76f189094782f58cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-logical-plan/src/builder/resolve_expr.rs:51-57 | src/daft-logical-plan/src/builder/resolve_expr.rs:61-68 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/builder/resolve_expr.rs:51\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/resolve_expr.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"8462fd95872074abd72d336718d399ce9eef2d2efe44fd0803a180cc26304391"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-image/src/functions/resize.rs:21-28 | src/daft-image/src/functions/resize.rs:31-38 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-image/src/functions/resize.rs:21\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-image/src/functions/resize.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a6826d2801b446fb11d48d96710d8af9621d3e8c2f023e3b9360de9259c2a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-avro/src/python.rs:33-40 | src/daft-csv/src/python.rs:65-72 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-avro/src/python.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7ba60a759cb483ebff56655655cf8f9d7e01c103d160cf6e48dd7370a3d7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-avro/src/write.rs:112-119 | src/daft-avro/src/write.rs:153-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/daft-avro/src/write.rs:111\u0060 calls \u0060new_empty\u0060 and \u0060src/daft-avro/src/write.rs:151\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":"src/daft-avro/src/write.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"679dc4af6779628a844de85f9df841f8c1a8afb082fddf26f9d482ff5c22b806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-core/src/datatypes/infer_datatype.rs:208-215 | src/daft-core/src/datatypes/infer_datatype.rs:484-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 \u0060src/daft-core/src/datatypes/infer_datatype.rs:208\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35d3c7fba89c0a7082524721ef2b7b742c6881601bbe435466e46d8f02128b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-core/src/datatypes/infer_datatype.rs:239-246 | src/daft-core/src/datatypes/infer_datatype.rs:345-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/datatypes/infer_datatype.rs:239\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"1354fe74e5d5087f12043fba4fcc810e7f93a68c641105d20d03abcc3139fdfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9): src/daft-sql/src/modules/temporal.rs:361-365 | src/daft-sql/src/modules/temporal.rs:393-397 | src/daft-sql/src/modules/temporal.rs:425-429 | src/daft-sql/src/modules/temporal.rs:612-619 | src/daft-sql/src/modules/temporal.rs:816-823 | src/daft-sql/src/modules/temporal.rs:865-869 | src/daft-sql/src/modules/temporal.rs:898-902 | src/daft-sql/src/modules/temporal.rs:932-939 | src/daft-sql/src/modules/temporal.rs:977-981 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/temporal.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"487b121ce04f09a327d4cc945e11cd212d8201e21881b8b40d8aed4380073040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-core/src/datatypes/infer_datatype.rs:297-304 | src/daft-core/src/datatypes/infer_datatype.rs:355-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/datatypes/infer_datatype.rs:297\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"7770551c2d06eb185579886ce7a15bd24cf6beff46665f3b7fb8b198a30c293b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/daft-functions-temporal/src/date_arithmetic.rs:180-187 | src/daft-functions-temporal/src/date_arithmetic.rs:249-256 | src/daft-functions-temporal/src/date_arithmetic.rs:396-403 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-temporal/src/date_arithmetic.rs:180\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-temporal/src/date_arithmetic.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f272675c1a9a24c9c4c44569c06f0e5520e81e2409a656960ee419fdcca8d970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-micropartition/src/python.rs:792-799 | src/daft-micropartition/src/python.rs:853-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 \u0060src/daft-micropartition/src/python.rs:792\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bef6d04463b8f59af04e0afdd436c3ec9c9aa4f1d2863843fd479ef398bcd74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-core/src/datatypes/infer_datatype.rs:498-505 | src/daft-core/src/datatypes/infer_datatype.rs:512-519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"9570d29a7ac529b30ea1d448e10c06d1d70d330f56bf311f82fd5b615162ec85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/daft-functions/src/numeric/hypot.rs:42-54 | src/daft-functions/src/numeric/trigonometry.rs:166-178 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions/src/numeric/hypot.rs:42\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/numeric/hypot.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf7189efecd70a0a69341c8ef18b2d51313a4416549ac5cee9755ae83ef3e13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-functions-list/src/explode.rs:45-51 | src/daft-functions-list/src/flatten.rs:37-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-list/src/explode.rs:45\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"src/daft-functions-list/src/explode.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e57ec2c2c159220e6fd90aa94a9c860a1f85554c91c296bd1bd2f00c8c3e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-functions-utf8/src/split_part.rs:69-75 | src/daft-functions-utf8/src/substring_index.rs:67-73 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/split_part.rs:69\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25e2e2849aca5608f7241a47f803fff76696a66700812dc7eef37a32d4015c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-dsl/src/treenode.rs:13-19 | src/daft-local-plan/src/plan.rs:1959-1965 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060src/daft-dsl/src/treenode.rs:13\u0060 it begins part-way through the construct above it, so those exact lines 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 \u0060children\u0060 to \u0060Vec\u003CExprRef\u003E\u0060 in one and \u0060Vec\u003CArc\u003CSelf\u003E\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":"src/daft-dsl/src/treenode.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdeebba071ba3f3f3c92e1b2295a0f0969df8adff6da6fe98c1d8c2ec3597ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/daft-dsl/src/python_udaf.rs:63-69 | src/daft-dsl/src/python_udaf.rs:97-103 | src/daft-dsl/src/python_udaf.rs:130-136 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/python_udaf.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":"src/daft-dsl/src/python_udaf.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc271101522b13a9b8fb1e3e9e1ec74c6277473471eff88f3d41e0e85c26751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-logical-plan/src/partitioning.rs:139-145 | src/daft-logical-plan/src/partitioning.rs:399-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-logical-plan/src/partitioning.rs:139\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/partitioning.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbacb25bd3cbc4038faa0e3cbbfe8e4be6ae45613cfa0c21d0866da55f7927f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-catalog/src/python/wrappers.rs:70-76 | src/daft-catalog/src/python/wrappers.rs:140-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-catalog/src/python/wrappers.rs:70\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ada6aec5d2a995895fb927e2da73bc608c079a6ad90b4c93f9bc024cf545c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-dsl/src/expr/mod.rs:708-713 | src/daft-dsl/src/expr/mod.rs:716-721 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dsl/src/expr/mod.rs:708\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5e3e286f567e2d435a5ba6dd9173bf160f5351deb7f0de6011d815464a9bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-functions-utf8/src/split_part.rs:39-44 | src/daft-functions-utf8/src/substring_index.rs:37-42 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/split_part.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/split_part.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fce969292b8ef8affa5b16210e3f694b48a8ce7e0096e40190f6ff82be4bf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/daft-functions-utf8/src/left.rs:125-130 | src/daft-functions-utf8/src/repeat.rs:115-120 | src/daft-functions-utf8/src/right.rs:136-141 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060src/daft-functions-utf8/src/left.rs:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/left.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6eebc40e121fbea81c8f62e84b16afeae0550ecaa35f361b9d3f47b968662b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-core/src/series/from_lit.rs:348-352 | src/daft-core/src/series/from_lit.rs:369-374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-core/src/series/from_lit.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under 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":"src/daft-core/src/series/from_lit.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c075bbb6bd8680d76d6c0ba2fe96676522aff78bebd893916958ad3bd99b09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-sql/src/table_provider/read_csv.rs:47-52 | src/daft-sql/src/table_provider/read_json.rs:58-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/read_csv.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0a0a3074ab3a37243586bc6a3a66c499e8f76b24442801c6c77295cd2ab93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/daft-micropartition/src/python.rs:1075-1080 | src/daft-micropartition/src/python.rs:1112-1117 | src/daft-micropartition/src/python.rs:1149-1154 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-micropartition/src/python.rs:1075\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4840535452eef148ad19875d374c89a8285eb71b87e954b5a8efdbae5d54e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-sql/src/modules/image/resize.rs:20-25 | src/daft-sql/src/modules/image/resize.rs:32-37 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-sql/src/modules/image/resize.rs:20\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/image/resize.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b974f7b0200743a5460f851276350374a1f52d68f9de0458ab2564980d4a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/daft-catalog/src/python/wrappers.rs:61-66 | src/daft-catalog/src/python/wrappers.rs:80-85 | src/daft-catalog/src/python/wrappers.rs:150-155 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-catalog/src/python/wrappers.rs:61\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/python/wrappers.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"527863b93bd3fb81330c29ad5128a8ded7a7fea6733f783776071a0ca029a727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/daft-dsl/src/expr/mod.rs:699-703 | src/daft-dsl/src/expr/mod.rs:707-711 | src/daft-dsl/src/expr/mod.rs:715-719 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"978eb66afcbe846e03af6852c206cbe2e6157662259975cdaf9e94181cc48779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-micropartition/src/python.rs:1028-1032 | src/daft-micropartition/src/python.rs:1097-1101 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-micropartition/src/python.rs:1028\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca231c0ddb9e29ab5f19bb01f80821cd71493533e7e5d0f57852765b5cc9e79d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): src/daft-functions-utf8/src/replace.rs:95-99 | src/daft-functions-utf8/src/split_part.rs:68-72 | src/daft-functions-utf8/src/substring_index.rs:66-70 | src/daft-functions-utf8/src/translate.rs:53-57 \u2014 before extracting anything, compare \u0060src/daft-functions-utf8/src/split_part.rs\u0060 and \u0060src/daft-functions-utf8/src/substring_index.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 87 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-functions-utf8/src/replace.rs:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-utf8/src/replace.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8fac482e76646d7b3013928d6901db26bffd0e420f8535310422c0d08715d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-core/src/array/ops/full.rs:148-152 | src/daft-core/src/array/ops/full.rs:178-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/full.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc91173c7ef125bb83a22a1ac4031495193ba44efd186badad906ea3dd4316a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-core/src/datatypes/infer_datatype.rs:575-583 | src/daft-core/src/utils/supertype.rs:56-64 \u2014 before extracting anything, compare \u0060src/daft-core/src/datatypes/infer_datatype.rs\u0060 and \u0060src/daft-core/src/utils/supertype.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9441429894b6c47e290e7923b795bca792faacebc5492fbe8089b53073958bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-core/src/datatypes/infer_datatype.rs:586-594 | src/daft-core/src/utils/supertype.rs:68-76 \u2014 before extracting anything, compare \u0060src/daft-core/src/datatypes/infer_datatype.rs\u0060 and \u0060src/daft-core/src/utils/supertype.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"05784e9c75497a0ec51bf7f92015e3ebad3bdf50e5c27f22d51e0b54fa11a0e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-core/src/datatypes/infer_datatype.rs:597-604 | src/daft-core/src/utils/supertype.rs:81-88 \u2014 before extracting anything, compare \u0060src/daft-core/src/datatypes/infer_datatype.rs\u0060 and \u0060src/daft-core/src/utils/supertype.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cbc021c5c0f4c35da179821d74a9aa5a25aefc7145723bb0e8d9efecc4ba1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/daft-core/src/datatypes/infer_datatype.rs:607-613 | src/daft-core/src/utils/supertype.rs:94-100 \u2014 before extracting anything, compare \u0060src/daft-core/src/datatypes/infer_datatype.rs\u0060 and \u0060src/daft-core/src/utils/supertype.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa94f710ffd90dc00e870977b78cf69b76658ef942f9744aec28216591dbf35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-core/src/lit/deserializer.rs:301-306 | src/daft-core/src/lit/deserializer.rs:352-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/lit/deserializer.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"2300182d74372f099fbffd93af8d21ada4825be2cfbe5025da61564173275c39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/daft-dashboard/src/engine.rs:402-409 | src/daft-dashboard/src/engine.rs:430-437 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-dashboard/src/engine.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":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"feac3021a5f6a77bb39558637bd9bfa1d682fcb9075d13ab4ca96a75853023ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/daft-io/src/lib.rs:174-179 | src/daft-io/src/lib.rs:186-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/lib.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5149edd611c5e7664679478bcc1f369b2cdffa2d7c4e99379be9902b76c26f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-local-execution/src/run.rs:636-640 | src/daft-local-execution/src/run.rs:650-654 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/run.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"92298b00e625ca785e08cafb63a8dc9d7c7d528e3362a1024200f3ea1e523ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/daft-recordbatch/src/ops/inline_agg.rs:952-956 | src/daft-recordbatch/src/ops/inline_agg.rs:1041-1045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/inline_agg.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"da39027e5a373bff5ae90d72da7d6902cb46401f900357066e2f34d297a1ea7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/daft-writers/src/lance.rs:40-44 | src/daft-writers/src/pyarrow.rs:220-224 | src/daft-writers/src/sink.rs:40-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/lance.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aea49c4453086b035974ba05ab8c75299375c431269c5796f5c98116ca3e596"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39\u201369 lines \u00D7 3): daft/dataframe/dataframe.py:1125-1193 | daft/dataframe/dataframe.py:1238-1298 | daft/dataframe/dataframe.py:1338-1376 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":1125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3261ba1dde21be9f69e40e1b0902886f6b1e480c9734cb73ed484ea6b29411fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201352 lines \u00D7 2): daft/catalog/__gravitino/_client.py:228-279 | daft/catalog/__gravitino/_client.py:310-360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__gravitino/_client.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d72a5d803a788425573866706b30bc94092c1619e07290852d3bf9da6453eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33\u201335 lines \u00D7 2): daft/functions/datetime.py:1715-1747 | daft/functions/datetime.py:1759-1793 \u2014 both copies are in the same file, so extract the block 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":"daft/functions/datetime.py"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb41fbb9faee0448446d2779fce6ffc493af067b5b566e7662019c3c6ecff6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): benchmarking/vllm/continuous-batch-sorted.py:20-52 | benchmarking/vllm/continuous-batch.py:19-51 \u2014 before extracting anything, compare \u0060benchmarking/vllm/continuous-batch-sorted.py\u0060 and \u0060benchmarking/vllm/continuous-batch.py\u0060 as WHOLE FILES: 92% 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060benchmarking/vllm/continuous-batch-sorted.py:19\u0060 calls \u0060sort\u0060 and \u0060benchmarking/vllm/continuous-batch.py:18\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":"benchmarking/vllm/continuous-batch-sorted.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7920b944499c853ab463679ff16c91d3ff7c2f5d6a7caed8691de3c4a138c2f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 4): daft/recordbatch/micropartition.py:221-246 | daft/recordbatch/micropartition.py:428-453 | daft/recordbatch/recordbatch.py:264-289 | daft/recordbatch/recordbatch.py:441-466 \u2014 before extracting anything, compare \u0060daft/recordbatch/micropartition.py\u0060 and \u0060daft/recordbatch/recordbatch.py\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/micropartition.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"2201397ba6c5e6d78efee06889c408f3f77b56b41c2bb26377340e45a3bb4ca3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): benchmarking/tpch/answers.py:616-646 | benchmarking/tpch/answers_sql.py:33-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"benchmarking/tpch/answers.py"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce02a4c7d28cfe9e5db322c991672440623ff12f9f5099048c765f97454dacd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): daft/dataframe/dataframe.py:99-119 | daft/dataframe/dataframe.py:857-877 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4761867ce46b52572dd16f00fa6704da4a2391c5413c6b4b008d16d3b8477271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): daft/dataframe/dataframe.py:6222-6241 | daft/dataframe/dataframe.py:6321-6340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":6222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a358fdb873e0af71f2af0bc0359a52123d06e1906b6d65384a94641faa653ceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): benchmarking/vllm/continuous-batch.py:14-31 | benchmarking/vllm/prefix-bucketing.py:14-31 \u2014 before extracting anything, compare \u0060benchmarking/vllm/continuous-batch.py\u0060 and \u0060benchmarking/vllm/prefix-bucketing.py\u0060 as WHOLE FILES: 91% 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. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060benchmarking/vllm/continuous-batch.py:14\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/vllm/continuous-batch.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"803e69f4c6899e7deff75f8613e5bf0b6d406141d8dffe7d61b361406524aa92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 4): daft/dataframe/dataframe.py:1093-1109 | daft/dataframe/dataframe.py:1208-1225 | daft/dataframe/dataframe.py:1310-1326 | daft/dataframe/dataframe.py:1384-1400 \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 \u0060daft/dataframe/dataframe.py:1093\u0060 it begins part-way through the construct above it, so those exact 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060daft/dataframe/dataframe.py:1206\u0060 calls \u0060from_str\u0060 and \u0060daft/dataframe/dataframe.py:1092\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":"daft/dataframe/dataframe.py"},"region":{"startLine":1093}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fc62fa5bfdf2dc6c7ffb09c2a19d38e4cfd1f2c0c63300cdc8062b39533b10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): benchmarking/vllm/naive-batch-sorted.py:45-61 | benchmarking/vllm/naive-batch.py:44-60 \u2014 before extracting anything, compare \u0060benchmarking/vllm/naive-batch-sorted.py\u0060 and \u0060benchmarking/vllm/naive-batch.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060benchmarking/vllm/naive-batch-sorted.py:44\u0060 calls \u0060sort\u0060 and \u0060benchmarking/vllm/naive-batch.py:43\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":"benchmarking/vllm/naive-batch-sorted.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88e72ca1b72865b822b24bcd9ad5f8edf06840d73c272ee466add2b9280eed6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): daft/api_annotations.py:25-40 | daft/api_annotations.py:44-59 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/api_annotations.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7e58e04e76fc179c4f62a5c8b11158e456487451e3db7c54686669f7f5fd26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): daft/recordbatch/recordbatch_io.py:318-329 | daft/recordbatch/recordbatch_io.py:390-402 | daft/recordbatch/recordbatch_io.py:451-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 \u0060daft/recordbatch/recordbatch_io.py:318\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/recordbatch_io.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda3c005425f187129f2b1cbe724c790b3d5b8739f94f42507bd73806c8ac5d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): daft/ai/google/protocols/prompter.py:162-174 | daft/ai/openai/protocols/prompter.py:248-260 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"daft/ai/google/protocols/prompter.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30e67b8d6f4c8c7e0c9b90c4018d08e448bc9335839d518fbca7287d1d36ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): daft/catalog/__postgres.py:608-620 | daft/catalog/__postgres.py:640-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a7097fbee66acea32a38437035bcad047a03f2628a63d29683dcc7e077c1cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): daft/catalog/__postgres.py:417-428 | daft/catalog/__postgres.py:432-443 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f93b2ba7552fa7f19c8dae893b6b904e55d79a57471abb3321a3b8e4e24da72f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): daft/recordbatch/micropartition.py:315-326 | daft/recordbatch/micropartition.py:346-357 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060daft/recordbatch/micropartition.py:315\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"daft/recordbatch/micropartition.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aca476479b86e6f2f3631dfc4dcbdc15a7f5b29067b1077ba3ef16ddd04b97a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): daft/recordbatch/recordbatch.py:342-353 | daft/recordbatch/recordbatch.py:367-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060daft/recordbatch/recordbatch.py:342\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"daft/recordbatch/recordbatch.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"66552b44faa411c7e19514219cc3f64601735a567e43ad6142a8370925e0d654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): daft/udf/execution.py:88-99 | daft/udf/execution.py:117-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. 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":"daft/udf/execution.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2768f5577f916251bb618df046164d9a4bd396881cdada97ed1b53003715af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): daft/ai/lm_studio/protocols/text_embedder.py:69-77 | daft/ai/openai/protocols/text_embedder.py:137-147 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060daft/ai/openai/protocols/text_embedder.py:137\u0060 it does not close everything it opens, so those exact 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":"daft/ai/lm_studio/protocols/text_embedder.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e571b9bbb1cb9088fe3c66c8e0e48cdfc6ab0922d11f765888aa81b51075fb07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): daft/io/_sql.py:266-276 | daft/io/_sql.py:333-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":"daft/io/_sql.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c6befc540cb8dca64d3e0f83912c3aeead0ef60f8afa8632c572895e82dc806"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): daft/io/writer.py:183-191 | daft/io/writer.py:315-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"daft/io/writer.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ecbd0fea390e228b47a01c173cd880a3b9cbeee51a23447ba34a84ed19a30f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): daft/io/writer.py:376-383 | daft/io/writer.py:443-450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"daft/io/writer.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88b6871557603abec6b7c9547cfd266284fe35588dd835e2002378a3267b645"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): benchmarking/tpch/answers.py:541-548 | benchmarking/tpch/answers.py:551-558 | benchmarking/tpch/answers.py:561-568 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060benchmarking/tpch/answers.py:541\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/tpch/answers.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ec59c25684c3c008c40f6f6a60b4432bb22a8492243cbcd784177951d67ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): benchmarking/tpch/answers.py:127-133 | benchmarking/tpch/answers.py:166-172 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060benchmarking/tpch/answers.py:127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/tpch/answers.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3974e54527a6b815f6636a80ab1e61ad6b0a688df9fc5605fe8748d16f16e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): daft/catalog/__glue.py:487-493 | daft/catalog/__gravitino/_catalog.py:199-205 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060daft/catalog/__glue.py:487\u0060 it does not close everything it opens, so those exact 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":"daft/catalog/__glue.py"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d9dea6f1e14ea65ccb7184f041f4465442119b1c1cdb220e500e7f19c972f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (56 lines \u00D7 2): daft/functions/distance.py:9-65 | daft/functions/similarity.py:9-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/functions/distance.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"07eddaa9a8dd0c817f3b5992b156aab3364ad6fb46b015f179416fe42d3362f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): benchmarking/ai/video_object_detection/daft_main.py:41-48 | benchmarking/ai/video_object_detection/ray_data_main.py:27-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/ai/video_object_detection/daft_main.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"460125a1775996d47d7695e89cd1ff921df44b19d19b5e7e5ed3e8b55c6da23f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): benchmarking/vllm/naive-batch-sorted.py:17-25 | benchmarking/vllm/naive-batch.py:17-25 \u2014 before extracting anything, compare \u0060benchmarking/vllm/naive-batch-sorted.py\u0060 and \u0060benchmarking/vllm/naive-batch.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/vllm/naive-batch-sorted.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8792b8fca805229054aa03cf19fbfcdf94513742d8e247be4e6817f10c179e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): benchmarking/vllm/naive-batch-sorted.py:29-33 | benchmarking/vllm/naive-batch.py:29-33 \u2014 before extracting anything, compare \u0060benchmarking/vllm/naive-batch-sorted.py\u0060 and \u0060benchmarking/vllm/naive-batch.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"benchmarking/vllm/naive-batch-sorted.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"328168ad09e50fa5fa925624d09995da85d2a48177d500f8a5785151c62d14f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): daft/ai/google/protocols/prompter.py:182-189 | daft/ai/openai/protocols/prompter.py:310-317 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/ai/google/protocols/prompter.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f23e60050f9fd10d18cb2122a0f25ea69e7db75fd71f78443246542d9c0814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): daft/ai/transformers/protocols/image_classifier.py:46-50 | daft/ai/transformers/protocols/text_classifier.py:50-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/ai/transformers/protocols/image_classifier.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"63afbb7b32b2d056698be8d7370e36439bb31eae445b5e7538de47b8ad36f4c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): daft/ai/transformers/protocols/image_embedder.py:46-50 | daft/ai/transformers/protocols/text_embedder.py:58-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. 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":"daft/ai/transformers/protocols/image_embedder.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b1c80d9757e5161a64cff0f6391be044ca6df5e571527b0f75f57131850a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): daft/ai/google/protocols/prompter.py:44-51 | daft/ai/openai/protocols/prompter.py:66-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. 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":"daft/ai/google/protocols/prompter.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"764c9e88b266432c083572e3810f1d32ac521ae323096ea09f50fed2e35b1b22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): daft/catalog/__gravitino/_catalog.py:39-44 | daft/catalog/__iceberg.py:56-61 | daft/catalog/__unity/_catalog.py:34-39 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The 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":"daft/catalog/__gravitino/_catalog.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a754a95cc8fb0d2c41f0f6454242d763f6dc41aab0a918547a0f1ce629850f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): daft/recordbatch/micropartition.py:132-137 | daft/recordbatch/recordbatch.py:148-153 \u2014 before extracting anything, compare \u0060daft/recordbatch/micropartition.py\u0060 and \u0060daft/recordbatch/recordbatch.py\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. 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 \u0060to_merge\u0060 to \u0060list[MicroPartition]\u0060 in one and \u0060list[RecordBatch]\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":"daft/recordbatch/micropartition.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a18af5ae4db7015ae1312220477db57cbd63a089c48aa52c98c69d0cfe4446b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): daft/recordbatch/micropartition.py:373-380 | daft/recordbatch/recordbatch.py:388-394 \u2014 before extracting anything, compare \u0060daft/recordbatch/micropartition.py\u0060 and \u0060daft/recordbatch/recordbatch.py\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. 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 \u0060exprs\u0060 to \u0060Iterable[Expression]\u0060 in one and \u0060ExpressionsProjection\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":"daft/recordbatch/micropartition.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e05c13d1f2bd1b0cff4834eb12884848daa8302eb87d533341820ba3db7bd21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/daft-checkpoint/src/test_utils.rs:317-325 | src/daft-checkpoint/src/test_utils.rs:330-338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/daft-checkpoint/src/test_utils.rs:317\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-checkpoint/src/test_utils.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f503ea46011177b3d8d7c041bb54ded323b5f3abf1566a9e9ee3fe3e62e2823"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project daft-distributed: daft-distributed has instability 0.96 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55954536ab5fcf3ee6be9d32407956d44e5a6d7c9fa9c3b66d83512be4cf7176"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project daft-functions-tokenize: daft-functions-tokenize has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"2d815e21f5f826821ad6a45f6a70fb554e3c92cc2a7cec102c9f0f2cf6de5bbf"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project daft-local-execution: daft-local-execution has instability 0.97 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d84732f43927f47d5a1c69b3fc21aedfd3cab70ca40370ccf6d7d443da9420b3"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project daft-local-plan: daft-local-plan has instability 0.83 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"17f02ba623fd583280b611b1076675aeb1054e376a3bed3114d0f847ac9c5b38"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project daft-mcap: daft-mcap has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7619fb795281fd5874403217f8f9542511de8acb978f7eb3e4d4b161a1880d5a"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project daft-sql: daft-sql has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a153fc79e64e3d31d754911bc626e2a0f30aa8ca66c6e86eefe91a723f9cbd49"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: hyperloglog: hyperloglog: 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":"ba8078ffee29af6948a8d0a96160b486ade5814301ab1a69259db1ed37169abe"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: daft-io: daft-io: abstractness 0.04, instability 0.18, distance 0.77 \u2014 zone of pain \u2014 concrete and depended on by 18 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ab37d65dfc8cab63c9b128a8ed015565b66cadb43d6bc7d8ffcbdf04f1cd967f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: daft-hash: daft-hash: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9cd549cf19d87069e220832ff8dc5783b58298fd9b325660a08152766a343aa5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: daft-schema: daft-schema: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 15 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"694717e389ff4f5e6204d5264798c291f0f73080ef7709836de0f160e9702de3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WindowSpec (LCOM4 5): WindowSpec\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":"src/daft-dsl/src/expr/window.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"1665cb3f5f3c31054eb5728ae45b243d98170f914bebb51559cba4ba313f5563"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Series (LCOM4 4): Series\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":"src/daft-core/src/series/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"415b8b64156ccf195faa78a06e5dd99c59853dccd1d50d828c5a8f2241a9d45d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WriteSink (LCOM4 4): WriteSink\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":"src/daft-local-execution/src/sinks/write.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ad0f62519fc45f7df0c725cd734e5bf535e59bbb622a44c975d11551650a52"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VLLMSink (LCOM4 4): VLLMSink\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":"src/daft-local-execution/src/streaming_sink/vllm.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49986df21590637f26f28ee1ad603ea4330706c66c651ecd697c4ad7bf2800d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Source (LCOM4 4): Source\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":"src/daft-logical-plan/src/ops/source.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a716ce2c5ae48df4f433ca154f2a47d94187eda3857a0491193f8a718e07108"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: sample_data: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022Bigtable emulator is disabled in CI because its startup is flaky.\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/io/test_bigtable_integration.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"428d7ed0e97eacaf455fc0cbb7cbd507af397afd42c6860859bb2cdb4012d03d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/daft-sql/src/planner.rs: src/daft-sql/src/planner.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 136 in SQLPlanner::plan_expr at line 1645. 1 of those changes was a fix/bug commit, and the other 3 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 21:24:03 -08:00\u0027 --until=\u00272026-11-08 21:24:03 -08:00\u0027 --full-history --no-merges -- src/daft-sql/src/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":"src/daft-sql/src/planner.rs"},"region":{"startLine":1645}}}],"partialFingerprints":{"codehealthFindingId/v1":"61074b8b2dbe5c81de888018a752302101d4e49c9f8949c43a018f0c9542a51a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: daft/dataframe/dataframe.py: daft/dataframe/dataframe.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in DataFrame.write_lance at line 2424. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 21:24:03 -08:00\u0027 --until=\u00272026-11-08 21:24:03 -08:00\u0027 --full-history --no-merges -- daft/dataframe/dataframe.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":2424}}}],"partialFingerprints":{"codehealthFindingId/v1":"085b98483f3212e4d38cabcdeb898e89f0db6b162497625dfd8048c2832ec8e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/daft-scan/src/glob.rs: src/daft-scan/src/glob.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in GlobScanOperator::try_new at line 153. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 21:24:03 -08:00\u0027 --until=\u00272026-11-08 21:24:03 -08:00\u0027 --full-history --no-merges -- src/daft-scan/src/glob.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/glob.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec87b7729fc705da2a6092b03ab8f388402b756f290d3eca26574af5b864f08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/daft-io/src/azure_blob.rs: src/daft-io/src/azure_blob.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in AzureBlobSource::list_directory_delimiter_stream at line 703. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 21:24:03 -08:00\u0027 --until=\u00272026-11-08 21:24:03 -08:00\u0027 --full-history --no-merges -- src/daft-io/src/azure_blob.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d88f585d11ab69abf9f04e1ca58fb8ee5924e492419d15636aa5d0a038cb7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/daft-logical-plan/src/optimization/rules/push_down_limit.rs: src/daft-logical-plan/src/optimization/rules/push_down_limit.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in PushDownLimit::try_optimize_node at line 45. 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-10..2026-11-08, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-10 21:24:03 -08:00\u0027 --until=\u00272026-11-08 21:24:03 -08:00\u0027 --full-history --no-merges -- src/daft-logical-plan/src/optimization/rules/push_down_limit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_limit.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10e3ea93ecf3abd9d46c88494b27a60310c1e94582a68c0378b8c5482a51980"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 8 significant file(s) lose their only recent owner: src/daft-logical-plan/src/optimization/rules/rewrite_checkpoint_source.rs, src/daft-checkpoint/src/test_utils.rs, daft/checkpoint.py, src/daft-checkpoint/src/scan.rs, src/common/checkpoint-config/src/lib.rs, src/daft-checkpoint/src/store.rs, src/daft-checkpoint/src/config.rs, src/daft-local-execution/src/intermediate_ops/stage_checkpoint_keys.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2e8a7dd3bc6da5c69c73b199fe7f0567d3724b0eeac181384fc7a1e6aed8b6b"}},{"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: src/daft-mcap/src/read.rs, src/daft-mcap/src/lib.rs, tools/trace_to_speedscope.py, src/daft-mcap/src/test_utils.rs, src/daft-mcap/src/stats.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"318f413fc9c0c660e269a535a83dd12a604c8da5f7a7e664145efcc8ac45dc85"}},{"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: src/daft-local-execution/src/join/asof_join.rs, src/daft-distributed/src/pipeline_node/join/asof_join.rs, src/daft-logical-plan/src/ops/asof_join.rs, src/daft-distributed/src/pipeline_node/join/translate_asof_join.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"398fa3c4581f155e7673f20e3055c833b81031e222b299f16aef99f3853ae059"}},{"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: src/daft-recordbatch/src/ops/inline_agg.rs, src/daft-functions-temporal/src/date_arithmetic.rs, src/daft-functions/src/numeric/try_divide.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5167a64cd47fb74a62ca825a53e38353326b722dc1c3c37ff106890936e63afc"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 3 significant file(s) lose their only recent owner: src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx, src/daft-dashboard/frontend/src/app/query/tasks-grouping.ts, src/daft-distributed/src/pipeline_node/test_helpers.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dbed22c59c56a5294ea429d0ec4494d65a548b7146b96f14f3ff82fa60dfe73e"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 3 significant file(s) lose their only recent owner: src/daft-ext-internal/src/module.rs, daft/functions/jev_.py, daft/io/delta_lake/_visitors.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0977876cf4c97302f8575904e658a069801e3e2bb7b5f75985dc0dccbd617bb8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #7: If anonymized user #7 becomes unavailable, 3 significant file(s) lose their only recent owner: src/daft-core/src/array/ops/clip.rs, src/daft-functions-tokenize/src/encode.rs, src/daft-functions-utf8/src/find.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ad5f738fe0e70c5ec64ec95708b15c757743513c0c864d2d898e392752a4419c"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 5 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 (34 single-owned of 920 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; 920 of the 1372 production source files in this repository met that bar). They are anonymized user #8 (1 file(s)), anonymized user #9 (1 file(s)), anonymized user #10 (1 file(s)), anonymized user #11 (1 file(s)), anonymized user #12 (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: src/daft-functions-utf8/src/split_part.rs, daft/io/_orc.py, daft/ai/transformers/protocols/prompter.py, daft/dataframe/to_torch.py, benchmarking/lerobot/hand_tracking.py."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Uncomment this when we update to pydantic\u003E=2.11 which supports \u0060serialize_by_alias\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_datatype_inference.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3941993252f9398da870c253d4c1e0385dd7bea00fb81dc28be03e12218661"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Uncomment this when we update to pydantic\u003E=2.11 which supports \u0060serialize_by_alias\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_datatype_inference.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78fb6632a412a5a629409307000a23c645727dbee14f506c5e5120a7f79bc96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: uncomment once we support named tuples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_datatype_inference.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd5cbacbc10e3f5f9a0fb8e99ec30c3980c3c0bda2c7f83d31ee2a99983ea29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: uncomment once we support named tuples \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/test_datatype_inference.py"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb892c8e415176332d5ed3a2080acdc64cb477ca329a43d089b15f83304d7f77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # sum(\u0022value\u0022).over(window).alias(\u0022sum\u0022), # TODO: Support .over() directly on expressions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/window/test_partition_only.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a50a5de0a524e87d4439622912feea016fc00f5188e6fadbb389710b92aa6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Change to a FileNotFound Error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/udf_library/test_url_udfs.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c91d3543e13be16985c59f22d2e62f41b478f776dd89218d7ef678fd6a94817"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: we can emit a better error message if our agg op can also include expressions on groupby expressions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sql/test_sql.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b531ac1edb6ed1e9a7e3c4a1a16ab3498deeccb6e53a900e7d8e6f9043105b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO chore: make an asset fixture for all tests (beyond just sql). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/sql/test_sql_table_functions.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"617a7b42d9056c62999bb0b2a8aa97c192fc0dd274ac236ad5087f367c58e862"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: direct cast to fixed shape sparse \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_cast.py"},"region":{"startLine":1383}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7e6bf1583bf1d2cef35eeaf61891ebf434a03524235352820e3c65871c5dd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: direct cast to fixed shape sparse \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_cast.py"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fd300c68a44ace82dc2063ec2c35e5f700265a0ad3f0038a01615815b262fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: direct cast to fixed shape sparse \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_cast.py"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e05dc7fd3a1a75eaf03ef9a08561ebc5d5b506a5d4033f3ff3db80bd8dc0834"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: direct cast to fixed shape sparse \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_cast.py"},"region":{"startLine":1449}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f258bd9323ee31ec7978735a08e05d152a334b36951f0106c08d99b63d76a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Uncomment this case when Arrow2 supports casting between FixedSizeList and LargeLists. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_if_else.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4faa11e708032d85bd9bdce32a785da249c0805e3e63ecd0964ddbb6a9dcd2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Uncomment this case when Arrow2 supports broadcasting between different FixedSizeListArrays. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_if_else.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b827519269577bbcd08862ef1ca6da19126b1c382ef9fdc32ab77187e57480b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Uncomment this case when Arrow2 supports casting struct types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_if_else.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2831c3cabda6da9b3ad002a521f852cd0f99feb19e5b88244faaf19e95a9896"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Infer type-leve mode if all images are the same mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2421226aaef633e3965d2245537f5cae24a967a4762b08263a7b1b06c8f1c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Infer type-leve mode if all images are the same mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b667775f520d51d3ff73a941bbf764b6c3dccd2b19fbb75fb7904359f961a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Infer type-leve mode if all images are the same mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee0bd39970fec9ad32ce0e79879e61175e05927adc6af7c3510f5c0f12af18b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Infer type-leve mode if all images are the same mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4658a6286154fe1ba1fead800421ce1e9b959642faee98f036465f024a37faa1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Infer type-leve mode if all images are the same mode. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"856004e9bb59384bfeed0a5b460b556b65084257a038c909c4c57fc84fb4a924"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support uint16 images. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26fa4c1fb2e7d27bf0e901c4a39778aa16c551ae9997b2fdf233fe852bd6253"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support uint16 images. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6768234b926131967c62e1a99410c907dabdc855b456fd3982975a1d76b798"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support uint16 images. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad2fbc626623caaa83bd58183539c2d434f7add4ddab2c2ae5367f66362d674"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support uint16 images. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a8d17f9672c75fc712775dffed03021a84908aa73262d584436c1221734b34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support uint16 images. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f930c29b54a5677b575493a62e16c6bd0cbe8b09b715bb84c8f3ce7a8a5fc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support uint16 images. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5902b2830fe8accc6fa623107fb3ba57e675af9a9464e243b877bcf3376a01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support constructing an Image type with an unknown mode by known dtype. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"56904fdfce86d57e79c0a9e02cd697556c0db192c3366b9aa40451499ace747d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support constructing an Image type with an unknown mode by known dtype. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c15492cd36cccf23f73fbdea52180619d03dce77b5854c458295f67b8dbd8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support constructing an Image type with an unknown mode by known dtype. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_image.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2cff08a7b67a76ad98c7c3a94cb585b5d5a7b419cfc1dd6432a565f08f65aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: this is different than previous impl ^ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_minhash.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"75056433977af44c438332af65994f68dabb6ade0a87e6b59e1258d9914b2f48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo: this is different than previous impl ^ \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_minhash.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e35be6f5ceb4085be65032848e0ab4dcdeb5c86b8997ab1a7cdfa7c391f021"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Change to size \u003E 0 condition when pyarrow extension arrays support generic construction on null arrays. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/series/test_size_bytes.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc58ea021dbdf7a5a82b5208364f91ad27f4cd799e6334167c618ff4bdced156"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Fix downcasting for FixedSizedList in Series::try_from \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recordbatch/test_from_py.py"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"cddad95d8f8eacef669765cfad1ac26d748d8a5b468f42d1d39c4e391d0fb68d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jay): Need to fix nested casts -- for now we workaround by creating a nested uint32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recordbatch/image/test_crop.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a326e61a6d581514aa73f674ee7ebd94f99f93c3d2bb05795ccb666e53126414"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jay): Need to fix nested casts -- for now we workaround by creating a nested uint32 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/recordbatch/image/test_crop.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1da72a2a70978f97a6b083c6226d9171f89b6a946e912fde9f483cdc440b925"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Daft does not currently have a write_json API. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/io/test_hive_style_partitions.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8915d0ec437d1282e0fc264e1a2a9767a8f42d14f2ee67041b6d17c5dfdc05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Daft has an inconsistency with handling null string columns when using \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/io/test_hive_style_partitions.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec73b0776bf86cfff629d79aa9972d0d8af958db498b5649fb57cb10fe610cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Arrow-rs writes binaries as strings of hexadecimals. Technically the JSON spec (RFC 8259) does not \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/io/test_json_roundtrip.py"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"533aae781aa4e499be2ac45e1ab3ed1d19db8adcadd849d0acbb4e19ed8c7cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Arrow-rs also currently writes durations in ISO 8601 duration format while our reader expects an i64. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/io/test_json_roundtrip.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed89f5a0aa4a3a9cc6acfa3708f1da2f082b18c49ceb5b0c32f74fd15f1d5ad0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Binary and Duration types currently produce inconsistent behaviours between our readers and writers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/io/test_json_roundtrip.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a01b65b80429afb8f40e597f3968b0f46556126473c3186b89a1905b88224b"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # hack because ray runner will not increment \u0060count_get_credentials\u0060 \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":"tests/io/test_s3_credentials_refresh.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcef8074593ba9fae20a72fec9051ede41e618164f4a5e3429df650f2d1ca39"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (jay): Perhaps we should use Parquet here instead similar to benchmarking and get rid of this CSV parsing stuff? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/test_tpch.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a22270f4928af3956911ee66d71160274b586cdc13fce9a86957a631bfb7a14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Support nested lists. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/sql/test_postgres_catalog.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ae7004896d32af194c5047222770ef9ec7bae881a4a64daf9a8b673de402d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Support nested lists. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/sql/test_postgres_catalog.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e862ba95a95b6fb6bcc93c511dd65d32d38035ff3e0c330e9b38bf1dbed949ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: [IO-RETRIES] We should also retry correctly on these error codes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/io/parquet/test_reads_local_fixtures.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc05e28951c92784bac4e6d27806f5d0c012defa587da7bf25c339d8a5f5945a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Expected some of these non-working cases to work after recent fixes, but that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/io/parquet/test_reads_public_data.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24a725e96b4b6738f77aa8ca765a4badd38382480631e21ebf2d4ef68104ea7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Kevin): Add more tables from more cloud providers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/iceberg/conftest.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a80d5066d75f0f902742e693664369adc42d9c4acd0d70a899fdbe375a631a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Provide read_table API for reading iceberg with snapshot ID \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/iceberg/test_iceberg_reads.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e00b2ab25159c921a1c3cce343cd97a89ab08b1fe42770981d002397d1d295e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Wait for more temporal type support in Delta Lake. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/integration/delta_lake/conftest.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb888bd5e9dda6017d57e1b87422e58d6f1c8a282e6f976874c8dd8159844d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/expressions/test_to_arrow_expr.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c85a0aeb31ef681877ea0c776d6c4b9f427484b25c72bebb2d5ac7c635cd33e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: check that types also fail to resolve at runtime \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/expressions/typing/conftest.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"848bb63ba060cc3bd4479dd2be486c470a0dc7df0d7c66248a02e1af87989b98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: [RUST-INT][TYPING] Add has not implemented all these types yet, enable tests when ready \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/expressions/typing/test_arithmetic.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fb8c5548efd943e2e9fdccd92b1d650ca485e2c956be8c34cc821376134e39c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: ## TODO: we can\u0027t do \u0060select(df[\u0027x\u0027].stddev())\u0060 make ticket \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dataframe/test_decimals.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"01619aa5df2b2cb039800ee1293206b71c81677114335386afafe5c8adf4d8fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jay): Test that the expression with name \u0022foo\u0022 is equal to the expected expression, except for the IDs of the columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dataframe/test_getitem.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e4992948692bb5ba1d2bb0a5641d40a5d5df13829b43ddb96095583bcf2e0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jay): Test that the expression with name \u0022foo\u0022 is equal to the expected expression, except for the IDs of the columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dataframe/test_getitem.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"417a0e0880d3d58e2a8a0b31a8b4d6130468c293e8e07b55e79127f96b33a10f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add snapshot tests in Rust for the explain output of the following tests. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/dataframe/test_morsels.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e14530a54706d67bee3a9f4db0559a713e50cd535242960e0b80b4ce86221e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: We can\u0027t do this yet, since it requires getting the first row for every Group, ordered by some column \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/cookbook/test_pandas_cookbook.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f753ed7da87d3d774c8fb42500a72a8c423c78048acd51e08e7999913febcb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this once SQL allows case-insensitive column names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/benchmarks/test_local_tpch.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca57c755818e885a6c412c67dd1f5145fd86a0007f9f22e81c67eb0dee2dd95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): This doesn\u0027t work with greyscale images. I wonder if we should require users to cast \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/ai/transformers/test_transformers_image_embedder.py"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b672353af787712ec258fd03950bb6e529755ccf2770df9d96a6d9fbe21b4ae5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement native writer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/catalog.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca0c5d6f5f40056479a30641b2f07a86f54b53ff9feafaa2730c793cb09fb5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add dedicated Avro file-size config fields (avro_target_filesize / avro_inflation_factor). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/lib.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f9d7fbd0f7db9c0d9be677bf66d467136c2bedbecb6ca8a7c0d697fb11da78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Explore configurations such data page size limit, writer version, etc. Parquet format v2 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/parquet_writer.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f825c5c7192f8d6aacd687b587aa1017f0358cbe865cd52d262e32c0192eeab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can shove some pretty useful metadata before closing the file. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/parquet_writer.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe56b9b25828b96b69a78cf90db1effb74e778cdacd0eac456004217dbb9dc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We can start encoding the next file while this finalization happens. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/parquet_writer.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df1b874fb38ed071cacbedbb4100b0186bec6e978a650d118e5d793f8bfe59e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Figure out a way to NOT use the IndexHash \u002B RawEntryMut pattern here. Ideally we want to store ScalarValues, aka. single Rows of the partition values as keys for the hashmap. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/partition.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efb72399de51f60287d82d12c4d7eb72ddb235232d30a36b9121aeb1a23e609"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Helper function to build the path to an object url. The pattern of object url is \u0060{bucket}/{key}\u0060. TODO consider include the scheme in the return value \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-writers/src/utils.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"9465968234ecca9d33994b09da088ab02bb6e9d1c72e9aa0295fdec9e9a97755"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is this necessary with arrow_array::builder::ArrayBuilder? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-warc/src/lib.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de8e1857eeadd19e9642db0d9ed22cf636ca591b3828799ecacf5bb8f871270"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Filter the variants for correct arity. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/functions.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"315141abcaf9b6aba130b118a3290bee853205f5e80097746739f3a4ac2a6c1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use identifiers and handle case-normalization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21a61e1af8c02c0f157f7fb05f5cabba0ec14bd6366ef4f07514c700f18786e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO use names and handle case-normalization \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"694d3372b7f14dbaa2d58f283c8d009f720953d017c298f2702220c44022e76d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO consolidate SQLPlanner state to the single context. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c38eacb54d9641872cf90005ef7624bb165c2f517518bdc698c92ec3e121e9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO move bound_ctes into per-planner scope since these are a scoped concept. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f2a082e40015caf31088b6a0bef0f8a76ad87fd8654f7c9642319a95d01e753"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO flip SQLPlanner to pass scoped state objects rather than being stateful itself. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d747ed09d05e747689130b3101c5a2bc57e2bcf0fed8a025b10ccbf5a54bdc1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should this be eager or not? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed30d51b1367c5eb83cfc3e0a4fa335d43bc3fc4879840c085994a5c0686c7c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once we do not do join column renaming \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b628d90ad80ba0804621bd382a4e8d210a9eebac11996cee029a46a61c2325f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once we do not do join column renaming \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"1797f1077ad2497a8b65fa32e3c179de862175340a3398c70b3c69a26c8444b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support wildcard struct gets \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ffc7a66a55d457cb9fc49865897b218e52563b912bdfb016dcdf0479221731"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO remove me once columns use case-normalized names \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/planner.rs"},"region":{"startLine":2507}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e0e14698ff2d50746d65d63a83892b5a601cdb8408e7b44c7352ef3b41af25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO chore: cleanup table_provider module \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0470da754f8ea94ad106213685d64371d6919706cd12b924abcaf0169699689"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO feat: use multimap for function variants. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/mod.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0449f3ab8994ce2c77a34579375bc5d235d4c3ebbd0638331a9fffbb26797758"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO chore: switch param order and rename to \u0060to_logical_plan\u0060 for consistency with SQLFunction. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43baeb146508179ef645c5f91b786bbc3705fb5ee4544a62d7e037253bed205"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO feat: support assignment casts for function arguments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9766f990d6657e0eaa63440f1257c14fff4b860eb2ea44de99b4a513cd769ae1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO validations (unsure if should carry over from python API) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/read_csv.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd9f64cde6359e757e168779e6652f888b7661c1e9f4ebfbdabf2479510e0e38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO validations (unsure if should carry over from python API) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/read_json.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52138b3418373a66232b414ee619e8f27e937a2406a0659800da003e5b08696"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/read_parquet.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"00415ba18258ed786d48bfd0afa0d5f250842b75a74a4e623e9cce873b358d7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/table_provider/read_parquet.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2387e45f9c3058f1ad74e7776bbb8bb061896bbeb38f150a6300a2f3763e9f8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/python.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac28d72599ec01ae03486ac056b918b21ea9333fd5f6458d7c76581bbcb383a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/sketch.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb8183a0dddb697eaf18ec117a7033a9085f89fe35a3fd77dec8ca3cf869ab6"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK TO USE AggExpr as an enum rather than a \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":"src/daft-sql/src/modules/aggs.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68f7b0a87c615923d23d03d09ddb098e35d797c7ffc74f4c84e0289154b3e93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cory): Ideally we should use serde to deserialize the input arguments \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/config.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7775d8ddbe7637565ca05f515af0ef90c18e2aaebe428a59d46265196abc0d77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(CORY): use serde to deserialize this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/config.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ebc17d1d8e79f3ce0d3be5e301af8b2a8fc07715d0b8b8f881064ed53092f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider making udfs take in only exprs so we don\u0027t need to handle this in the sql parser. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-sql/src/modules/python.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b72029ab5ef24a0cb1f4f04e5886fe2e1caeb9aa7017bfeaa8aa202b1e2c3df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add checks here, as well as periodic checks to ensure that the dirs are not too full. If so, we switch to directories with more space. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-shuffles/src/shuffle_cache.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69863d2228b68a9e3a93b48bf3dd45b574e5c9fdb99e75ad1132d9a100551e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Refactor this to get Arrow RecordBatchStream directly using async IO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-shuffles/src/server/flight_server.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"911ea13afbc7c323e00d4e65dbb5d482d92adf367949e3de0c019e70c6fbdf45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should we return an error here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-shuffles/src/server/stream.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"894ca87a9443069dc5013007f62a37a1a1487db1f2ba865bef1149dc15ea1ef5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO make env variables \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-session/src/options.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dad30803d1e93ae591a25ffb822681e17420ded232dfb73f553ce6c49822961"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Session should just use a Result not CatalogResult. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-session/src/session.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"112904ba524b248d10c5a9ed5d50fb7ad7167c68e3fd5da5e71433bb8f6d7840"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO feat: consider making a CreateTableSource object for more complicated options. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-session/src/session.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72aadde9ed23f8c271ad086a167199d0b5b4c051a74f06142a40c7213a03f1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add support for non-numeric (e.g. string) tensor columns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-schema/src/python/datatype.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1ff2703df7d5a8b6bd9b53b832a48f3f20255d0ad525e9a1099243ee4d0d79"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: can we support scalar functions here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/expr_rewriter.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6951e8c00d51f2f23a69593dc93bc92d443afee528f56ac37835d7a24aa4f37"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: This might not be a good idea? We could also just return None here \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":"src/daft-scan/src/lib.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"53713ff35fd26e5c8560cf4beeba8f80f1a33fc31d9c119f5e82d2755b5422f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Use above methods to display some of the more derived fields. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/lib.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09a6435ccc1f15effb1e417b5998e66b4ec11c97cabdc677b222b5fd930e97e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO ADD VALIDATION OF TRANSFORM based on types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/partitioning.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61122c9cbc94173aba6c47324d8402cb99d00d87a9d6ba744e73fe45b3ef818"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Filter out scan tasks with pushed down filters \u002B table stats? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/python.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8594809519106fb034c3a5318d8563bb6d6ce2737e6dca19991a749dd556838"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: StorageConfig isn\u0027t used when running the Python function but this is a non-optional arg for \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":"src/daft-scan/src/python.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad881b144983bf43a59c4bdb8a93fd22e4534e43393e61a59bac756a7524b65f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: store Arc\u003CIOConfig\u003E instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/storage_config.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ee35569833e11874a304a586001f3c67ba7a68080045d4514b8bc61b1a5256"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be cleaned up and hidden behind a better API from daft-io \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/storage_config.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98b0c51caa386aa58a636f626bd81679d4c292412c0b9988b54f7de01a0980f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support compressed JSONL files (gzip, bzip2, etc.) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/scan_task_iters/split_jsonl/mod.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e92fa36e58c76b0536ef4918aae6bc3ce375c0ab7547a8c0770f7d7e17b3a99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(universalmind303): since we now have async expressions, the entire evaluation should happen async \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b06878810af110b10ca4d3b979c718a26fdb48e4af853f1872bc1d1145d49e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Extend to types other than ints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/probeable/int_table.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8739802f48c993508813f3adee341457009692ae750af2bf89d1eb21e31bafb5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Null handling when nulls can be equal should be specially handled. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/probeable/mod.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0807494959d44442991beb1e0ecd46a530819219589f6f9022ce0ca856538c35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Sammy): Drop nulls using validity array if requested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/hash.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"59fb0718e24879f355de2598053520be4be614104427c72381f89fb2a5c4baab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Sammy): Drop nulls using validity array if requested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/hash.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfc7568c315834e065edda16b01ac02475e95987b37cdd77aab1e14f4ff72ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Sammy): Drop nulls using validity array if requested \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/hash.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f0580acea0603ec6ecb8884c9d75b659cc7581246d82b2a04c7b9b82e1318b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement once proper behavior regarding NaNs is decided \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/window_states/mod.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec35f4ea1373fe64ad5e680ee41f8a16a054efb60ffaa2564b812f218938e3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): If one of the tables is much larger than the other, iterate through smaller table while doing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/ops/joins/merge_join.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af870cd6e682c557a0e4a542009e5afca8fb66db805df1a7fb3be3e0c1957cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(arrow-rs): wire this through to the arrowrs reader to skip redundant footer reads. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-parquet/src/read.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce715bf895db0b1eea6b7152efee64b84a1e5042a365d211b6ebd9c650f217fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: we can pass in stats here to optimize downstream workloads such as join. Make sure to correctly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc627ced4208db526af2e40afd35d457906264d47f488316220f892ec66f0f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Look into using ConcurrentMap if performance is an issue \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/partitioning.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b2b86de72884ed10e7fcae342e868acbad98922a0842ddaea9373102347243"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Cleanup and refactor code for sharing with Table \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbef59ffd3a0b475c0cd8c8f527067f3b1d8d423a5e6a7b499bd2ddc1b862b18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Expose other join types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/python.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7794fa8e817cdf776c96814ada7f0d83974e7f4d1e3dc71aa55575b0d335793"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(universalmind303): make this async \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/ops/eval_expressions.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1628063ebea8ba68d9dd9b6c6093bc8567920d86cb2c71d14f2e1de8dbff3925"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Kevin): short circuits are also possible for other join types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/ops/join.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"22275cf3d43436cbe074a71294de9b9720d340f4aab4b71e8df1adf3c796c7ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Elide concatenations where possible by doing a chunk-aware local table join. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/ops/join.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e030614b6bf0913ccfb44944124effd5b20addc83c8d4f6c3050b94b017b13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: https://github.com/Eventual-Inc/Daft/pull/1288#discussion_r1307820697"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/logical_plan.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5297204116dd82176591f212a5dd58d1821c85398aa88013896009abcb978f8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support mapping join predicate once we can have duplicate columns in schema \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/treenode.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4d8f8a734767d82587f698bdf3a6b3a4397d812863cdf5e98808c2998ed7b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Refine this fixed-point policy. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/optimizer.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ecd0c617ad1946943cb3f990357400fe5f4e763332504c0d9cb552b9ef78f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Add tests that Filter and Limit commutes with monotonically increasing ids. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/optimizer.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9005a2b4937ed8898a7f1c9a86158841ff18d1d610c400d63f07e1658c6f59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is a hack to avoid collisions with other columns. We can eventually fix this with ordinals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/detect_monotonic_id.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2dd3c131cbb2fd274eb1860c838f80a6f3c6aef69a1242199e5d6d5dee0c63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: consider support eliminate cross join with null_equals_nulls \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/eliminate_cross_join.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcc1d88e275ba46f1f03cfaa9358cc409de4d3ef1511526c3283847c5601f7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add Python UDFs as well, but need to handle multiple args better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/granular_projections.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"552c7dc703426c47a9d5536f18b386feb857288493421b9ba471fa671a893c2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Should be have a helper method or something to identify these \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/granular_projections.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3aeb9aa6161ae0809bcc4a469dcdeea28b9186b641c6c94aacc56f687cdeab3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove with ordinals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/granular_projections.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"050b2e87ac8e0b280416816b7bfdf4c7b4d606a1fcbdee69499577e00558ef2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove with ordinals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/granular_projections.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c322c0a9b5bb9f73549e407606736dda6fb44fef8fce72a3c4ce2e6037d46f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add test for UDFs, can\u0027t create a fake one for testing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/granular_projections.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"3761bf9ae6ee1bd5ee8711e4baaf84434e7749793a6b64445a88eb6dc0f2271f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Support pushing predicates referencing both partition and data columns into the scan. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1f865c1ac17f4f22aee2cb2353780c29569cfab81fb885b5d1352a9aac223f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Support pushing predicates referencing both partition and data columns into the scan. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d036fe031a7d6f5e26f04534466d30719d17b40f296197da3ebafea5bcdf8bbb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Push Filters depending on Projection columns involving compute if those expressions are \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdc0d86d550cef56c63989ab8ce2413f672eec822c7ecd0351488b4a688135a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Kevin): add more filter pushdowns for joins \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"2673ea5252bb0b45b12e6e21047df4826370ba5b541a42b4c2613a53478ca471"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: simplify predicates, since they may be expanded with \u0060to_cnf\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"a688eb1285136dd8b97f4a4f9df003b5cf113e047ba40046fe708cd5f782ab4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use semantic id or generate random one? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/rewrite_count_distinct.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91ce953a6cbc62c0a8f97734b35b7d572d485aa9a6c7b1663498e8f340cfb1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: UNDO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/rewrite_count_distinct.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed314fdfb69447b35ae49972273c01ff206dd2684598197ac44d0b591a15777"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider adding a flag to DISTINCT to include generated columns in output \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/rewrite_count_distinct.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97cf6d0dfc3c37215f77f21518778547d951d22f3c4661a938987e4e9d1cfa9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(zhenchao) maybe we should allow users to use offset without limit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/rewrite_offset.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"98798404e31659325f7777b259b38033684b60bf91cdd0d3037f2990e6175d9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support simplify expressions for SQLScanOperator \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/simplify_expressions.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04941016623a68888ebc6f80edc749183f6e17423a0812b7990c07ff7a1b342"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: UDFs inside of list.map()/list.filter() can not be split \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/split_udfs.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e431bea322612fc527b99d03fabd18550a94e95b60be225aa67aa2130d4788"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: UDFs inside of list.map()/list.filter() can not be split \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/split_udfs.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e25a2217fcbd519d1f49a8e0a8d18a269cd5a018926471bdeeac76334b145e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: eliminate the need for recursive calls by doing a post-order traversal of the plan tree. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/split_udfs.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3f17a9d834b21331f455a93d6594746726ff013c9317154fec9f503e6f3715"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(desmond): In the future these trees should keep track of current cost estimates. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c48c084e85d66d71f0f72a9ef4ad96cd02eaf1f5cba061a757663bcdada1a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We should also take into account user provided values for: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefab3d5ed10667e79645955ea9defd0c21f7c2c9c5a5b1cf1b3aee28fcd0194"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): There are potentially more reorderable nodes. For example, we can move repartitions around. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"89c592ffe2266d454ee2c2b00d0e454fc009391f0b143035257fd16e5116ddd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Figure out how to handle joins with non-column predicates, such as aliases. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"e293e6eec1cd57f0ea49a0399ef20bb77819dc578f18b038517efd8e41abca91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): At this point we should perform a fresh join reorder optimization starting from this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/reorder_joins/join_graph.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba14d75f026ad71d6790845ae76f105883308d25ea8100b63fc52931f62907df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can use the schema here for better estimations. For now, use the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/agg.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5187b28d6fdd18eb1a799ff6a4c5f60f98866dc600b5a63d58b3bf4584241501"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can do better estimations with the projection schema. For now, reuse the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/concat.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a195f1ee5757e01f1b5b3d233d9a903935dbbdf50c20ed44a0f24e5f39c87436"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can do better estimations with the projection schema. For now, reuse the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/monotonically_increasing_id.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"17dab65d8f7905ef26be830a292c6274434ab035c356feb028e5259cd0ed38a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can do better estimations with the projection schema. For now, reuse the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"472ab55ce2e9be50741bd253553e1d4f8348f786470fe1271b904196f46594f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can do better estimations with the projection schema. For now, reuse the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/sample.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5fea883aef00e5636e52429461a18dcddef45ab852da3236d5a1d9b3258503"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can do better estimations with the projection schema. For now, reuse the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/udf.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eed658267ffe15eb89ca005ad7d0bf0ca950b0dc6f503618b680070432c978d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can simply use NDVs here. For now, do a naive estimation. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/distinct.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6be75a556d186fe2c6446035889330fb4695dba958d3e4662f61c609dd51942"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can do better estimations here. For now, reuse the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/filter.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c3d3e3ce281d2c48594dfb86a41e6d092748a6849371783f05fc9b2fb50567"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can do better estimations here. For now, use the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/join.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bebda160b81bf0a8abe369df36a07840beb67bcfc181d0287da048d6b2db3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Pivoting does affect cardinality, but for now we keep the old logic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/pivot.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a35b972f09897de1276c8c76766f3c9766bac5fc8c95b4c6f4de931ae0f5a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: rename this to something else if we add support for by name for non-union set operations \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"231d9ab5cafc52ff1200a87b6d56314b50400ed09d4b0a473b1ee74d69add477"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support nested types recursively \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0d45b4a9199ce525f75418d7ee84ae91eb9e5f8c8871cf0161b1e1ad0d2cec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Move this logical to logical optimization rules \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3fca1c43fd1e9e5131083d935bbe25a0328af9c2503c687d4ac01debcfac2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Move this logical to logical optimization rules \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/set_operations.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"4478b5b97affed7d7cb163c911d5d96db46409c2f7ee5724a63287aa34c672ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Estimate output size via root directory and estimates for # of partitions given partitioning column. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/sink.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6cd6af291b9de9c821bb867096e1f232489ece6209cd7a9f82b7b15d0e8ee7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Kevin): make sort by expression names unique so that we can do things like sort(col(\u0022a\u0022), col(\u0022a\u0022) \u002B col(\u0022b\u0022)) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/sort.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dfc09dd5c8389e4b1b0d841b962ade10c9dee3d47e5682701178e6d860caca5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Kevin): make sort by expression names unique so that we can do things like sort(col(\u0022a\u0022), col(\u0022a\u0022) \u002B col(\u0022b\u0022)) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/top_n.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"68de4908407b4a3a8ba1c490edf4eaeab5b56ecae29cb82641dd746b58249b2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): This is a port of an existing constraint, we should look at relaxing this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/sort.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"df49fcfddab1e0ed4036d395ca40dcbd7a8b01f5aa5f629a2b398ddd8fff31b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): This is a port of an existing constraint, we should look at relaxing this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/top_n.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e59b37cb421f55a5c6cbdd3a4eaf49c33493d983e75bb753bfe9df1241cab92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): is this correct? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/display/json.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0508d5100f8788e994dbcb40d879d1a62058f4aa6a4786cb41f92c5a627b50"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sammy) thread through clustering spec to Python \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfafc97fc55e662c06f964c7062b64321452c28db69aa4e90d657ccd78b50e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove the \u0060block_on\u0060 to make this method safe to call from the main thread \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbb6bc1ef79067ffc8ed0121e30868958b9081627535b7b76d869f82db73ca5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this once we add plan IDs to DataFrame \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/builder/mod.rs"},"region":{"startLine":1565}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f73ef32454200f0161001443bcca8940ab60411774438a121fb3733e8451b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix configuration for events \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/run.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e1f1d582388bc0f4244577d9e24a3925ff6e166841a081d21dc3981d4d2951"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: propagate last_node_id \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/run.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb59357d002612d88cab036050703bc884c84aba9973d4e84ea92b734400c24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: propagate node_ids \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/run.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2029729d9de97755c3f403f1188e123b8d0321bb73578c6e28fd9029369ce8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: propagate worker id \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/run.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bf7ecb6f4aa3df6f02494f74989efd86b17b87e6b8caa75433913cc0ce3ef4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle nulls \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/streaming_sink/vllm.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"c111f7af2cef5e2ed6f4a560511d3affb4881ab33308d990dc3ddcdda1f3fa58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: lazy initialization because make_state is synchronous. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/streaming_sink/vllm.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a709d9c9e3fa03665ead1d38f684ee8494f049e965a8a8b2cdfd73ca98a8361"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rchowell): remove the scan_task_reader module in the near future with a more general DataSource (TableProvider-like) trait. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4e0ad6dbda3d983fc8360b9b7a0b469943ab35ebe28a53ab06ddcad7ff2835"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Better support for low-cardinality by avoiding partitioning \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/dedup.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a5e57117e4c5da9765c118c273c4c086eaeb376b5e0cc484f8acdabda0a086"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO: Store Hash Table as state per partition and reuse across micro-partitions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/dedup.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1ff145b237231fafb16119e74f008df49d4cf3922bd54155836fad22e1f4f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deduplicate in parallel? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/dedup.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b28cb8cf36fc40cc27138740e675db9f6add059c78588b58338926e894d0d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This would probably benefit from doing sharded aggs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sinks/grouped_aggregate.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9bafbae20eebfa4b8b39c4e358b5841bb671f8ca7c270fb16838d29f2f0044"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider switching to (InputId, NodeID) instead \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/runtime_stats/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"37596a100e63389503de52f4e2601ed4cfa93ff7cd78c2df89d656c7856dfb17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Default required properties. TODO: Consider removing? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/runtime_stats/values.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddbe8b6ab1ef30f4f468b46dc81fe14e1403c03727a58ec155076587c8968ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Handle pre-sorted? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/sort_merge_join.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"539c6cbcd8dbfcbd30b395238c8a1b2aadfaedebae8b31c781cfec50f2c76450"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove these properties from RuntimeStats trait \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/join/stats.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b315dff7d76d96fc031fe4ca02d148fc8c117b229c64c322ae8ccf54b06e524"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Some casts could be considered no-ops \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/project.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1a6ed6939dfb866885e83cab4caac556720c42e54f8e9bd98ecb59824b6888"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: allow udf to accept a min/max batch size instead of just a strict batch size. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/udf.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9ea21c72d6bbda7cb02271b42abd3c5bf622b1821a8cde56f6d2154eb23890"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add support for decimal type. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/decoding.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"7983dd2242a342fe1cc1152b5f993669eebdc1ce02d4514c3357bc56a56d44c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add support for binary and large binary types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/decoding.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d470a4e31860d382f2257e309346ddc27ac859bba59cf2885c6d10f4ea95d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Return an error instead of dropping incorrectly sized lists. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/decoding.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1154760b4a4820b150872369081c0715b6de427734e4d8dd8d7ca6201c6d9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: there should be much more shared code between this and the async version \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/local.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5c3e1503cfeeeb7833e03851948c7dae26416e50b6a644341b258613aeb928"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: make this configurable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/local.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4634bc48e5ba40f655f92ce12438996a3a7b8f1aa4c90b1616a07246bd3d08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: make this configurable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/local.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ab80a52eb0680dc66661e5a919d2a025d899c01e453c6f07bdc0a1b786e566"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: only recognises \u0060}\\n\u0060 as a line boundary; JSONL rows that are JSON arrays \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/local.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca3bb23587bd0bd4a16a2c849f29c16aa1425c6baee8d74ed473fe11fe3bf9b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Switch to streaming parse \u002B array construction? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/read.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db7e3ea0bf4727d972eb125ba517ce1d668c64f489a9d5d230eea2f9b5b35bc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add deflate compressed JSON file to test data fixtures. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/read.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e3760619d29d7d09fc3b2b7279022e88af81c575f4ecffd1947b22dc03367c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add deflate compressed JSON file to test data fixtures. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/read.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9003d69810bddf8ef6d56f996c1acbd4138411f35da1b65b145ce594f611f8f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add deflate compressed JSON file to test data fixtures. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/schema.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aa35726720df35c08ddf8fcfa10fd77681cd21e8ce63496e4f4e69bf8ac480"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add deflate compressed JSON file to test data fixtures. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-json/src/schema.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"062873210067e8f5cb2549d84fda9b4c19441f96299e5cd1d4a6a9745aa37205"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Allow no storage account \u002B anonymous access \u002B custom endpoint. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/azure_blob.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"5118f197c3206a4f915c41f9dae2f5e4e6570f16002b8ff416d1a3204487a2e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO it\u0027s wired that will read 254635 bytes from the file, but the file size is 25933 bytes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/google_cloud.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"639a23750526fc9a6e9bd45ec901d696601e5e94196067d8e5d63cae198479fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this more efficient \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-io/src/huggingface/mod.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11f90264a17957dfabcbf8cfead36a57957c8d44f43991e859c70f3f8089838"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Fix this in the tiff crate. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-image/src/ops.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff45ec300f2ad134f5d8af84eed3cd9b19df14d04094979750fb00d28a2ad5e5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: Creates folders if running locally. This is a bit of a hack to do it here because we\u0027d rather delegate this to \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":"src/daft-functions-uri/src/upload.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d1088968421adad56f773bb83c450d230adc563e111b59197898e88d9f3bbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Allow configuration of the folder path (e.g. providing a file extension, or a corresponding Series with matching length with filenames) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-uri/src/upload.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd39c9111263ce5e5bba3d874dd5d774f4279dd51ff4516807551aa354472bdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Kevin): Check if default dtype can be cast into input dtype. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/get.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"120ed303431a7bb0bbe12e81907663cf1ce56bdd81cf2a8ecfc4709a00895dc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Migrate this to arrow-rs after migrating growable internals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"75706bf488c1a8704cd8971357287baa7d78328b7901dbd2e39670db0bb0c38d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Migrate this to arrow-rs after migrating growable internals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a07e34a31621dde1c932cd04979b5cb69ddef0f4a5ba93aa778e623241f12e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Migrate this to arrow-rs after migrating growable internals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"52720445e321f10ea6f1d430bdd62a698e63f22932e4c7a2403739c671adadc8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Migrate this to arrow-rs after migrating growable internals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"2616a6f9bd7aa626c2bc15cb8a54f54376ffb7cd791f69e5a2e7e7e9b62a9f9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Migrate this to arrow-rs after migrating growable internals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":1096}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7f8b9a296e34b463a9040dddb61290558e5b836f338f3f092355fcf5937015"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Migrate this to arrow-rs after migrating growable internals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/kernels.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1811ba85e27b6d6b7986e38b753fd23d2f6dc600a56c2021a84b47742b65e544"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Migrate this to arrow-rs after migrating growable internals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4a083db3333549767e5173ef66affdec101d6d18b390de262ee2cf84893164"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Migrate this to arrow-rs after migrating growable internals. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/take.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced90cc6c642776dc003efd2502e0c6bc4e5b7b46d741a3c546f9c14120a3915"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO chore: cleanup function implementations using error macros \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"6064be29129144f48dc1fdba71b554b8bf3792f999396eb5170d9c9018a84f51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): we can likely do this without fully evaluating the not_nan predicate first \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions/src/float/fill_nan.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"08fccd003b2ff5c5e7c21d2c933ad76d3986b1be645d6743ce2d8be1f97897c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(universalmind303): convert all the Read and Seek impls to AsyncRead and AsyncSeek. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-file/src/file.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"223933fe00440d023abef9e1a36502250c437532de1e7e234c91bdb422625b59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(universalmind303): can we use an async stream here instead so we\u0027re not blocking on each iteration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-file/src/functions.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"debfb132596b57b9eca710a3590ed48823a8996f7ae08e4c5c6a7984e0cba617"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(universalmind303): can we use an async stream here instead so we\u0027re not blocking on each iteration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-file/src/functions.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e0bdeec53459a20ac143056fd019a5fa9af7df00bb9e946b117c9ee66a8e61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(universalmind303): refactor this to be async once we have async scalar fns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-file/src/functions.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"806684a3696dcb17b178a6993666ad8e10ac64b564fe577e471e3993b550e484"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(universalmind303): refactor this to be async once we have async scalar fns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-file/src/functions.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"16438cb0962a3340b4800c3093aaa1e7f2a6e7585263ea0e96ff83c382be9185"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: log error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c79290270fe7b895783e5fc629d8ff361ecf2b41fb61480e38782af03c77e4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo: use Identifier instead of String \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/function_args.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"20040303aa6f04f90085ffeb641d6de62d80ec7ba99c9a4818347247f0059de2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for function idempotency here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/mod.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1d8baf5b124f511b745b3e0fc7e9b9f091784c9438d24908652c9dcfab6c77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for function idempotency here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/scalar.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3ba562c0edea9121eab01f7b7cd607a8375890da3c5b5733beffe8db960f1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: Use the Bindings object instead, so we can get aliases and case handling. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/mod.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"824f7f1f60679354fa84e8cecdfe0b69ce0816203e8ef48206a89e271da8b88a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove this monomorphizing version after migrating to \u0060add_function\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4b1339b65105165cf07f238cb62d5c57e7c8f807e6035f18798c9a8720a582"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cory): use FunctionArgs instead of \u0060Vec\u003CExprRef\u003E\u0060 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/scalar.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfc168cf9c66ca0abb6cc6a914e57c0e577c4538aedb78de55e58ffbe9b08fa1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/scalar.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ffbc33ffb6aaccde88d8a1d451783b9cb0ad77363e494ed7487307b223e61a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(zhenchao) Perhaps the layout should be optimized to improve readability \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/functions/python/mod.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee22e5293ec229cecf153581796b7f8fcb1559ef0a27d264e03377851c186b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove ability to bind unresolved columns once we fix all tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/bound_expr.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db20fac09fe17894e19aa07a38027594c9bd8ec0f9f37c96334c05623bf8a6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO: Once we support identifying columns by ordinals, join-side columns \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a7daf14dc230bd06754c9c2479884cf74fda65c65389f28151916112e9e994"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for symmetry here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8527ac5e7489125a5230807b7be346b01d2554343046c74fcd257cc92f63b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: check for symmetry here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c29bc2c4ab4db047bf35dabefa719c2b0f094ab7ab6701f90377d25f29057c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: If there are multiple bound columns with the same name, include index \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":1717}}}],"partialFingerprints":{"codehealthFindingId/v1":"886a08a4a884abb2bc97d820954590ecfc59c07a255421495478a10ed3066df7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: make struct its own expr variant \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2289}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a6f44253bdd3cdd3b5aba85a587f987f327e8134d1b45bacd09d714549d85a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement SQL translations for these expressions if possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/expr/mod.rs"},"region":{"startLine":2422}}}],"partialFingerprints":{"codehealthFindingId/v1":"749a29df2d3261deafb25481a083f39b92d6bfa5324e333dbd60deb84bbea9d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Return immediately for now, but ideally should error \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/statistics/stats.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"015e058763f78e1aac8f7a501252be328ac6822b18a2943513e8c0a9717dc52d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Add glob and flight sources \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/task.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e4229250e63770c84288aca198ac1c7b5d162e8595faca14f4c783e92f663fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: In the future if we run multiple workers on the same node, we can have a NodeAffinity strategy or a multi-worker affinity strategy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/task.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b322e40cfbf28faf84e1547d5e9dc918d818f6da1b88febba37f098ba760d3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: support glob and flight shuffle inputs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/task_metadata.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"517180bc652bca60ac2c189d8a50db69781c1fc551dea91cc2ba92f049d64d84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Change the approach to instead spread based on tasks of the same \u0027type\u0027, i.e. from the same pipeline node. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5e127dfa48d3e7a832e8a5a044ab8e989bda6e390e999cbde0b342a97663a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Currently, workers are never given more tasks than they can handle (based on resources) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8da38e2c50ce5d5ab17ab9d24a998558f9d98a7496131d3e123c7c9ad6c849"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This test currently fails because the scheduler is currently not optimal, we should fix this by using a bin packing algorithm. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f237e1a0d2e3b98c123d8850f7047ef4583dbad70bf6966f25f668093971cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Potentially include memory as well, and also be able to overschedule tasks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/scheduler/mod.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1c697a51764d04411d5ec4c29ce595a717ae5ca35232f367b05bf34cc7d93d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(perf): Avoid building TaskMetadata unless a subscriber/export path needs it. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/scheduling/scheduler/scheduler_actor.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efea6dd08eb6c98d37a58deac36ee2c30973db49da2ee266704475c54d0559d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This is a blocking call, and should be done asynchronously. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/actor_udf.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"072ec0a994ec9725d86f15eb986ebce3d2639f224cecf5c3eaf9f3419c5692d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Be more specific if group_by columns overlap with partitioning columns. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/aggregate.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af209f119fdde0fcf7f19e0f53a882b7f384a75940de1e2317784278376f8fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Just use regular recursion? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/translate.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ff6b470731490fe9998ea37d06e6bee7e14b011f8539d38b276ac4cc8a67b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Parse as all candidate formats in a single pass. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-decoding/src/deserialize.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d6b671c5b411ce81032532f1b42935e8101cb3ba5a9c5622d523a02c57bdd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Parse as all candidate formats in a single pass. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-decoding/src/deserialize.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cb41fcaadcecfd0ba1270cd4c1655595c38c3d0d4e7910647771d1c5df5711"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Parse as all candidate formats in a single pass. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-decoding/src/deserialize.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5a620d4a0da1808d0cfca56a6ae54b64e0288b69121f291732da47e3c8f1814"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider replacing with websocket for active engine -\u003E server communication \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a0c932ee903d7c3afae62dadc39a0c9256077fe4e637b7850f105dc732ceb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO add support in  dashboard for process stats \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/import.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1709e164e2e804fc1533b98ee40fa5479671c575f844139321bc7cc67a9e0f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with the query subscribers stuff \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/lib.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0ae3ee6a2eb0588edd83364ae722df58c264868b9c4f2425580bc59291734d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Logs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/state.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c922d5308e44ba221d46347056febf8a3b5847a2958ea8b6c4446c9fecec63d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Logs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/types.ts"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"77764a4efa13a258153b6748a81b9c1a24c2c9011e539dbe1767ced73095aa35"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Ideally this should never drop events, we need an unbounded broadcast channel \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/state.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"6879bfb0bc60870aee5caf1cc6b9b1aec9383b59fd12103bca8f814aa7cda15b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Play around with useSWRSubscription again \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/server-provider.tsx"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ed983e53d35475629ce2da393d415e2a93ff3e4fae9c3a46aba48e52292dc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consistent ordering of statistics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/page.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1b48b39098f010f8915e7525c669e0274e31179906bdd222ecfbdf0313f464"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We might consider creating per-process buffer pools and slab pools. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/local.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"2308780d15bafe2c455691f697940b08565b3999c232e190f917ae0ace770cbb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): The Daft read_csv API does not currently accept non-\\n record terminators. We should \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/local.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff48ad2343ffb0d5709bd8a4f7a16c2a7773ae26cd11f2da6c24169bfbef9947"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // // TODO(Clark): Don\u0027t concatenate all chunks from a file into a single table, since MicroPartition is natively chunked. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-csv/src/read.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c245a5819f33e512e082a3cd97e5f0238289f3a60593118ea8f51d9ddfffaff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Deprecate this logic soon! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/utils/supertype.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cd715de6ead68fccfa422300e5088dce9aec89da08fe6e2b5199f3cd096035"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(sammy): add time, struct related dtypes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/utils/supertype.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc00e190abfd12cc3e331208b3c326b4128a4efe967319b7dfba2b3b9996490a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Colin): Add support for getting supertype for two maps once StructArray supports such a cast. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/utils/supertype.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf13671d68e79c46657b07b307ccaa4aa19ba9157a0a552342a13fdeedb5f6e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add support for getting supertype for two fixed size lists once Arrow2 supports such a cast. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/utils/supertype.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dbf9d9186c62d1312920d918bf7cb22f74e6f23227e9a7c7bf66a1a6e42261e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(Clark): Add support for getting supertype for a fixed size list and a list once Arrow2 supports such a cast. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/utils/supertype.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"184113ef81f4c2bb47aa4ae4890cc42732371281de2bfb0fe2fd4fcff52be986"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO chore: audit struct literal vs. struct expression support. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/lit/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6077e77b47c7f1598c4fdf9191292baadfceb9138ea531af97e8813a60d36391"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: store chrono DateTime in timestamp literal directly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/lit/python.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a43de0edd9af1fb74d60698f8c165084b4706e8141d27537173eeb4e3c53f48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Condition is for backwards compatibility. TODO: remove \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebf234e39c984f9b946c86c6156754c786a2bc70ac49b91d793c50405d56f1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // DataType::Date condition is for backwards compatibility. TODO: remove \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b10efb655e2293b8d836fa840141afc60a311ce6ebdf9cefe0a2784b9e8c910"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): Once DataArray stores arrow-rs arrays natively (instead of arrow2), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/arithmetic.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ed092e6cac5d6bcbf610f9da73e41044754e9b6577acf40959c08fae27443b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"9820340cfc4be5f52d1da55291e77dc991387e67f60444bd4e6bba5b5ce8f077"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO [mg]: I recall in testing that this shape is wrong. It flattens everything. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/cast.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"807d4378ba217a6b68b91eddf42612001d3dcd4ccfbb1f73b4bfeca93feb2a92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Replace with .append_buffer in v57.1.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/concat.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"b40fdf532c0540631dbb92c5ea327c8479ce62a966b0de9723914cc402cbaf26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: remove once we dont have arrow2 anymore \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/from_arrow.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"7979eebb54e72bb195bb07d585364d0e2929368c2dd84429f1a63cd98ceb8f6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO chore: replace LocalPartitionSet with MicroPartitionSet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-context/src/partition_cache.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0c45ae1ea12b0cd26542b1c87f47a37552240be8372b7e4d3a4eca9f51d0732"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Auth handling? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-context/src/subscribers/dashboard.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"7413df0f9141537e754e89939446eca39deb9d66799b96666c88e40568de33c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove me \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/error.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92e6261ce1033ba423fd1ffe9039869c3fc9fae5eb5a1f6479af07da8d3f4b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO daft should define its own identifier domain. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/identifier.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab53e592cfb8d5d2bb77d3ce4f50344ec8713ebd6f3dd5fa34bb98f0a94ff040"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO audit daft-catalog and daft-session errors. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/lib.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b81b20ac24a85c58ed011aa56665e59957639fbf0c9dac476eaffd02a3902f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO consider moving out to daft-table, but this isn\u0027t necessary or helpful right now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-catalog/src/table.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a9a4bf12d01a8fdb8d205ceff2d453d21ab1b61fe97f8340321210b1d3cb57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can\u0027t do this one because we don\u0027t have a way to determine if an expr potentially contains nulls (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":"src/daft-algebra/src/simplify/numeric.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0375e3dee843f5d07dfdd7b846b8427ed04b1138672ce87c972737e9e4c3603d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Support by enabling the \u0060http/json\u0060 feature of the opentelemetry-otlp crate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/tracing/src/config.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e75b86a754a6584d9856dd878e6be75c6d0457df8b2ed45439a10bfd79ec6209"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: port over the rest of the functionality \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/partitioning/src/lib.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2e88551c0015165abcd557fe1736ec5a8691d4a41750667a809d219b49d92c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Make this global for all plans and executions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/metrics/src/lib.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"924776a7470a18f28e56ba174a4de84a05d9a1e79f2850e9acfaafdb52e392cf"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK(jay): The \u0060.to_image()\u0060 method on SubImage takes in \u0060\u0027static\u0060 references for some reason \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":"src/common/image/src/cow_image.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0a1ae52bf97acc42e40dfaca1d3c1d8b3c483a258b754e253394fbf776388e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(desmond): We can\u0027t currently implement this as a From\u003Cparquet::errors::ParquetError\u003E \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/error/src/error.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dba38cd5e8a47142bb546deb147e24461ffe92bc7ba0403e2565a8ac3910152"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(DF-????): \u0060key_column\u0060 is a plain column name (\u0060String\u0060) rather than \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/checkpoint-config/src/lib.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"664b34932cace9490c9da5da04edc13cbc39dd12574f464f63b219da8952b171"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kszucs): implement the FFI conversions in arrow-rs for RecordBatches \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/arrow-ffi/src/lib.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16bb17a0ec8e9394611de79b6eeb60203626caab0975ced13dab0d2509e4885"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: TypeForm would cover everything: https://peps.python.org/pep-0747/"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/datatype.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f1aeae4310b092803f39bef26ff91a33f2ba82255174fc2d822bd4278e7a83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Add a native cross-lang extension type representation for PyExtensionTypes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/datatype.py"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cc61ec4d2beace07127da4db1d38efdf69ac3f5ecdd954d1105de882689e41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Add native support for remaining Arrow types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/datatype.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"475342edb0022e2ba50944c1db925dfef58109d6a9c0c32bd19d78346ce0810a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: look into support for other AzureConfig parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/filesystem.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4c3d0b25c8f10b6cd918de971d5d1fe7f2877732b3f96e83ddcde81c63cfae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Represent the tensor series with an Arrow extension type in order \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/series.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"258ea63adb2e608dc83fa83f9ee1fb9e6d74ab65dbe57884a81a3e7a484aa1cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo session builders, raise if DAFT_SESSION=0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/session.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d6cbf066f98cd41182b8d2d71f29108eec737c1e70d9ef3eace194ffc135aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: support attaching provider-like objects e.g. OpenAI client. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/session.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a737a933b55300d57a18ccb2aea5f0af50dd5c7f3777a718a54ccb15494670"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO relax this constraint by joining with the catalog name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/session.py"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4352ed386ecbe486bc5c8f2b79114d700e2c21e8ccd36713d57221910c2313b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO relax this constraint by joining with the catalog name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/session.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3f42907a772130db671f35f78cca77b8b185bb32b66e2fea9e137761cdf3b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cory): use a dataclass to hold all of these attributes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/udf/udf_v2.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"43cf52aa79c8088918c9c1d5348f6fa3d3d9198ca374c9791d1bec33f96713ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: implement generator UDFs on the engine side \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/udf/udf_v2.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b6d406ca32a012413813d90d129642b68810fb3cc8d347ebd7cf658ab72237"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Remove once fixed DashboardSubscriber \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/runners/flotilla.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4b633a713392eb924550a30734c401034d5f36815a0ef92815462a16ad8055"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Port this to the Rust side. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/runners/partitioning.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d870d1fd68b2bc14c4c4a80ba4b53b2abb7bd646182cbc81ce86af29eba6d19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zhenchao) Support more runtime env configuration items if necessary \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/runners/ray_compat.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"11250300556c56d8d46393789ca6cf7f2f8999fef9f8662db61b157f494284bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Avoid a double-materialization of the table once the Rust-side table supports \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/recordbatch.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c928657e3aa6b1632cd03c4833839ba25e89716bca3a120e05ed9622acfe440"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: move this logic into Rust \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/recordbatch_io.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c295a6bb26d65486b9bb5b96ad9ff50e93b64dc6950f652f25655459d79f9de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: move this logic into Rust \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/recordbatch_io.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"de96aac52eca3d3027eeff57601344e9f43b4d8640f5ce17774b6fb87011a4e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: move this logic into Rust \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/recordbatch_io.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"42718881f387212efb95f19f97edddaaec075daea44d92c0bac041eb7471f086"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: these should be populate by \u0060properties\u0060 but pyiceberg doesn\u0027t support them yet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/recordbatch_io.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92ec7c297c2908f16a68da83fc7362f70abc474c3897e738ba4a1bfe4866101"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # Hack to circumvent non-predictable memoization caused by string interning. \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":"daft/pickle/cloudpickle.py"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"225ec8ddc66b6924c7e607ad8ee844c9d30b60ee730ff706905699559d3fdee5"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # Hack to circumvent non-predictable memoization caused by string interning. \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":"daft/pickle/cloudpickle.py"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f5804927843ee278eb19a57a3a8f89a953c4bb8ce28e1f2645561a9428784bd"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # Hack to circumvent non-predictable memoization caused by string interning. \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":"daft/pickle/cloudpickle.py"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e12f2c803f25c205b58f003644ab6e00b6e1a17a0c38447d50205b9c527fcf"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # Hack to circumvent non-predictable memoization caused by string interning. \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":"daft/pickle/cloudpickle.py"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"359acd53e8fcbdb851d44adbb5f9a45c58beb892d5a4750eb7c24e6f0224020d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: decorrelate reducer_override (which is tied to CPython\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/pickle/cloudpickle.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd0781984b5d7e52d9715db4551c02cd7a53b58122cc2bc34ca93162dc2a99e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: consider using \u0060from_range\u0060 and \u0060Series.from_range\u0060 instead. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/_range.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b818e8cf099b8bebef8ff535e371c89e3d33df85cc28fb299319c7f27b1fa70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Support ORC and AVRO when we can read it \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/iceberg/iceberg_scan.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9ad905f4e997875d1683301c509ad4137c64dccb0b2f5a9ced281eb765980f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: nested fields are skipped \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/hudi/hudi_scan.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"87330612ba3cc890ace5921a9c19befecf5a1d65ca46cb02620327302f5c9e2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Shiyan): support base file in .orc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/hudi/pyhudi/table.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"767fad14d17a343d07d9fc9ca32c8fa7b1575113d4623229b71cba5679ecac8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Add support for deletion vectors. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"290dcf9f07fc8c6f799ce2fcc7cbcd7473461d71b37dbfd950b13101b7b49645"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Add support for tracking null counts in column stats. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1535a75c347253343c1f19610401b172196cd65ab7be25d5a4d009c8bc5c3e5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add logic to decode physical type for DATE, DECIMAL \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/delta_lake/delta_lake_write.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5da8b2a2304187df8f10a2f5e7a5f3733a6cb0058dc48b11a5e1dc94803b7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: additional video support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/av/__init__.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9f2134f3e02c20037f0714c2a2f3fc6d17292eb25db0d8dad13e76280534bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO support reading frames for multiple video streams \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/av/_read_video_frames.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2689f04713c02a46f6216ee7a736d3bcb2f545e9614a0499d9888f7464c2bd36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Replace with a try_cast to string if the charset is \u0022utf-8\u0022 or \u0022utf8\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/functions/binary.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe537cf833a92f2e04a93ab27887c48f003c6d647c94b2b1225f90bd09bee30e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rchowell): classification with structured outputs will be more interesting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/functions/ai/__init__.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e70faf5d3c138e177ae8de6cde3388d43ab1349ef6e96d09efedcc87499ec68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: classification with structured outputs will be more interesting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/functions/ai/__init__.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"58634f0b903cb449aa574a26a1668cdcaf1eb961c1a7049a6999ff99390706c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add Rust implementation of readinto. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/file/file_io.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aec9b4e609a4e955ee5253b8ac6e0015e9b5e346eaf4b14554279dc9ac2881"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add support for SVO camera recordings \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/datasets/droid.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"423b5ffeedcd4ebf31bdddef9afdec7cf1ba1dd00cb73dcc3853583b5befa4da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): We need to take in the batch size and number of epochs. So that when we shard, we can ensure that each shard produces \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":6107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b27b7cf783bf722ff3e9ac176d6708185097968c64dd9001f40d359a5a781b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support Dask DataFrame conversion for the local runner if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":6300}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aba4f988ab99fc99fe2908b123a9ff1e3b213bff3e8144dbaee4c25c0442329"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(Clark): Support Dask DataFrame conversion for the local runner if \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":6310}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5558e964ec9b4bc9e18e517cad116be4e3d36a85b83720bc0d05b6e631fba6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO handle cached plans \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/display.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efb471b3623ce28d6f6fd99c9ccc9c48cae393047df92965fc683242d3dc916"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO \u0022latex\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/preview.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d10bd3fe421d8c8e615050fc4b056f1071293dc9b4012b4276a22df7ffb161"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add support for drop_last when we have strict into_batches \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/to_torch.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f6f4f4546e399f6b0a2e17350a4e5fa5ecabc77c6cdf9562d969de01371394"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__glue.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac21f6ae2f1c1179f05aa78e4eb7654a7db8175691c32f26ee4683cb41b77933"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__glue.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a811fef117e76fdf0e6516903fed6b49b4de24e071236a9082f49f5a9a413f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__glue.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5e95ff5e9f6abca429569a46a58d70ae2a38735d027ffd027521f11ca93d2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # todo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__glue.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2a93dc6e8ef9bf6c6cb4bd380c00cfe55f6f6017d4ec2ff08774faaceccfc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO update to support more Hive types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__glue.py"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"954d30905e3182cd7a1851025fa1fa96637966853d4e46eef715b132c551db6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Daft is currently unable to read INTERVAL types via read_sql() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7970eca8d5edc4fcb541cc1018b7d733689ef24f3f100ef1b44b5bcdc88dff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Daft INTERVAL can\u0027t currently be casted correctly into timedelta objects. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"169cd902a99ed0f4f276f029f793e6abd34ce9634ccc3600839eed2716f10eff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): We need to rework array types a little. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7335eb9ffa4cacc80480b0353d40e943f0700bfef902ced8bf851a3e4cdddd48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): PostgreSQL doesn\u0027t support ROW syntax in column definitions, we\u0027d need to define new composite types. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"651f282f63caa903e9dbe3620d0afd66171b7b7358b16515c49759b240662283"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Under the hood Daft uses structs for images. We should update this as we update the struct story. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3d1b906e27eb9425d8426b0539701bc0d7ee24c55d93552192ca298358d2cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Tensors are multidimensional arrays. We should update this as we update the story for lists. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"588353e42d4010bd956309b0f3f08f883c6a362727274ed3a2f41475d0ae9fd2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): For now we can create connections as needed, but in the future we can create lazy connections \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cddb53b479c6b76a247f54f0f7075bf5033200af09ca1f67ca5af798e4eb669"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): Handle options.s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"496e4286bebefaad6d307650989fb4840c1318d1d1282bd0715a04f70f675f60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): This writes results sequentially on a single node. We should replace \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__postgres.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2fb75abc3efc2f8dc13101e4c3c118a9e74366e36e7587e269030cddfe440f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO feat: add names to unity catalogs \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__unity/_catalog.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3868653a0a542ea0100899191fc45efc64780933beebdc41e5e1e6e567abff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(desmond): There\u0027s potential for image decoding and processing on the GPU with greater \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/ai/transformers/protocols/image_embedder.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dfc3c25b1740d996baf9b0a5173c7139f59777cb67cc6daced06b9cf4008a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Implement GoogleTextEmbedderDescriptor \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/ai/google/provider.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fc7720cc7b91472d8439c739c949f844bb3d09895aa60fe765fa38086d09f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: remove this once we support q21 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/tpch/answers_sql.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c29fd1c1820ecf0e1ae2c5f28ff54031211af5b5d1e409f547f2f80f8dec34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ronnie): improve visualization of results; simply printing them to console is not the best way... \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/tpcds/__main__.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b6d0997240f819213e64080d567211a2e3ba00d40fe0785a12836673cc8a26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add column to Google sheet before uncommenting this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarking/scripts/distributed_tpch.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8457354641fbb9696aeea24843034f50f1e5a73dc0c503460b4bef6817c2fd67"}},{"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 \u0060pyproject.toml\u0060 makes this repository a deployable product (line 24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pyproject.toml"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93f7a2c78f190233679ac8202a9f8e691d2305d697b777ee579589e9c4bff1"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Process links when DOM is loaded\u0022 repeats the code it sits on: 4 of its 4 words (process, links, dom, loaded) are already in \u0060document.addEventListener(\u0027DOMContentLoaded\u0027, processExternalLinks);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/js/custom.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ae35fb06404995eb578892a0dc789340fb3659bfbfc486976cbf920d9dcea6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022This sets the cookie to keep the sidebar state.\u0022 repeats the code it sits on: 4 of its 5 words (sets, cookie, sidebar, state) are already in \u0060document.cookie = \u0060${SIDEBAR_COOKIE_NAME}=${openState}; path=/; max-age=${SIDEBAR_COOKIE_MAX_AGE}\u0060;\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/sidebar.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e824851fe9e4b9cdb7b4fb4b8e27c628229c8a1c3fc2342ec5c041127e1c9661"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 3 of 84 project(s) overshoot their size bounds, lowering Project Cohesion to 9.3/10. The most over is \u0060(repository root)\u0060 (55411 LoC, 530 module-visible types across 60 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"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":"5843cb5fd36b002cbdc9fee772a539d62301edfc2c62d35f75b847a9c47106e7"},"properties":{"commitSha":"f3b53ea4379c2473080b19b359e4749bf85a1502"}},{"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":"58d8e47b7df182b1db02662f971f098ee051b4a28ca283e9f1c3e6ac4bdd73f2"},"properties":{"commitSha":"fe92fe9a98819a94ec5faf12a42a4f75db0e7203"}},{"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":"bdcc410c4f19a59556aeacb34f7b2ab1b21534d6f63dad683d20a9f4b19e517d"},"properties":{"commitSha":"bdcd7b4373db20689fbd27500925ed75a08ab30e"}},{"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":"9da7d9b4b6b6042875b901737d165b3936277d384ffeb3fc3c028648024de10a"},"properties":{"commitSha":"bc8aa084aabfb9f94ef820e3fb791829923cf208"}},{"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":"fb16bf2e6668ac72ae3f3315176c9048b73b13403e8c6410d83beb6de7b6d964"},"properties":{"commitSha":"bc8aa084aabfb9f94ef820e3fb791829923cf208"}},{"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":"b0e7a3c8780c0b5acb60e5160759bf909e3d551efbad66c0bb127c8ed621e972"},"properties":{"commitSha":"091e915f7868516cd8849581779543c298878c60"}},{"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":"1b5b45f9a84c8af996b4022a33f847f0cd7c0ff3233e8c40710eeb8c6a46d5dc"},"properties":{"commitSha":"091e915f7868516cd8849581779543c298878c60"}},{"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":"50d7685ece7b215ce7290316e095195b551dcdba20ac20719c775aa324931ed7"},"properties":{"commitSha":"091e915f7868516cd8849581779543c298878c60"}},{"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":"3ce7c468c7c9b2b38a96fc0f2b4d9f762599c2bc8ee95caab565a82972e86f57"},"properties":{"commitSha":"091e915f7868516cd8849581779543c298878c60"}},{"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":"9780f2667925920642fb15779088bc26214ac4d6f711b2c46a472ccd68a884f8"},"properties":{"commitSha":"24bb314827bf5350ea440040b98e00214274b433"}},{"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":"c1488f013922e3727bf12f390e2440150c022bb90db4e4a41cdc79c8ccfeffea"},"properties":{"commitSha":"24bb314827bf5350ea440040b98e00214274b433"}},{"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":"6a186ba0e49d6a884ba5e03807f8d3b132d47fb4ad471a2ec0e308bad4dd81b1"},"properties":{"commitSha":"f60e4fdf558d614454e66f945d6a1004bfd97f6f"}},{"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":"a456db10b2d3f21b6204fca981da9543ca18126bf51542095ffb01dc05bc0ce6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08e68ad772238f8631f161f9d7871f5bd74f350dc7b17af738bba374cf3d604e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6b16b6ab174110031492d8fd409c879c4400d371fc0597ff1a841871484f6394"},"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":"8380dff12b2c2281faf5a06e2befcdce7cf33936ff66e65d668f5034c8a0ceec"},"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":"a61f0e4efb239d529148d74e456bcdc99dc1102ced0ee2e3c7fca8d184f546bb"},"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":"33d989cb03b5db5ed07d86d00e42d589d33a8aa38ff1a72489e5bb8866c6c78c"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5538cb449489d1d8e2575c975c12c43b0ab85bfbb95530e2f52e736eb1178e28"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd528ce7194ab9260ad97be5d84de464790ce1a61f66f4ffb32190de12561d4f"},"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":"eccc7c02928190524665946a86a140b738750589ae0ecbc08893155010195dc6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9354f725fcdb727f41f1ddebd35e5e9e57288dd261668ca6c726ea74cd3753f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"08d20f63f9046b79b17d1a498d39d5bb3f7d8647211481ef6a7bf26989422d86"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f925edfb600a4ad79ebf16e6a8993191dc3a7f9168ffcaa4e3c559313c3223c5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2fe4fe66a332c41de68dcf2351ace60536b7c275640a0468af94e4069ba91ad4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8908461788ffbbe33b3702b7d58bc7c03fc41ec6f60fedf5dce6d29d0d1b29be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0b07d76016449256217c2ffd107d8b7689030104e11e28aec3f85a036b6bedc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"303d493cb47d58d74ed6472cd1006e16468f4232ab602ac7eb314ff9110ad131"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3ebd2d9a105c153495efda630a3b130855103a52190caed59af7d3f58b7dd6d4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e793a1e1f4ba702aefbac41baa4548616d66a4f7249144f4b6e99c7343198dc2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f656da1107048ffb1ab6dbebe3e71b730bfa7ce4ef78439c01302259b0b3e8"},"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":"0da85ce3d2c6226b1759bd67f81db08cffcdb939b23389b4e807eda43dbb4942"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c02ed076cf3ff3d30aad765f42b2e0162160ae2538b54c1a082b7dcc5badbca"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61b5d24786e60c7bb374debeb9595d1361c89fa115f16f3e50361863baaa3b43"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b051290aeff49646a10c918a90223dfdfa4967810f05fe539dafe028d08a6b23"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"611b0c4df13f3fd7811ed17d5f62fe80092ca198544ac74c42e9a04c2e974a38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c4c53bd264a8040c04e36ae6eb430477d4af1342b59685227677d8ca9a6eccab"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54ffdf7598cae573c8adbee130d6530ebdf6820aba8d4467c61f332fd7a3d0ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a510ab4023f3ec814c369be930077483d44441c1bda70b5367c73214272ba78a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"614fa7721bac0f7fdc5d8962a411d2479f160d3bcdf1d4212a98c52b06ce2f38"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59323858ac2da7563d156a503678f3a0a743b5d39855af62fcb876e971601a90"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d43ae115b9e750366397f0321f03859c7b1562525d8678f2e3c80d665427b3ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c431e9c4b00e2fb0b7b93dacd5e346a5b32f99946f87fe09f741d29d26a8eaa1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9638cc7cd1b68bb83339bc2efbc390d598e96b95a0dda7ff47b093b8f414769"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8750c7992e81c5652e19f4dc8133ea53263df79a20caebc7287220adc0367b92"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe1dd15e7d5471ff77ee3f510337147e7cc5129a02dec8f3ae276d5f65121771"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54f66b9658dd1ae82427adff9978a4711e46d4988ae0227bdfbbc40714549022"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"89191aa71d86e1242701e3ecff3e84e43ec91283d4f4022262db01178d6ea3f1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dd0bac604daad5ef98e6e9f6d20033bd4bb69c7948631a75e0d7488ec0b6f6e8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2a62416e8d0e64d82ec8d3ef8965b7323d40ffd8e77dc51e0128f65de438e22"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fa92a862eed479d9c4674dba645de78e1764f6a6c122d365d2baf90d8c098bb8"},"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":"30ce5c2643f82c0d437ac7219c09ee3ccd0ecc13d3f34a3e9ef3c7eed7f248dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"74fe384f3643c757cc94f54b75cff10044f17669b60cdf84f74b30418926df4c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b9e725f12c890876350f55b99fd119ba66781d9746b8c5aa0476b7e0a5c321a0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2152da0ee24614c042d827a3535184823dbc9dad28e515000a1d5057c16c6596"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"19db80d48c4009fc7ed39003aae8527e326811786501abd802351c26bd78f864"},"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":"1c8454b9e140c930f3dc2f4a80f29e0a9bccd1c82b553ecff7f0038a54dfb554"},"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":"dfc20e6f100f2c42c3c4964a4fd26b670c9fc1563421ff396883da013ef4f3e0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"babf9396d1d0ecad4b8ddc730b801e24d547440d957de52e7c198ea29326a7cc"},"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":"08d5ea659552228929f05b2ddc4745ac2e924be8e6fe5c7cfe6fde177b83aa61"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"538dbab1d82bb24eeadbc71d92d00836cba57d8ac0ce881ca26adfd40e65abc0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7abcd8f99f5d55f34fa3be220e129e70eb0d86a5cd0aa7771aa118c06f18a6c9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3a6f8c949722ec9f7b134e6e4cc503c0ac0198804fdb97db71f653cdda3642f6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d027bd97fb94312cf1610848a10cac73be574095ac2b377dd338a5602fbed74"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e67630f8e6ba9b5ce19a9b8b2d0c54991557bb0a9096967ddd0211b2af0de9ed"},"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":"776d62e8ba0e74870dd9bc50a6e60e3deed6111379617ed5afa3ec538af87d2b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"068d58d1b4a7f51bc6486e309d5e4bb62b68358e91f88d24e76a40b4c04bc134"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1601c2d5825881177d237d8537a5e00a9aae9849ccce0b2402ffd93440b21daa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84755c35050d3949bd20d6c4e6c47a0de9747cdcaf12564ec084e692d5c5715e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e98e30eba024a4631a495da63ef08f0e2c66f9b082983f5fc906200ee52e1e6d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3df9f4ff7b73fd4c1a5f7051eaf91d9a4b5cd930b78be8aba129385f4c8e4459"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4271a4f4da48675472f067a9c99759cb924f0627bf35745383ebf69b7a4403bc"},"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":"e62e488a1675d842ef0eb055efa67c076fa1f8642fe196525e5e564f5f2209ad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5dd20b31486a76e956edd30a06d835f0b51520e5ba3f3c7d8a861aba0c647250"},"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":"83262ec1035405ee3ce6c358fac9fcde8b0f1947786142ffb2f74661bec1bc94"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14e71714f891a4096ed82ff79670634f1644163540c54360468b477eb6cc9535"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eae036f2e0d612f8918367c2d7d044dc31369293422eb3ef38d9881bc102a583"},"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":"6eb1fd087cfb4f33bbb8e4f492f2cec3c7aa4272149b8c84861f45c6b6288fd5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"157ef1471cd4787abf14abb3f85cfacc79b24128f95cbc19b3eefb1ba236f7df"},"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":"708573539b025b2eaf8e4673a4dac1227c718833f4d1259241ebfa1382c4b460"},"taxa":[{"id":"CWE-269","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-4","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":"8b21f975a675107a79d4056d96fdca72d67fd650c62d51c556f1ae16a992ff71"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"92050769734f98c9a41f2f4f94f1dbb9f092479ac73e855fe781f881bf31d776"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ddadba1d7f8c11b9e0a91b7a2dc2f6f1a7eda074b10feea43ca8b17d138111e7"},"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":"4a59b73fddbb249958e25b30cf7aab54c6ce45985f874a8ec3c580be5b2e4590"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be27b95cf48b36fcaa5d83094ce3cf51554f2da4e79f6ae4121b988a75553463"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3b5e0b0325eb75c39822d665f0897f259f3ae2783d6be19edc327c85e66cfe53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"53299431925cac4813d1699df0621bb5ffb8026c674a4e14afaaf02355335402"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17845b0accad63e25312cdbcce59ac1c426323dc84b09c969a5c8bbe561625e6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cb74f1cdddd5319c554a221233411077795bf667d7e8816694638bdbfbdf7227"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"426cb3a50589dfe57bab5b547e322c7a99ec7b4be252c0d0f4aebf28fc6eff0d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3132a95a37932cf39cbe6da024a5513682eb80f8e2a80e8357a545e773fd0f58"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22159ff18650789ebae4b214e2a73f096dd985e77a52aa3538cad5657f273353"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"230aed30a148c164e72d6eb710bd152bcf9a69639fd056c15b71301f71393776"},"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":"ac7f39f564e770e25bab468c67bc124b6813c0c83f53223b16d9017d77845855"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84d74827960407d36c68abdaaa52136af0c57f3c284fb2f7fb268a7a479fb777"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bde9db4c7c076260fee7102f077bdc3679b834272926eacc977782e1bac0842a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"94a4e2167d6e4807d018f3dae9283af8629ea6dcf3e5ba8d8f92251b91eb1143"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6fb7f400a55d22fef40cf46a027bf43f5180fbb4179edffc8cbdf3ecc46e75b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa97624df60355df82428ef56cf7c4dd8cd6ae62714cce562df1d645dcd8afc9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0c9f2d43579ca4bfbdc1dcfc63733678c948d5110907ed5d46fbd30c96b1d197"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"809179239c4bef1dc3101aba4ae62a5ea6293731645f0304afe892148e22b371"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"af9f4d0de33b310aeac5c5069e71374bc9ce167d3330ebd6fd1bc9a2d511e9af"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5bc32782a8747d1b577bd84df8de944ece574ff4d725010bdff0414d78d616a5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1d2a10fd1183c9fcbf39e65eba155b81e9b723a19b670fa12e35b7a4a9e14cbf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e829bb4506d5910690080582005fb2516e4ed1556276381575c16a942df4385f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3f9533258f0d695807b893f5347dc969ba61bac17ec1a73cbb88793f87add5c7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17da864dca4919ea69aeb824baed567bd2459ac3865dcd3c1d353e7087bbba68"},"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":"0c76af19034bb823a8dac9adf555987491a774c22232e23f117e35333471c649"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b3e53b2dd3b06989ba74fe1ed139e70f8d2df3093cecba4cd45195511bbd710"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3671312cdcca720d7aa48b23b10e4e163a7adf5fbb38c843ea8cdd5aec732b9c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b40584f8a54232b0cea6d6af0570fa8da6f8e24d15c8f01040800a9bb9fb95f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"51e29a12462a4303c0050140f426bc09f58b3edf9784f06a60739febbf4bf74a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c252a29ee9debd44d28726c096818fd7a87c2ee00e9660b69c8ab72e9d11d7cf"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"22ff8b3c9627d11c5b9259ca097c40e6a7e40a87de09553c10bc1ed28215bd49"},"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":"0dce02a566834a5591509b599b462a00b8a3d133a6e3e3ddcb4efea0d08b2d30"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"810d2060c418732ad39bff1e09b1db3215b5bc5d213ac17f29d5114663389876"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e9c59cfc5bdc192e0a5f3ab1af2325e52c87ca76ef58c270ab2ccae0e670088"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"617e7af0964e0af429cb9d8eb0f210a33165bf2ef7a831691f800c0bf6d09e55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7a14dcd4902e9c2feb019ab34422575832582721e5caf5a47b8017b8306c39fa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a044189f7ff856910825c5e49708a8aaed3b38cd7d4dce5fa3fe7fb1201cd7a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f9b1514fdfac89641dc01b5a583d6e2a61bef27cc34da58a5bb7c665d4c33202"},"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":"12dd48e7cffa8a9ac8f08b8c41d01a12d110529985ee329ca30a4b6735de9a05"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4fedc70ca5cf8fea7bbad36610e2c5f3b89247a808b8902ac826b57b9d7275f1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c04688118d172acb9297e2898fdadbbe44875d462008b9c1a285d957a044232e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8ea8a156f71374a26206e31b62b5375c3014946e38d4ddf22d78948212dd344e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"80ed1532a7c638efbacff7e8d202d8053c7da1751ebdd87b9ccd213c0b157079"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f215ce04c7bf1afc60f0020a76fd1f350ba4920d0f9b88cc42b8cc8eb610db67"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11f996c9933ad38419fca24d8178101d83ef30485033fc0abda5fe5008852d37"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"96ade88f412c4d383a9726799b8ef175a2f43bf9673dcc7107d64eeac6fec656"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4025adac5613e1f15ad7e551a2361d84f7b6f5ab76143e66f7c62881f3fd3837"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9b9b05e8a655901beda6a2a47c38e3954eafab9794c4980f5a82ef11cd50f714"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"70918792834b259278e3ea747d90dc4128139c1223253798aae17a7b7a96986d"},"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":"9c59538cfd23d9d2563fdb454e6f1ec6bb9fe3e8a54791843c3115d3817c227c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a42413947c13b455806f9b7237c214748eb4d4caf145c64ede80539061d6ea9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"929f4c07603561e75fb96a2271a9fc842b73442a10eb659055767ae410867db7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f83df9bcea05b873816c6cde53ecc391370a9d025f9e09ab4055f41a4615d9ce"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"50105d16f56718b7084b6f01b5e46803b4f103b35d93a05b3fa138b485da94be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"97f0bfa66b31adf9f2c2bb669d4364b9295d660228b7eb17b17c71e81e4cc0c0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"188a4f8222dc7649b9d4462ca30fac9fb106551926b11b28d2b65e398ec87898"},"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":"1dc97c03dcbc71218c1b30f8d3cce6a041a6ff3bbf9fe8233f9e7419bbae104c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"55002870c2c099acf41031ab0c7eda171b16151baf64c39f2d6b9cb5e3bdc789"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4714f16badc4c4ebfd86b17c3266382095a584d76de3eacc468356dbbf69c41f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a2938a11a85d5be16303a4f0480992853ddc1213e5a6994d54cd87b9a530200"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bcbb745c2bfad051cd6f225b41c3e30b9228a916f78981511dba481f138667d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b0bd5d856f733ecc5edecd49f83a94031b1fa26b72e57bb2537dfbee86977bc9"},"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":"777d0bb021a7687887a5aa0695fa597d9cd076df480a0102d9197dae4b8b7890"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8304c65123230310541848947cc5bfab935fb12ce10a3f136e432ae6b054b82c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"01a52817e28f652660c7a9b73328e90096137ab185670a718b2d4b375f1f975d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a112a0070797aa298e11d806418a1f953820d9b50bf2c4f5e13dad8f8b8b40b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"641462fe04586303ad2e7ab0a84b6bdeaa492c3c5d20db69ba7ec1265611e413"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"299dc1041fbe7a53fc819a1696e227d46c4eaf648f0445a539e99f1cae8647d9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f2bf3d7192508fcfbe9bb2fd12eebf95d6e70ef49c3ef6e64ff8f2f64393058e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffd62f12393eb3d7856a01cb25537d9e43150d95554538d0f68dc240771c718d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b52bb161676118b0de3855c0f36be190da7d4668be215c9b18c67030e0e5074e"},"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":"d2f3ff0e24f0bed760596c42897d82e4356cc10e936c3f388f7d67f6b242ca7a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0381c5527de0f45f8287c517df3fd77dfc35e11816a7ede50ec1e3ff6f0b26b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c91ac79b8496e34684b3186733a3f25b9965b26d29a419673e0ef70169015d10"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"876616732aac324c28d29c219bd53f7a0b1e5e03516f649d10c82dee2a2f9563"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f27ad9ec925c8d0fae4882d19d6c8a9a10ae4935f14c6eb30a4a7e09dd6940d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffd0696d40c34153bccd95a6f0080e28f3e41f5681fcae50dbafa1ec2aa9b530"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f374112679eaf5aae9b26f990e7d43cea3ddf34aa90f9c9666a7fe76cba2ff0d"},"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":"0adcb91a227ffdd9b7c70e20b2596072ab95c7fb0f9944d4af5468494d83e0ad"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"93815d484662f247fb5a641a55b6f7308bfdd2a4893d50fb06cba203e09ec65f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f42e40672b1866e5acc828a1a3b73568f44975c2943c601463e0ad08a8ef6ac"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a3b84283c7ff0086d708627a2a067bed906e454a37f17378edcd5d9e2227642"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d05befabe897281fbf21a5c2817fe94088a4d0ab37121fd5a9fad3e7e48f838b"},"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":"18cd6b59b6663286c62ae2058157eaee81cab2fe30d74f0121e24420acd1e670"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8fb3fe645b4356ad4ad1ee6444e28d3793d3a914561a0276e9047b1f0805174d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fda110b94fa3ae040301f980e07cd26d3f280f720ddb17a705ad1de322cc2e6a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fdaa28b731415dff477056998a7d476eceefb7659da921dada4a7a523440f069"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bbd073e87cc28fc174f58f4a7e84df3c9e523814bf4823389dc631a0d34f197d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"735baa39768566aeb92aebec7190779446ba30a6a82585636e1599c2c1603ebe"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b4d88ebb1d2b3e5fd6c8bf1272611a5dff5ca4b31ea2c81f9aae583bf60065b0"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f36ee70b05254e159dc487c786c665d8ee588220bc522f8cb2b60439abd48be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3246d040a4d65f4f3a649d4c6824940a0fd46b7ffaa6c61d087b5ccc784499f5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"991396d752d4d8f033ccd846605c6d8dfaa945923d302330fa95170d27f1c109"},"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":"6ffd45587049a3ff0a27b4762ec06c2df4bd3ba40f07328a9b83cf6beeb0c9e1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"205de6327eaa4c5f78b1e509f6bb27e5b4cbc622e57d5697361f08e553fab3d8"},"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":"b94e6865695c6736b216b76c798c692d4c8266a65d33886f904876dc0c7de88b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"132f88f3715bc068004526bf2965c07b65db4b2ed35b6e41bad6ea64b689cadc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2b5687986946982598090a2ff0ad293fac9a56b9a2c857a2a6ec7138464326eb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f969b58f26469cf02268780eb94e07a6f71c4e0c8e76d3f5c751496ce9481514"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07e20a35fe315fb6f59546d0048a989d556ab3f9f15b5647589e75d94c4ec446"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"851d69081b1047d2ad88e630949d7cdc68e7da98359031df8f820267bc24a820"},"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":"6767d3f7a3b4b3f1dc3aa19fd4412763526e4c121cca42c7e50a6d9b34499d2f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3422e1339024ac2d79be17ff85dad7065262f8ceaaf45e509a8196ae1f21fb1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1a3763180567440acdefbe5ab9944bfbb1765cc93c7b643f045a9961e757c927"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c881707f32c0777a2000360b1423de048f9acea0c5b0e831a54a5cd9e48c6ae7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"834b60e8401b29350a774063323a009476274275dc5db8b00eb445a8fc638a22"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09edf8c1290eda5c04bd28002aa8357b7c4a89351eb8cd1c1702dedc3726f9d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f704a6becaf559b40666fd6afe935413932e8b2241185dcdae6dd4a08424a4e"},"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":"df695c1cc2a5ca30c9d98ec8b47b3c801d4768e4ccf84fad02b91eb589f3db99"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83828e3ca7db2d3e520f842649cdbd6542df796436b0d8eead90578d6a845615"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"17af04a441ea498ebb458c5d139cf99a4a785750b8fd43f26c39f97603c83081"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf31877f7208ed1e0a5bbbe9433bccb0034964ec04988ad299c3819b1157e92e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"31804181834397bfb4a6dfda75c8780989501c9c33ba5131c31d53e0c4b2ab5b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"30bf6ff11885d60566fd3730c48fe3a94d492fb41a7547248bc08cd9d538f69b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f604baf46db431e358da4af2a92873f8e10c7d1e2c97aea675daa1575ca4e53e"},"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":"d6f25903da97ba26d429504ea5738fd852372d6d7d819c13d6373734f2d9b7a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ccb19c3b4baadf7891fe1a07e8cfbfb990545cd7618eff9254d4000f8dbb3aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"07a44c4f56fb3aa7d7030352653417ade48a90ac63b45bffd8a39b328bd8ab4a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"783b7ee1d7b5a2d9134bdcdfdbff31945b07933b3d59a7dad6d4b85dddc2ad23"},"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":"dac84000521a73ed099daad4e5a137589a9851089c5aa87ceea93703da6164ba"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fc21fa3b06a433f77d4cc6ac2b38d4b7790617b17a5f315e8881c8093b6a066"},"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":"84ce545e3bdb7fc9f8a904f938800f4d9d824eecd60a03e85586baf31ab12f87"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1010e40c03a8ace354f49aa46d987502f1e2433480597bee12c91809f991f45"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6d989da098efa0380c0a9b7f45822defa2b9dd7aa470939bc9c9f6794250f71c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2a848d49dfcef11d248538df2733ceae4e4ffae0b6f4169da6292853230abeb9"},"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":"d7bbc907f3be0cc54d3a009ec32458f36a3ff3b08de60113412d8cdccf0ea6f0"},"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":"2817cd6d03a7c39740460271f17d0ec439ef61da222814a7ca839579d9644c55"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cea7946a594f0595594b45308d2f60dfef33dc808e7d6dfdcb3f7044956cae7a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b756ae8cf753ac0cab7b5b55ef3a9db22bc8ba3fbf5965d17c4702355d970fbc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a001dcbf47e5cc43d797bfa8431a5494c870c29ed8dfb8f9a4042f61720d3280"},"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":"160e2c022b6238ef52ff3ad183b76fd0a9989579e03525741548023e42401129"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security 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":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4771d1e421db4903244c06b391cd83b893756499889338ee038e179561e229fd"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e107b1d109a98335f52fd99a61cc931a1bc85d52ad8ac56a0b31b884a0345ea"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a3d25916f2b8b529a661fde64146dd8b2933096043583b6afcad46f6b45fac38"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"44d773d41fc07688e015424f6d0a2e13f0876a80551e81aeddb7bbed0a2b3838"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fcad69997370d54b1981b3632295f45dfec682c12206c9dfcc2a6831029574d"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5b23d4a52bdfda565cac4ec6984ff668c1cff78334e4efc9a1b45838b2996b60"},"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":"c4632a09365defe35867935268b4dfa085dfdb5e3d9f141adce904a8acee74c4"},"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":"429c6e58e9148502f7d5e4d1a2c8108f73f6c65af9a6e262e2a710bbe438b2df"},"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":"a86b264bcc1c6a3161671707a149351226cc50f4199f7be72aa21ae9ad8511d5"},"taxa":[{"id":"CWE-502","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":"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":"783e5d89aa4f92deb975e48d5ff2bf00b0756e6cdb06dbf0903ee18411a0a915"},"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":"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":"0a3ac1582d9f749684814dd638a3342afd2b71002b2571259b2f3b2f6fc100d1"},"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":"53f68c6d100fb367456fb721a1d1159ae6f33e15dcde7b8dc1b4d63bd46e1b9b"},"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":"192acf9fa79166622f92ca2fec62c32c5169954e2ed53084661eb9fc16be62a7"},"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":"467217e13dbe00a93d41cc807b82a48a35a7598b4c73d42c653729588dae3f6e"},"properties":{"dependency":{"package":"next","version":"16.2.12","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[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":"3b50b7de66196e3ea6650ad8a4781870f4ab5fc40a0dfebd109a7c6cbb2eec69"},"properties":{"dependency":{"package":"pyarrow","version":"19.0.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-113"],"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":"75ec0a186b2dc1601e1e7514e136438cadf40e6fd3d360de88b8f224ba31fbab"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.8","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":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f77d0d7409fc4d33e1f00c09f94fe6d74aff9a5d199efe86b93a7a75f151486"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.16","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA 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":"aa6254b95f1debd306742904dfe7f0dfed55912dddfec24da31432fd6180282e"},"properties":{"dependency":{"package":"js-yaml","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[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":"6487a31c08e7a421bbde1a8755fddaeb35aa78402e003abd7a13879446bfc11e"},"properties":{"dependency":{"package":"nanoid","version":"3.3.16","advisory":"[GHSA redacted]","aliases":["[CVE 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":"3a3373cf79d935707704766744153aac6a9a80e822daeac8528ef6efe5dcc724"},"properties":{"dependency":{"package":"postcss","version":"8.4.31","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"src/daft-dashboard/frontend/package.json"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"faee3c5c6963820ae229bfd97fbdefd38102399f10e7cbee9759b253377eddaf"},"properties":{"dependency":{"package":"sharp","version":"0.34.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA 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":"4d6bf2d9640d8798cef87437f9e24542b77e0f9868a7006277b751549088ea52"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE 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":"1d42ad41b2cbbc6a3dd6ab74f8ce0e74ddb25817bc8d58a251243b5e993ef891"},"properties":{"dependency":{"package":"zod","version":"4.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"759d36a63e8483c4a467399ff199fa57fa2e02d89ef311720974588edb9516d4"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"72dd4e46e2014efc37a4d400246a4c1ac204dc6819cbea215e2ea9dbecb3d398"},"properties":{"dependency":{"package":"arrow-data","version":"56.2.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE 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":"52c62bdd6b009791449fe13555d382741954498ef324d0e3d811a5c13455f04e"},"properties":{"dependency":{"package":"arrow-data","version":"57.3.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE 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":"0109f2367ebfb5a3de1bd35067909ff501099d1c72f982af07a57205360a225c"},"properties":{"dependency":{"package":"arrow-data","version":"58.2.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE 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":"de7c5b27edf18b74371359527697d4215905ed88eac03280a4a03e90f3065189"},"properties":{"dependency":{"package":"arrow-data","version":"59.0.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE 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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","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":"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":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","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":"1092cdc16bab90e26caa98781415518f2a1a0fec9b43d183894264e01dcc42b6"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","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.13","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":"bbe030f8c1c144f826bad4cbbd83ebd5ea8dfc9162bb9621a856f9f966813acf"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0002","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":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0253","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.9.10","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":"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":"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":"c978838fd0f9d1a522006a862490eb2ac66a98c575f57856f955efd0fffc7c2b"},"properties":{"dependency":{"package":"rand","version":"0.8.5","advisory":"RUSTSEC-2026-0097","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":"0ffcb856cc4b10f2fe3e669b7368bd9727181b15bed497a3ba752719ec135c6c"},"properties":{"dependency":{"package":"rand","version":"0.9.2","advisory":"RUSTSEC-2026-0097","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.43","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.8","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":"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":"9dd2bbf3f81320e023ee2083bf2d184f6ad3a9abbf7f0916d4c8df2610b966d5"},"properties":{"dependency":{"package":"pytest","version":"7.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1845"],"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":"07229f2de6f8d7c377b2b92d7ac3577749e52d66bfc98df6bf866224c033a80a"},"properties":{"dependency":{"package":"minimatch","version":"10.2.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"aa28c3c0668ba5e5b1d447ed417c5103f80f39c791b8aff05e6e6f5038dd5d42"}},{"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":"8f46a10d64c39d43df5a1ff62125a2b7d4b6ba4a2437935fc91e4ceff3b31d13"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","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":"669c9bbb038f011d91a1234236b966eddad32787005572c1dc797052b199fc36"}},{"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":"ad7842ece43c1d6c6a2ee57273af37e443c4685080f53a13c3d9c4db8c4d57c0"}},{"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":"96307ff0415fc3d2e802445347d3acfa22637b024baaee7971b14875b13de7d1"}},{"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":"81b077ed7274b57ded28f317b6d6cbb3c790f365a2f53263518d6e7d8ba29ff6"}},{"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":"d602a050f3a0d66471f581cf559410d7206c0f12fc8484322dfea8daea957713"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","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":"c5c30ecf8ef759241bcae5f78c24b9dfeb6dd51b4cd41ef56b418a92e7cd2b14"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","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":"1c0a0b0a08a815b483971b0208f68997edbde62215ab991b2f7d9230c4171cc8"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","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":"6ee4f4ce2ba5e51fe2c9116c767d680615a93f87e1f899771a0fd3918b821a22"},"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":"95ba57e887d38204edcb4385144a3280905cde54a79aecfd19aae640b19636fc"}},{"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":"edefa84d9033a2be80390cd0f3c844f98f664d3232fc560e53e1f924e0e85b39"}},{"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":"2034c66a0226e3362e6838f79b19cccc02e1a54a2776e4bd3a1cfe9cfe3185e9"}},{"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":"src/common/treenode/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a033239d6441afc9dcaf6b28243e4a0602e250cb44d79a19bf168052c547b035"}},{"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":"src/daft-dashboard/src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4462cdda83069f91f4c5cbd0fc0bb613155ed49342effae2eee0a9a1b20b94"}},{"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":"src/daft-core/src/datatypes/infer_datatype.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c3d88c0c1bd8803c7052edb578e0280fd05930dd3e151f1a72cfcf50738db9"}},{"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":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c0f6fd4a2f9f730217cce54fa5617d6e5985c2660e709e35bf0862a9dad8b7"}},{"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":"src/daft-io/src/object_store_glob.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b744b6d9853040ce735d715d0dd59dea6369bd6ca461ca56e080ff1839483c3b"}},{"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":"src/daft-recordbatch/src/column/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e59b275874786d68f43412463f00b4353b894abe12d91b9afbf3057562488b"}},{"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":"src/daft-ext/src/aggregate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2bf135cea254cfb8ed3b26292fe621c58cc1bee7a22efc1857718439cd62bf"}},{"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":"src/daft-logical-plan/src/optimization/rules/extract_window_function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8a820b972c55c952e505ce4585fb4126a0cb5224c11529548839d0d99e087b"}},{"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":"src/daft-parquet/src/reader/chunk_source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"277fd2e0b9572869cbfe6dab10487f13bcdadb2bf0b68c3dc889cf49832bde3f"}},{"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":"daft/functions/window.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42404d27d0c9ffabe0d925bac967f83989d6da263eda39c61315147d0c78e4d"}},{"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":"benchmarking/tpch/answers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"208848b962bc3a76804437e7b8943ed10c585549d21c418f164f4f167a8aeb06"}},{"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":"src/daft-dsl/src/functions/function_args.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a30c6510c007a03e1526ed2e99a9df82c5303d353d3350fcd7540b10bcde99"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 212 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: src/common/image/src/image.rs, tools/convert_md_to_notebook.py, src/daft-local-execution/src/join/probe.rs, src/daft-minhash/src/tests.rs, src/daft-core/src/utils/supertype.rs, src/daft-core/src/lit/deserializer.rs, src/daft-core/src/array/union_array.rs, src/common/image/src/cow_image.rs (and 204 more) (224 orphaned of 920 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; 920 of the 1372 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":"src/common/image/src/image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2801046a35996cc6952ae4c1f02047f722357b91720ea3fc955802885420da31"}},{"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":"tools/convert_md_to_notebook.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5754a848eff63270622ad8edc2dfb377ad64dd01c65fd299073899da104296d"}},{"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":"src/daft-local-execution/src/join/probe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df88346266665b38aa78f4f84985d5abf09f8d6683affb720de9ade392866418"}},{"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":"src/daft-minhash/src/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d8d16956c0da6b5922f9a16c8b7169647f99945998bde750c491423be2aefe8"}},{"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":"src/daft-core/src/utils/supertype.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4898c2d1ae9e85c09c5ac2548bcc19a5331a60862de487108bece3512373f8e2"}},{"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":"src/daft-core/src/lit/deserializer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb7f08697d7f364b00ce3768e93ee1fd626485fe6aa5274c39ebebf92ada213"}},{"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":"src/daft-core/src/array/union_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec6058cc88924eae2019df2386230aaf7eb37d1f645a7b74b1bf1a68d34d773"}},{"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":"src/common/image/src/cow_image.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ef9931d152944adf12e8a9cda42005ed44b21f8db3f07e33ea9a8154733278"}},{"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":"src/daft-algebra/src/simplify/boolean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa05e17ea2082b110761745df964da09b547c1b2938501f39536b937e6ac21d"}},{"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":"benchmarking/tpcds/__main__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c0fd5c4af1d8ae402e03c27fc551d4ea98e763727c16cef475eddd6d8bca79"}},{"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":"src/daft-local-execution/src/join/hash_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b7ee715a179a88f05ffed48cbda570c6aba23da91872681c4a52b3f10ef1c7"}},{"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":"benchmarking/tpch/data_generation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a30e705e78bdd5b1c47def98494145a213a2ec9ac02b7abc4528be4eb6e11ef"}},{"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":"src/daft-core/src/array/growable/map_growable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7e41865d0fb3c8cc0bf29f15187333fce27c7ffa9598381bfd39e0e62ca1e6"}},{"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":"src/daft-text/src/read.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f10cd81b2e6d349d6479b47a016f49f6f5719b7bf9b7075840fe0b15b539fe"}},{"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":"daft/execution/vllm.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fced9e7fb71a87166315c3f543d55139fe3143262dd62f523d950f69a5a48bb1"}},{"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":"src/daft-dashboard/frontend/src/app/query/tasks-grouping.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c16bd63aebd61a2fa5b8fc93f8ee1cdeaed39829b2f450250a990618f4a8ff04"}},{"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":"daft/window.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6898784a2a731f880a9e2dbf977ec89a45eccdd42e8cb595446932337ea9072"}},{"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":"benchmarking/tpch/__main__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f767e50512f7ff1dc062b624c1ce44cf136cd7c32a1f082f30cda7a15deaa0b"}},{"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":"src/daft-distributed/src/scheduling/local_worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b468282002283e9c3770de8bff7f554745756d9861ac53c6512d77e8efd8b1"}},{"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":"src/daft-distributed/src/pipeline_node/test_helpers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf564c984b7ec52fdb430ac3583c44168a852287665a7e859923a2fdcd87456"}},{"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":"src/daft-csv/src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4043ede0e5ecaf0e882a6614463d6e797c3525c99aa01247407d7ed9c1a38f"}},{"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":"src/daft-parquet/src/reader/rg_processor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a01919f2aa4d3973db79281d84614f460d876545f8482c04f276a0c3667705a"}},{"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":"tools/aggregate_test_durations.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8967ef715ec8a4dd7f8666e429a3405fb6c7d4d11ca90981a3ea73d8adc045c7"}},{"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":"src/daft-io/src/range_expansion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ceecb01df067db7e71dcdec7c227da267718a94dc7fe5db54ac0de4204950e5"}},{"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":"src/daft-logical-plan/src/optimization/rules/lift_project_from_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f6b25984336a32f2e1e554184c8af8eaf3eeb4f355bb1298741b79706524d2"}},{"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":"daft/io/gravitino_filesystem.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"884449152c15fe950195ec7176e65662097086e3408209cdc9823958cc4c8763"}},{"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":"src/daft-dsl/src/functions/agg_fn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aefb8a703500763105529d74fe8eae62ba474dcb757960f3870f418f277ce009"}},{"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":"src/daft-logical-plan/src/optimization/rules/eliminate_offsets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6efb1afd82935ed391529140c95d04ab3bac935f7da6f1ee9b97008e0a6510"}},{"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":"src/daft-logical-plan/src/optimization/rules/filter_null_join_key.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"710d7d8872c218be318309e2a8889b460114f829c6dbe3062952c4b8ce186102"}},{"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":"daft/io/paimon/_predicate_visitor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a66f5a1bec2d1ed9639f2f0cc751e73f5827558d2df28dd9587d5234b92d3f"}},{"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":"src/daft-core/src/kernels/cmp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b55c57b11981761fc8d50ffaabc0beefd80a1e977b65c3c65ac751b327b3f89"}},{"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":"src/daft-algebra/src/boolean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"384d9e088ed63fa2e9789d2d3e73d87672462e5d24246517513af585e067fc6a"}},{"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":"src/common/resource-request/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89fe0275b9c98ba4ff4718805515f69504bf74a0c5a8c6c73801cfa0bf8454f"}},{"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":"src/daft-logical-plan/src/optimization/rules/rewrite_offset.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc20e895b1500a5a391c511cca973e75d5151a4230668f66a7e898c2c9ea598"}},{"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":"src/daft-minhash/src/windowed.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c3cee168ef38cfcad1433e02d6d36f30efa4cb8188c8bcc96105331dbf7f84"}},{"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":"src/daft-logical-plan/src/optimization/logical_plan_tracker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de8febb4a1f5d1136c7c6646c39248b7bc990af262ba48a49ec01d06adc8807"}},{"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":"src/daft-logical-plan/src/ops/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a5f3ae2d0534f538bf65aea5a642597a996386c20f0cb7b2f2f34415714397"}},{"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":"src/daft-micropartition/src/partitioning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c155b4a0f53cfddcb065eb9685b9bf77ac4b537b7cce3ae63acf6c160309ef"}},{"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":"src/daft-algebra/src/simplify/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c857944a8385ac60152e43950518776827a2d7cadd4bc8b387dd13b9b8a21983"}},{"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":"daft/functions/url.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"555be81896f216374ee81325e9fe506a608e96b1001ade73f48e4a24201ce144"}},{"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":"daft/io/hudi/pyhudi/table.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"614be2b2ffca267b6484b5e6ecea49e8615b73024a8ffa74c9f037f349cab992"}},{"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":"src/daft-local-execution/src/checkpoint_terminus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5efcfe650881c7d9f86dd2fdd83a21193380c132a691324d316366fd818437"}},{"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":"src/common/display/src/mermaid.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83e41519bf4e3c8d905bfa1df39e63e8fba0bddf87d74e264a6dfcf3c73a670"}},{"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":"src/daft-functions/src/numeric/trigonometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc4ee5fdaee6436c6864343294cd18f027ebf0a3b772ebbfe56e69c8c1348c1"}},{"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":"src/daft-io/src/unity.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbb64505916d0573a8fdab889455ed8ed2b18f3631b4d81ed696b06a2bd2dfa"}},{"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":"src/daft-shuffles/src/oneshot_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcc0f4cd61128a3a3158cdd69025334534c6180ac706aa0653e2aecd074bd8e"}},{"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":"src/daft-local-execution/src/resource_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c376078e7ec26333a378f29c320cf9de7ba6c4bde553b48d8644beb4676af29"}},{"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":"src/daft-dsl/src/expr/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79b996607360513b0c55a71de419484b569fdc81cf4391169e2c8296b08bf7b"}},{"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":"daft/functions/columnar.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1df8a68e4a8a0992c6a6d1bf7c591f2503b744a50d0d793e84fb796c8a0f16d"}},{"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":"src/hyperloglog/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"313cf6d115bd9ff596fae1f1a60c6add69ae6bb6c444c6d61066680869ee3a5a"}},{"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":"src/daft-json/src/options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9da4f1f65e89cfc4931d3a0f59a63e5c755ce331ffc19e14be28b2b3a92fc86"}},{"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":"daft/udf/udaf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4365c0f7680dc6c3dc7955340306a81ff2f5da8de5b1945393006c4303f5d797"}},{"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":"src/daft-recordbatch/src/file_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0e22b1ae07de6bcd956a46724760e4ab29f6a7e55b5d34b5be94ffccbfb398"}},{"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":"src/daft-logical-plan/src/optimization/rules/push_down_join_predicate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7db19b7a1ca53753ec28cbf168486ce5d80fa34a58d3327d59d1b219ac5b69a"}},{"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":"src/daft-logical-plan/src/optimization/rules/simplify_null_filtered_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"151e207018d9f83cdb6793c64228c1e288cc3fab56d9ef6b32e379486c5378ee"}},{"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":"src/daft-dashboard/src/import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6709d38ea0f8596160f7ccd1c93b41564d22d72bb1355e17c674c3005a8ea3b3"}},{"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":"src/daft-io/src/range.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2864edf5980dbc4b8e4c00905388ae3f841e871174a031d018a1b399dd2cac"}},{"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":"src/daft-dsl/src/python_udaf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95216463e445335fddd756993ec49be07ee8f4aec7aa993317759f4fd13ab72"}},{"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":"src/daft-functions/src/similarity/bitwise_hamming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf26dc42f8dbd93a53844abd05e090b45241e3b6b35f19902c09e6f50a88459"}},{"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":"src/common/partitioning/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e83d408bd5e38910f5789ad36693a92093d14223aa6406b6ff07943ca9b31041"}},{"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":"src/daft-dsl/src/functions/partitioning/evaluators.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e47f719b0ad621fa0390f9768bf7bebd45f9bd18f61935ab7fe69f37b5d11f"}},{"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":"src/daft-dsl/src/python_udf/retry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ade8e028cc552bb5ef1a14acd7e9ac8f32601a348fbc5fb00e071a93fbfdeb"}},{"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":"src/daft-dsl/src/expr/bound_expr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbcaa7c2506bf4467828711202976d9d0c7dfb3acca31d043f7e5d6c4c6730e"}},{"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":"src/daft-functions-utf8/src/count_matches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"229e0fc3761013e3d25ea253ac319b10bfba54be716d7e22e3e20203f6c1854e"}},{"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":"src/daft-functions/src/hash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"533e1a6003f818ff58cbd53fee8042ccc3b389ff386de33e3bfdab2f52720755"}},{"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":"src/common/py-serde/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01be35658c80d9b1b2fcbfe4c4c32e7d38caadff9e645350c081308894c23a0a"}},{"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":"src/daft-core/src/series/utils/python_fn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecac825e29ffd036f56a087113c8286f519c8b4efb2d710695577e5d39f93c16"}},{"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":"src/daft-scan/src/pushdowns.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2445b7929c627b147c8a027c78d3053a352cb3b591fb7435b8ebb33afb99684"}},{"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":"src/daft-logical-plan/src/optimization/rules/detect_monotonic_id.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39559d815abf627200d6223bce62cf8980c833f2e244a2f10f4992d4acb930b0"}},{"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":"src/daft-stats/src/column_stats/comparison.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4bd43a4c7a08dfd043566e3071a767cd6bab28bb0cbc716e18743eaf544d7d"}},{"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":"src/daft-schema/src/image_mode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50b1604c14395630e310d8fb48f6d896c4fc42946bfeea44d9c780e755b662b"}},{"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":"src/daft-recordbatch/src/repr_html.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac0025858b34facfc3e8b18b47b45acfeedb2571b78963d967c7c6af679ec5f"}},{"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":"src/daft-functions-uri/src/parse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376ccec0e1add35ccd910ec2abbf44de7f95661d3395696a3dcd2b76a66e126b"}},{"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":"src/daft-image/src/functions/image_file_metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76820d6c974a6503a90b8913674ad3ffe01a2c176d2ac38862bf3b4dba7fc27"}},{"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":"src/daft-functions/src/vector_utils.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a8909cc0fda90c1a03ed77a9851b3a5f3a44aa3e9736efbababb796a17f384"}},{"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":"src/daft-io/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc81551eeb3d8c6ab43aa4f366fed968b88f18bc6589f3363863a91476e02808"}},{"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":"src/daft-functions/src/length.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be08810344310bcba4e2e7262d9b2aa5bff215b52ea85816f52069001013ab95"}},{"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":"daft/catalog/__unity/_auth.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff1ae718bed668bcea5c4899cfd9ef5b60c797f3783e1d33b4ac7190a1ec49d"}},{"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":"src/daft-functions/src/simhash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7ec9ead26a8ad6cb6191a878ff58f05463ddc1922a1dee8570c7b5bc2ab6f5"}},{"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":"src/daft-local-execution/src/join/cross_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81f9bad45ad2d674d17d0c90c4d7c54fe3a9425f8300f22991b0ebe5d80aaaa"}},{"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":"src/daft-sql/src/modules/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a384c9cb2e180b32ecf07c779ecfdb38771c404e196620425687a975dd146a9"}},{"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":"src/daft-core/src/utils/display.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aeec9031e235e335212ad1350c59d35fa2329c91ca910eb94c8cf157ee89eab"}},{"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":"src/daft-recordbatch/src/column/scalar.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd430e5a74463b5675641845dc463f115d6c018104cb4bfe3c965d38f3568f90"}},{"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":"src/daft-logical-plan/src/optimization/join_key_set.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbd389a7994012e55e81eee2445b1e8475ad95b580286a9c4ff60f46c0c9aca"}},{"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":"src/daft-geo/src/great_circle_distance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4d8aef77fff1320d1faf550d077107d78817d65a426ae5caf451ddee38fa26"}},{"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":"src/daft-functions-utf8/src/regexp_extract.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7456635947456c015ea4478c9573df755faabd6abbfc9c453236754fe88b6c45"}},{"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":"src/daft-sql/src/modules/partitioning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a8d8847eaa7fdf266a5f84e1d2709f8474fa6abc4207ee13427e4f8e9e2543"}},{"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":"src/daft-dashboard/src/events.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc29058fcc18d37144cf08c6bf73cfe0ad0abf9e28b38ae3fa9596a0772e9e15"}},{"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":"src/daft-catalog/src/pattern.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae6ff31862e5d0bc196f5651b41f3b8222b1dfc6058f5df75c5f733b15fbea7"}},{"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":"daft/functions/partition.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a03abe1bc57a74351fa083ecb4f4a124767e02e60d9f68ed53e4ade600295e"}},{"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":"src/common/checkpoint-config/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"218ab686e1506e510543219f0d802d4d1a5d79c1d42e2ae2860fabdefe12f5b0"}},{"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":"daft/subscribers/event_log_sink.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d111cf6e737145fe4a6d313f95a09670bc662b3183ee5579dce5507467ab3ca6"}},{"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":"src/daft-io/src/stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbd76717a919d229aae34db08865c29afcf8622ec1dd85521c20ef565351066"}},{"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":"src/daft-local-execution/src/streaming_sink/distributed_limit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b400ad1f63e0289e295b96f757a2c912030f87957afed9a7a14ce6d02b5748"}},{"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":"src/daft-parquet/src/reader/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a2e0b354313ba5950a3838b264a026f0f608622023a346f028e06f1bd245d7"}},{"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":"src/daft-writers/src/batch_file_writer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e0c65aee61e4a7856c359fc3c4ad647774d06a807d745cf3c95e136295d503"}},{"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":"src/daft-functions/src/numeric/sign.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"230be2b066052c0c2c6ea7531937c5a4c74801e28f063329d0054959e11bc427"}},{"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":"daft/io/hudi/pyhudi/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"774cfde3ea0b00eb9b5b9ddfc66eb7dcfa2c8b6c4dd95f2e2891ebed264ac487"}},{"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":"benchmarking/tpch/pipelined_data_generation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db89ac7b08b22e60abe93d4b08551261f17ad0360a05c403b2b21fdd3615e751"}},{"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":"src/daft-core/src/array/growable/union_growable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d0f237cc44a966330b4394de0c69872011c1c78f16e28cfb0e99791baf9f55"}},{"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":"src/daft-dashboard/frontend/src/app/query/plan-visualizer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f78706c2e7fcede00769a466cd707e99f873f51222cca5d27b8eadcbb987931"}},{"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":"src/daft-image/src/functions/resize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e83ca7e93a639cf74797987470cdafb5baf126c999ae018aa3b361f8c8e970"}},{"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":"src/daft-functions-list/src/seq.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc1790e11a76731842dc8852078cfa3f2ce5cffc8b7f7595868667c94557846"}},{"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":"src/daft-logical-plan/src/ops/sink.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db4b8d242fa8c38ee7cc14d14f825de8cbf227d37f6abb082aaf1776775726df"}},{"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":"daft/io/paimon/paimon_data_sink.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7888156599e788f56406e5a7ec235eaf40536f4015476a5c5274c5ba21ee1ba"}},{"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":"src/daft-micropartition/src/ops/eval_expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"460d1443eff0a8847584db2c16c9f2aa8329ceebfa41884692db39f092e07dd4"}},{"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":"src/daft-logical-plan/src/optimization/rules/drop_repartition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09dfdf810918b79b41c8e5659c4a3b6b21eacfb1d204c5918769bb36bcde311b"}},{"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":"src/daft-image/src/functions/decode_image_file.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccb773f3808f4d204e67a828e6087265f6317a5cc6d81875a19369ffa9f9b9a"}},{"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":"src/daft-core/src/series/ops/shift.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf132a7d3baf44fb812e2d9d141e872ed6ff036d2226ec2fb16b982afff0523"}},{"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":"benchmarking/asof_join/data_generation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec6e8758ae10c3d212d77ee15b636097af7dd84afc80d332e7a6c9cace36ec3"}},{"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":"src/daft-core/src/series/ops/comparison.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7803f52263a82737b2c5ca8c46a989fe1c1effecc7bbdd584080609eb2697ef"}},{"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":"src/daft-core/src/series/ops/log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a211d86679b340506a240b3a6c31f14d7b58a165ad6a4615e4580aa16c7c8b6"}},{"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":"src/common/display/src/ascii.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82422719b5d7594418f6819847c1f704dba7801d89090bd5450efa7fe3bac0c5"}},{"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":"src/daft-decoding/src/inference.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11849f1b30febbd618bb9fffff103d65682f8f1cee6b8ff463ab089a50ec2b00"}},{"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":"src/daft-io/src/multipart.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5783f8f9b129c4e5d558d1f8241d25d1dd3f690a118f73f080e4593c51eb66"}},{"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":"src/daft-logical-plan/src/optimization/rules/split_explode_from_project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acabc470960dcfb3a00aa64d764b62d1ccf4955000b6399cfddc3206a29fcf6"}},{"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":"src/daft-core/src/array/growable/logical_growable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f31f51bd1d96957ccca0d273b1ae5eb25b3c93b24dd65709a70f2dac916ed8"}},{"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":"daft/functions/ai/_colab_compat.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4c12f1fc8d0e72bb9b668aec570e7ac3f38797f57e615473ccb90cbd32fe9e0"}},{"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":"src/daft-dsl/src/expr/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc65e960c745740d3e694947037c04a1ad86cdf8801ca423901f9a0f03117e82"}},{"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":"daft/execution/ray_distributed_limit.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94e8a56bc096043e1620248bc01d6cbe9ace738697fd1579cf34a24feddde66"}},{"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":"src/daft-local-execution/src/join/sort_merge_join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c054b1e2ce1d38e201374a95139fc192095b3fca425d7a1df58741f761b25973"}},{"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":"src/daft-functions-binary/src/encode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"338331a08d87d8fcbf54debce82779f0078562a82b66bec8e7de7ba1372ecfee"}},{"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":"src/daft-functions/src/numeric/log.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1617df74ebe0513b09418c7a52ec4f61039780eac34250b6d186507f6b081b18"}},{"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":"src/daft-recordbatch/src/ops/window_states/first_last_value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56f6a269ec98baa5df573fb96489fd7286e92287b637fe41a0a8dd6ff9c58fa"}},{"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":"src/common/metrics/src/operator_metrics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb760cef7def2e75cdfb02ecf758c41385fd73e300e1906165f6f41048c131c"}},{"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":"src/daft-core/src/array/ops/map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bed90abb8890b75559566aa9618ea270ca3ec130deec6148542101594f4af7"}},{"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":"src/daft-partition-refs/src/flight.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ac6150bfe69d316a095eb45742ccde9ac9ecd8e6f79d9614bdb1d85e243d20"}},{"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":"tools/git_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66ffc89407946a1a8715a8d054d461e75e535673ffd1cea979c3c600be324fd"}},{"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":"src/daft-checkpoint/src/impls/keys_codec.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8ee5d3024a0ff6a5d27661c01bc60a853fabe7ce590abc174141edc451d5d6"}},{"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":"daft/io/_text.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd94906fe962ecd8f59a04370665a3d2a00f8222678d4fcb2faeb62ecda4d86b"}},{"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":"src/daft-micropartition/src/ops/partition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aad579990e6b78088b9821daa45c61ec884545695ee83aa4d2e7cff6f015ea2c"}},{"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":"src/daft-functions-utf8/src/hamming.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda0f61abce2449883bcf79671c1fe7110b19a89eba24f385c1fa946255a7f47"}},{"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":"src/daft-logical-plan/src/optimization/rules/simplify_expressions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c8b49ed8c6e46027e18a8b0fec8b260ba237785ba699ef73968633de77d622"}},{"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":"benchmarking/tpch/ray_job_runner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc6a593db23128163ece3f41db458d0d2a5031ca94a05647ec12207f8a45572"}},{"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":"src/daft-image/src/functions/image_hash.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e128c5bdf98680d73886f1ec18e2c93ab39bd200d88af43a00e99a8a0e9efd5"}},{"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":"benchmarking/scripts/run_ai_benchmark.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d046332866001436ef8d3625c6558b951b8c99421fb6ed2c4f65263780826290"}},{"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":"src/daft-dsl/src/functions/agg/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65796882b007bb8b3a0825e0637d2e2915b02d681f9863795df384f3fc693b40"}},{"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":"daft/catalog/__internal.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abc9b7f8ea23c8bec1434588fc32b250d1f7ecb6354be93a9a0d8fb418ad83d"}},{"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":"src/daft-core/src/array/growable/struct_growable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17d64f422dc9896da62ddf002c49e43897fe9324c5870e885e0cbe8afafa2a4"}},{"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":"src/daft-logical-plan/src/ops/pivot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d80625d150897dbc93f24021defb19ded22b906e38e3ccb58324c4643fdbf4c"}},{"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":"src/daft-logical-plan/src/ops/sort.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d43b221d7da764483a6102a50f37a56bb5380439983a77c54b93d395ac1ba99"}},{"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":"src/daft-functions/src/numeric/clip.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"804c4dcfa5b181294d86709e2a9a276f07c40eb7d86762e16a315aab2e721641"}},{"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":"daft/udf/agg_execution.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4de910d805c5b74b57b0c37325dd797ae8cbaf554d54d98214ac94a454466e"}},{"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":"src/daft-functions-utf8/src/normalize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c328a1b4faaed7ec2c7c0b5e3034850e87362e0983b30afc84dfdfc0bde63ec4"}},{"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":"src/common/io-config/src/azure.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8862db41f371adc969b227968d291b0bc5989d695d1bd486b9a1e957b8e36344"}},{"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":"daft/io/clickhouse/clickhouse_data_sink.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"400502f21af2c4dd6ed2bfca8ebf04adc8a9e669a217f9061edec4ef98484a75"}},{"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":"src/daft-core/src/array/ops/trigonometry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4466e8e7bbe6745999ea9ffb208cb5cfad15c7f542e7fde76ff9d25d7befc013"}},{"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":"src/daft-recordbatch/src/ops/window_states/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6051249fa504610ece7b2aa0acb4769999c4e48e352f58100f7d4db6d4fa3aba"}},{"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":"daft/recordbatch/partitioning.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"306d6394605a734630b0379b9cee5f4a63fd8f059bd53ca8c72193a3fee776fe"}},{"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":"src/daft-core/src/series/ops/logical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a34abace372dafb00de0c036e0ba7ca623066db86a045b23a53bd46da4fdc7c"}},{"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":"src/common/pattern/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d6a3a93252e581e7287c9fcadac520df297440716079faa11eed5d2873139f"}},{"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":"src/daft-logical-plan/src/source_info.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4092f33fd7b19165216ba15304759c3d1f482d760d8d8f034c54ba8accc0e8f"}},{"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":"src/daft-core/src/array/ops/percentile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2839484f9b7c099fc6903700d5002dca259e4ea80f35f37e7a581b310b1889"}},{"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":"src/daft-logical-plan/src/optimization/rules/drop_into_batches.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c301a5cb4f5fd418607477d6253efc5d9be828747b3bac09c36d189520cb357"}},{"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":"tools/gha_run_cluster_job.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab8b618c1119e351c25c7ce282c674ab18e9415484b12784de88e290ce25ae2"}},{"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":"src/daft-functions/src/numeric/exp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36f53096f4176cf1f00b1cc7a2ee104d9a5801973b0ee1961e21b33b9f97988e"}},{"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":"src/daft-dsl/src/join.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad91ad4ce72238687d4fe605e2b425990b73c7892753f935210e18f0632ebcd7"}},{"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":"daft/runners/profiler.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2029d808e9cd7d7ce8ec179fbd7e48a138e44741105b91488aa4d24e29a50340"}},{"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":"src/daft-recordbatch/src/ops/window_states/mean.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e15c55b9e9176a0c9cfce02207914460c708db4eb446ab1af9af798ae4bea68"}},{"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":"src/common/metrics/src/task_io.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eca703f41e4b370db467aaa7824f14c9cbc08652fea6c38d5b0ab4d0ff943c7"}},{"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":"src/daft-functions/src/float/fill_nan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33c042e5ad3a8541dedcca7d270f360d17adb4a9bdd6f98c8ac5baf7f51be57"}},{"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":"src/daft-core/src/array/growable/fixed_size_list_growable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa95a7eb531a306105d0bcf4fa05657216bd70995e6619da0040f86d97a8e49f"}},{"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":"daft/functions/struct.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90f1c53a1384acd0fbe766abb60d98c0a65502a361595a38668b747a4428832"}},{"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":"src/daft-functions/src/concat_ws.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3f4fb20e49089c71d3213c7dc6d39c180a02ef2a3386ba24857becc40ad365"}},{"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":"src/daft-functions-utf8/src/jaro.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3cc2197f236bd295f78507bb406196fc19e3c8a0864ef8b1eef61ed8357c01"}},{"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":"src/daft-core/src/series/ops/between.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d47ed24d32452e20d43e832b0193923e3238c55014fc9d8f1a2de8cbc5e9a85"}},{"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":"src/daft-functions/src/numeric/round.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf57891cac1c97c2537d5619c9274fa330de9def9b0f6668cb0c4a9b85fb9e7"}},{"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":"src/daft-image/src/functions/hash_method.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bb62eadace2a7bf0f9b33a56cee1eb8d4e4d746ae0997890e8b4b800e56b95"}},{"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":"benchmarking/tpcds/ray_entrypoint.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"791892e8ac9b9588defd852a64271d52e6cea8f54262232611047dcc566fcf98"}},{"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":"src/daft-compression/src/compression.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e0b2b54a6b85980eef4798ee21b2bf156610ea0808491ccb1991a32b49eef7"}},{"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":"benchmarking/scripts/distributed_tpch.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2436a864381f2883e50dfe3066aae86427e5c4b3cddffd51f0939e52784102"}},{"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":"daft/dataframe/_checkpoint_commit.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e65e2f0596803fba2758e46e2ff2e55f54545d1f53960eda28d643978307a9b7"}},{"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":"src/daft-core/src/array/ops/between.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b34f76d81f754199dbf34f280026145f26bead0d61e8ce5505adc63119506a"}},{"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":"src/daft-local-execution/src/dynamic_batching/static_strategy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4513b1d4f772ab13e3b9ada42921580b415e33f1a1b1901ab61a9db229004419"}},{"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":"benchmarking/ai/audio_transcription/ray_data_main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33b81e717e977f33c4febf132dafd0b2bb347397ca1e42fd4d98dd6501f7c42"}},{"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":"benchmarking/tpch/answers_sql.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9633d01738ed62843a1bec222a1d4941bb238f62e899a317034e199f4af7c63"}},{"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":"src/daft-image/src/functions/decode.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04f72ba5b8b843e0adb3e258fc28a72b82e084c36ca096a9adef6b38964bc8f"}},{"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":"daft/functions/distance.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c49c651b7a1ff0994966d3a674236252effdf4905858dea5048cda7d0fbe9a1"}},{"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":"src/daft-dsl/src/functions/sketch/percentile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83bc2a85cd2bf93a0c4771fabadc3619c9a375f4c27fd89b4fd4592b69305755"}},{"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":"src/daft-core/src/kernels/binary.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"819a77752bf463b6dc9004f1505ee9e9cedfc9156aad32db919e275b1946c55c"}},{"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":"src/daft-writers/src/catalog.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3e9d900a48eac208a291e8c62a1a359901dd57d860bc9825d867d4c55d2fec"}},{"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":"src/common/io-config/src/gcs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d8af615d7d50766172524cf4b0bd6dd4bed5cb19b6daddcff6b239dd38f66a6"}},{"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":"src/daft-json/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7e7ea0dd4a03a77d7955cf083ee8b93cf7d40672fcd826e178488e3570bc94"}},{"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":"src/daft-functions-utf8/src/levenshtein.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"611017216f77e555ca820c830eef04c7a168b5ba4dd93c5370058f3375c438cf"}},{"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":"src/daft-core/src/array/ops/merge_sketch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad7b3f61dd80f8b02733292e9f67645cac732a36d812d746f3b083016e7deac"}},{"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":"src/daft-stats/src/column_stats/logical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"655e25517b3f3e04b81c0da6bc8e8b57c6e6ba9bfa5bd934d30529a490bd4a15"}},{"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":"src/daft-functions-utf8/src/case.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c35da92cee17232bf59372bc44d4f030fe3923ea4ff962bafe6ccba51e8b4e6"}},{"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":"src/daft-distributed/src/scheduling/task_metadata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"784aaa02ffa23c861790e8fa8b53628fb34e44b425a7dbcbebd00abe83ef0d8f"}},{"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":"src/daft-recordbatch/src/growable/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c40cb795ccd29898f2e37517c5ac268b3a3991a20ff2fa040189fca82bab0b"}},{"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":"daft/io/hudi/pyhudi/filegroup.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5b4780b25887665f8d80838b869dbdc7b34a9ecbc842fea51eaf3b0e86024a"}},{"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":"src/common/ndarray/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0d6a04c33c5d1768f35305127679b8b4a59e957a40bfefe2b8adedf8b7e176"}},{"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":"benchmarking/tpch/subprefix_s3_files.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"349de0249e565ac1850632e85e8b49d0bfb2c116fad1ab983c53edcd4c9a8791"}},{"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":"src/daft-csv/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"142717287ed40d5a5e7448bcfaaa8eb1c410745d3389cd0ed739fc19175d8a34"}},{"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":"src/daft-scan/src/partitioning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b71c37654f45f7f67b1edff223a1ba5045cd18d24bac0dfe2f130f10049e944"}},{"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":"daft/io/hudi/pyhudi/timeline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef7bb58ee11e15e8d5f59bdd4145fc823b4f7592abf18d500793674d6048831"}},{"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":"src/daft-image/src/functions/crop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"742b93f8205e62e5f20634db431f03b626104bc8750d1ae8f8e92175325841c9"}},{"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":"src/daft-algebra/src/simplify/null.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85c679af5f926cacfbe658fb19083fbf0499df3ca514410c810edb7dfbc1e3b"}},{"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":"benchmarking/lerobot/real_datasets.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc9df4c9b2fad1fac7a8827df09f4a7b946d4975dae08aa9be8943ae93ba16e8"}},{"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":"src/daft-catalog/src/function.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"debf3106dc67ab6f7ee69224aafcaad39a90f2265a6ec2bf2545c973a0c6a1af"}},{"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":"src/daft-core/src/array/extension_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d9378ba654ed3c6c90bc441512bb2e722fdc9748387507fc3e8dfa6a10e08c"}},{"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":"benchmarking/lerobot/sweep.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d12020204cb8d5f8e78fb54aaaeaeec3a0d689745c2a0088c850940ecfa5ea48"}},{"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":"src/daft-dsl/src/functions/struct_/get.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14a3f596b7c5d21dfa7cbf2be6bcc2c8c4c049be5d1ad7b9139ad26f1741b04"}},{"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":"src/daft-functions-list/src/list_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7b0cd7cb0f07602e44f7d39ee4bff6796d010f527fbc2deb310c9c9d219e75"}},{"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":"src/daft-sql/src/modules/image/resize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee7889ef39970cfbb5492571ddc04a17b096d390f87bfbed5090163b84889db"}},{"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":"src/daft-dashboard/frontend/src/app/query/edge-label.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b049b0adebb8861853ca0636afe81824c21a84aed83c6dbac355fd24f918f3b0"}},{"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":"src/daft-functions/src/similarity/pearson.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d526eb547e8409f7654e12fe641155229d198d16145663b3cb517cafb47db00"}},{"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":"src/daft-core/src/operator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2592c656d0f64e4ed611257fbce45f69b0d14c33b98941bf41adc954f0e7f7c"}},{"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":"benchmarking/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5646596163657186a96a4ae5490908e42b2749b2ca8c1b6322b45765fd9c26a"}},{"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":"benchmarking/ai/video_object_detection/ray_data_main.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f341adabe49d066363afd6c3bb9778d6d088f82cf8b3bef305f9ac46cb4e9728"}},{"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":"daft/functions/similarity.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b73cad70f27ebd7f5af4be7c6e873eca555f74ac6977bd7741464ea723a6abfd"}},{"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":"tutorials/flyte/app.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1f461382f9abf553fe4288b77751ae216c2364d9f30aae94c9ee7ab246986d"}},{"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":"src/daft-core/src/array/ops/bool_agg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e38167e4168fd4cfb7d58f9272a3a8dfb0325af8512df243be60117695faea"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: dashboard.rs \u2194 state.rs: \u0060src/daft-context/src/subscribers/dashboard.rs\u0060 (context daft-context) and \u0060src/daft-dashboard/src/state.rs\u0060 (context daft-dashboard) sit in DIFFERENT parts of the tree yet change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u006059be0182\u0060 feat(dashboard): per-task progress updates from flotilla workers (#6838); \u006092d0b50c\u0060 feat(dashboard): plumb TaskScheduled events to distinguish pending vs\u2026; \u006051eb85bf\u0060 feat(dashboard): show task sources in tasks sidebar (#6879) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-context/src/subscribers/dashboard.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"141f251c63f853136c57dcd5ecd4c3cc3dbad7adbdc6cc2f0d6e303a8c105c48"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: project.rs \u2194 lib.rs: \u0060src/daft-logical-plan/src/ops/project.rs\u0060 (context daft-logical-plan) and \u0060src/daft-recordbatch/src/lib.rs\u0060 (context daft-recordbatch) sit in DIFFERENT parts of the tree yet change together 72% of the time (33 of the 46 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 33 shared commits counted here, the most recent 3 are \u0060b4166ce2\u0060 feat: add try_cast function for safe type conversion (#6960); \u0060ac54bc7c\u0060 feat: add Python UDAF support (@daft.udaf) (#6790); \u0060150ef6a0\u0060 feat: introduce AggFn trait and two-stage UDAF aggregation pipeline (\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8715ba31a7d887e96bc82a2c071759cff16662030e5a1a9cb4ae109e2d70fabc"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: pipeline.rs \u2194 translate.rs: \u0060src/daft-local-execution/src/pipeline.rs\u0060 (context daft-local-execution) and \u0060src/daft-local-plan/src/translate.rs\u0060 (context daft-local-plan) sit in DIFFERENT parts of the tree yet change together 71% of the time (34 of the 48 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 34 shared commits counted here, the most recent 3 are \u00600343b43f\u0060 feat: first_value / last_value aggs for window functions (#6974); \u006064cd1a69\u0060 feat: add forward ASOF joins (#6918); \u00604f5256e1\u0060 fix: Handle dtype mismatch error in join_asof join keys (#6904) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ffd3865ab104440e3d762e82538ca040c8cb3dae3f28bfa1f0caad4cf1b6844"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: optimization.rs \u2194 lib.rs: \u0060src/daft-dsl/src/optimization.rs\u0060 (context daft-dsl) and \u0060src/daft-recordbatch/src/lib.rs\u0060 (context daft-recordbatch) sit in DIFFERENT parts of the tree yet change together 70% of the time (14 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \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 14 shared commits counted here, the most recent 3 are \u0060486f6c63\u0060 fix: short-circuit evaluation for coalesce (#6525); \u0060e992e590\u0060 feat(window): Add window expression definitions (#4168); \u00600c57abd8\u0060 feat(window): Add window function definitions and skeleton API (#4082) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/optimization.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f55ea1e78823f4eaa7948ff3738f7c282295fe4fb3c265ee83dd0f849d6b5f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: translate.rs \u2194 json.rs: \u0060src/daft-local-plan/src/translate.rs\u0060 (context daft-local-plan) and \u0060src/daft-logical-plan/src/display/json.rs\u0060 (context daft-logical-plan) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006064cd1a69\u0060 feat: add forward ASOF joins (#6918); \u0060040c09fd\u0060 feat: Point-in-Time / ASOF Joins (#6615); \u0060075f4342\u0060 chore: Replace RepartitionSpec::IntoPartitions with custom path (#6349) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/translate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2d1d5cfe1fa21626110b73b7971ae1e9ac464ca17af4af261853f8234b1c9f"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: expressions.py \u2194 mod.rs: \u0060daft/expressions/expressions.py\u0060 (context daft) and \u0060src/daft-core/src/array/ops/mod.rs\u0060 (context daft-core) sit in DIFFERENT parts of the tree yet change together 70% of the time (51 of the 73 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 51 shared commits counted here, the most recent 3 are \u00609ee52ec0\u0060 feat: percentile and median ops (#6153); \u00609411ce86\u0060 feat!: add ddof parameter to stddev (default ddof=1) (#6142); \u00608926b6bd\u0060 feat: Expr.var with ddof (#6105) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/expressions/expressions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8226f189cd60747301bfcab692fbc290f71a54fa81a676890c1a8d5d21353c01"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: expressions.py \u2194 mod.rs: \u0060daft/expressions/expressions.py\u0060 (context daft) and \u0060src/daft-core/src/series/ops/mod.rs\u0060 (context daft-core) sit in DIFFERENT parts of the tree yet change together 65% of the time (35 of the 54 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 35 shared commits counted here, the most recent 3 are \u00601c97c27f\u0060 feat: Add pow expression (#5237); \u006063ffd5ea\u0060 feat: Adds list constructor to Expression and SQL APIs (#3737); \u00605549d16b\u0060 feat: add binary string operations (length and concatenation) (#3646) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/expressions/expressions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"891988ca1abcbc071b8b9d9b00605773058696040834a6de6953ad167e87efac"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: builder.py \u2194 sink.rs: \u0060daft/logical/builder.py\u0060 (context daft) and \u0060src/daft-logical-plan/src/ops/sink.rs\u0060 (context daft-logical-plan) sit in DIFFERENT parts of the tree yet change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060cd8592d1\u0060 feat: Add generic interface for custom data sinks (#4244); \u0060b519944f\u0060 [FEAT] Delta Lake partitioned writing (#2884) (at that commit the file was still \u0060src/daft-plan/src/logical_ops/sink.rs\u0060); \u00602c13f17d\u0060 [FEAT] Iceberg partitioned writes (#2842) (at that commit the file was still \u0060src/daft-plan/src/logical_ops/sink.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/logical/builder.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e01ee750da17d6c6d4f046590f95810ba41570e75bf4263f710b379fdcaa167"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: recordbatch_io.py \u2194 sink.rs: \u0060daft/recordbatch/recordbatch_io.py\u0060 (context daft) and \u0060src/daft-logical-plan/src/ops/sink.rs\u0060 (context daft-logical-plan) sit in DIFFERENT parts of the tree yet change together 64% of the time (7 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060b519944f\u0060 [FEAT] Delta Lake partitioned writing (#2884) (at that commit the files were still \u0060daft/table/table_io.py\u0060 and \u0060src/daft-plan/src/logical_ops/sink.rs\u0060); \u00602c13f17d\u0060 [FEAT] Iceberg partitioned writes (#2842) (at that commit the files were still \u0060daft/table/table_io.py\u0060 and \u0060src/daft-plan/src/logical_ops/sink.rs\u0060); \u0060230508f9\u0060 [FEAT]: write lance (#2421) (at that commit the files were still \u0060daft/table/table_io.py\u0060 and \u0060src/daft-plan/src/logical_ops/sink.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/recordbatch/recordbatch_io.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2af686232f8b27cedaba7e653dc91d381831191331fc70f4300f47549a958f28"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 aggs.rs: \u0060src/daft-recordbatch/src/lib.rs\u0060 (context daft-recordbatch) and \u0060src/daft-sql/src/modules/aggs.rs\u0060 (context daft-sql) sit in DIFFERENT parts of the tree yet change together 62% of the time (13 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060ac54bc7c\u0060 feat: add Python UDAF support (@daft.udaf) (#6790); \u0060150ef6a0\u0060 feat: introduce AggFn trait and two-stage UDAF aggregation pipeline (\u2026; \u00609ee52ec0\u0060 feat: percentile and median ops (#6153) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-recordbatch/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dadecb8c9bea7a7f3c30e675c49cc95be0518ec220fef59e80fba87eab36501"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: series.py \u2194 utf8.rs: \u0060daft/series.py\u0060 (context daft) and \u0060src/daft-core/src/array/ops/utf8.rs\u0060 (context daft-core) sit in DIFFERENT parts of the tree yet change together 61% of the time (25 of the 41 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 25 shared commits counted here, the most recent 3 are \u00606fe408c5\u0060 [FEAT] Adds str.length_bytes() function (#2775); \u00608544b763\u0060 [FEAT] Add \u0060.str.count_matches()\u0060 (#2580); \u006029b02a14\u0060 [FEAT] String normalize expression (#2450) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/series.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"197afbdb4c0ec0f7661a058e985ec807229629f2c0cd7ba76f7cf967e6a679f6"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 python.rs: \u0060src/daft-core/src/array/ops/mod.rs\u0060 (context daft-core) and \u0060src/daft-dsl/src/python.rs\u0060 (context daft-dsl) sit in DIFFERENT parts of the tree yet change together 60% of the time (44 of the 73 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 44 shared commits counted here, the most recent 3 are \u00609ee52ec0\u0060 feat: percentile and median ops (#6153); \u00609411ce86\u0060 feat!: add ddof parameter to stddev (default ddof=1) (#6142); \u00608926b6bd\u0060 feat: Expr.var with ddof (#6105) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4b6c2f94d21d0159901e3989da6821f5a369f023d372faf0cb31c1b64fac6d"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: translate.rs \u2194 json.rs: \u0060src/daft-distributed/src/pipeline_node/translate.rs\u0060 (context daft-distributed) and \u0060src/daft-logical-plan/src/display/json.rs\u0060 (context daft-logical-plan) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060040c09fd\u0060 feat: Point-in-Time / ASOF Joins (#6615); \u0060075f4342\u0060 chore: Replace RepartitionSpec::IntoPartitions with custom path (#6349); \u006021afa098\u0060 feat: \u0060index_col\u0060 option in \u0060explode\u0060 (#5842) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/translate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ab565bf0cefb078fe18bc7a08f10466065c7488153bad9dcd7673cae986c052"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: translate.rs \u2194 unnest_subquery.rs: \u0060src/daft-local-plan/src/translate.rs\u0060 (context daft-local-plan) and \u0060src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs\u0060 (context daft-logical-plan) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060040c09fd\u0060 feat: Point-in-Time / ASOF Joins (#6615); \u0060075f4342\u0060 chore: Replace RepartitionSpec::IntoPartitions with custom path (#6349); \u006023508c49\u0060 feat: implement into_batches on the swordfish native daft runner (#4935) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/translate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e118468acd4a12155c172bb1ddd8eb78423a91eedc0aebfad124f1c8960d22b8"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: ray_actor_pool_udf.py \u2194 actor_udf.rs: \u0060daft/execution/ray_actor_pool_udf.py\u0060 (context daft) and \u0060src/daft-distributed/src/pipeline_node/actor_udf.rs\u0060 (context daft-distributed) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060e368b83a\u0060 perf: Only Serialize Required Cols in Actor UDFs (#5884); \u006058d84400\u0060 feat: support label_selector specification in ray actor/task creation\u2026; \u00604f1f22f8\u0060 feat: Bind the name of the running UDF to the UDFActor (#5514) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/execution/ray_actor_pool_udf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"060c4e9a843a4eda3683a714b8e4b37540834d05b9c052e23cadc4c5e99580fc"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: datetime.py \u2194 temporal.rs: \u0060daft/functions/datetime.py\u0060 (context daft) and \u0060src/daft-sql/src/modules/temporal.rs\u0060 (context daft-sql) sit in DIFFERENT parts of the tree yet change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060823c32a0\u0060 feat(temporal): add Spark-style timezone conversions (#6919); \u0060f11f05d7\u0060 feat(temporal): add Spark-style temporal aliases (#6830); \u0060a20e88cc\u0060 feat(temporal): add Spark-style add_months and months_between (#6913) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/functions/datetime.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"855513e2fac5388703cd1aabfda86e658987f7c7389309fb0428a18162bf4669"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: data_array.rs \u2194 lib.rs: \u0060src/daft-core/src/series/array_impl/data_array.rs\u0060 (context daft-core) and \u0060src/daft-recordbatch/src/lib.rs\u0060 (context daft-recordbatch) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00604123b509\u0060 refactor(arrow2): move the auto conversion logic into array init (#6289); \u0060c0c4efa6\u0060 refactor(arrow2): fully remove toarrow2 from arrays \u0026 series (#6265); \u0060e5ff39fa\u0060 feat(table): implement list_unique and Set aggregation (#3710) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/series/array_impl/data_array.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb417095ae234d22af2ffe8d0a598db82e5c62276a82196e7035a96aee3a4c75"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: __init__.py \u2194 lib.rs: \u0060daft/io/__init__.py\u0060 (context daft) and \u0060src/common/io-config/src/lib.rs\u0060 (context common) sit in DIFFERENT parts of the tree yet change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u0060ffe0024a\u0060 feat: Add Tencent Cloud COS (Cloud Object Storage) support (#6140); \u006015b1d63d\u0060 feat: Add Apache Gravitino virtual file system (gvfs://) read support\u2026; \u0060c6e9a80c\u0060 feat: add tos object source (#5372) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d1a77e30ba16de9ffee40a080908197808a02fcce6b6e3a8b9be0454b507e66"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: series.py \u2194 time.rs: \u0060daft/series.py\u0060 (context daft) and \u0060src/daft-core/src/array/ops/time.rs\u0060 (context daft-core) sit in DIFFERENT parts of the tree yet change together 58% of the time (11 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060349d16cf\u0060 feat: convert and replace timezone (#6106); \u0060550072e8\u0060 feat: temporal functions \u0060quarter\u0060, \u0060unix_date\u0060, \u0060unix_micros\u0060, \u0060unix\u2026; \u0060398d79c3\u0060 feat: day_of_month and week_of_year (#4284) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/series.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba2e4d6fa9cf6dfc43ea8777f19b0b707dfe1126edb6fb89fae2efc367dfc94"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: project.rs \u2194 aggs.rs: \u0060src/daft-logical-plan/src/ops/project.rs\u0060 (context daft-logical-plan) and \u0060src/daft-sql/src/modules/aggs.rs\u0060 (context daft-sql) sit in DIFFERENT parts of the tree yet change together 57% of the time (12 of the 21 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u0060ac54bc7c\u0060 feat: add Python UDAF support (@daft.udaf) (#6790); \u0060150ef6a0\u0060 feat: introduce AggFn trait and two-stage UDAF aggregation pipeline (\u2026; \u00609ee52ec0\u0060 feat: percentile and median ops (#6153) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2ac80a1cb28a879e9164422a95470316791729cbcf4bd122a0b9d143fd9a8c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: series.py \u2194 mod.rs: \u0060daft/series.py\u0060 (context daft) and \u0060src/daft-core/src/array/ops/mod.rs\u0060 (context daft-core) sit in DIFFERENT parts of the tree yet change together 52% of the time (38 of the 73 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 38 shared commits counted here, the most recent 3 are \u00609411ce86\u0060 feat!: add ddof parameter to stddev (default ddof=1) (#6142); \u00601c97c27f\u0060 feat: Add pow expression (#5237); \u0060d9464813\u0060 feat: Support product (#5515) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/series.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc8857ee04988810a4365c80b3981ea1fcd02eeed928f781bbc0ca7136733d9c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: micropartition.rs \u2194 file_format_config.rs: \u0060src/daft-micropartition/src/micropartition.rs\u0060 (context daft-micropartition) and \u0060src/daft-scan/src/file_format_config.rs\u0060 (context daft-scan) sit in DIFFERENT parts of the tree yet change together 50% of the time (13 of the 26 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060c8b340a8\u0060 feat(iceberg): read data files without field IDs via schema.name-mapp\u2026; \u00601c1f04ce\u0060 chore: optimize operator naming (#5204) (at that commit the file was still \u0060src/common/file-formats/src/file_format_config.rs\u0060); \u0060fb89b2a5\u0060 feat: Add WARC reader (#3871) (at that commit the file was still \u0060src/common/file-formats/src/file_format_config.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/micropartition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ea2e3199c27b0a4289a89597d446b63296c70c51d50bb3d27fa8e0f42f513c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: flotilla.py \u2194 worker_manager.rs: \u0060daft/runners/flotilla.py\u0060 (context daft) and \u0060src/daft-distributed/src/python/ray/worker_manager.rs\u0060 (context daft-distributed) sit in DIFFERENT parts of the tree yet 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 \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 8 shared commits counted here, the most recent 3 are \u0060ef95e67d\u0060 feat(distributed): add bisect autoscaling strategy for faster cluster\u2026; \u006069fe81e7\u0060 feat(ray): Implement dynamic scale-in for RaySwordfishActor (#5903); \u0060766f0f81\u0060 fix(ray): configure worker startup timeout on runner (#7055) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/runners/flotilla.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"902af14158bbd672df0b24ced06b379e88e065db16a73dc415c10b245c757c38"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: pipeline.rs \u2194 window.rs: \u0060src/daft-local-execution/src/pipeline.rs\u0060 (context daft-local-execution) and \u0060src/daft-recordbatch/src/ops/window.rs\u0060 (context daft-recordbatch) 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 \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 \u00600343b43f\u0060 feat: first_value / last_value aggs for window functions (#6974); \u0060885afa35\u0060 feat(window): order by-only ranking (#4336); \u0060657f19bf\u0060 feat(window): order by with no partition by row number impl (#4324) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c12e1e5455c5b506902e870435f6081e84d631cd4c5b90d76facd67e4adb45c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: plan.rs \u2194 window.rs: \u0060src/daft-local-plan/src/plan.rs\u0060 (context daft-local-plan) and \u0060src/daft-recordbatch/src/ops/window.rs\u0060 (context daft-recordbatch) 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 \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 \u00600343b43f\u0060 feat: first_value / last_value aggs for window functions (#6974); \u0060885afa35\u0060 feat(window): order by-only ranking (#4336); \u0060657f19bf\u0060 feat(window): order by with no partition by row number impl (#4324) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/plan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a445b06c6daa2d256dd86a5d8ca11fbb3f31e134adffc86fb9b98fd72c853da5"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: translate.rs \u2194 window.rs: \u0060src/daft-local-plan/src/translate.rs\u0060 (context daft-local-plan) and \u0060src/daft-recordbatch/src/ops/window.rs\u0060 (context daft-recordbatch) 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 \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 \u00600343b43f\u0060 feat: first_value / last_value aggs for window functions (#6974); \u0060885afa35\u0060 feat(window): order by-only ranking (#4336); \u0060657f19bf\u0060 feat(window): order by with no partition by row number impl (#4324) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-plan/src/translate.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"013893e80f35de182367900df5b206ae17e8ebfb0687b7355e5d27673a93b6f3"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: native_runner.py \u2194 engine.rs: \u0060daft/runners/native_runner.py\u0060 (context daft) and \u0060src/daft-dashboard/src/engine.rs\u0060 (context daft-dashboard) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060f7d061a6\u0060 feat(dashboard): subscriber heartbeat and dead query detection (#6676); \u006061b0d529\u0060 feat(dashboard): display version metadata on query detail page (#6671); \u0060d448058c\u0060 feat: Use JSON Serialization for Plans in Subscribers (#5709) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/runners/native_runner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"04fd142a70528f2bc23758fe7aa6180a29fc9b1a029fe408130ea09d1cffebd1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: pipeline.rs \u2194 json.rs: \u0060src/daft-local-execution/src/pipeline.rs\u0060 (context daft-local-execution) and \u0060src/daft-logical-plan/src/display/json.rs\u0060 (context daft-logical-plan) sit in DIFFERENT parts of the tree yet change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u006064cd1a69\u0060 feat: add forward ASOF joins (#6918); \u0060040c09fd\u0060 feat: Point-in-Time / ASOF Joins (#6615); \u006021afa098\u0060 feat: \u0060index_col\u0060 option in \u0060explode\u0060 (#5842) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/pipeline.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dccdade03bbff5f10c0d9b7ff285e01486492b6ec150cee51bcd0ff298f35cbd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: batch.rs \u2194 row_wise.rs: \u0060src/daft-dsl/src/python_udf/batch.rs\u0060 and \u0060src/daft-dsl/src/python_udf/row_wise.rs\u0060 change together 100% of the time (10 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u00608284af4f\u0060 feat(udf): support ray_options and resource overrides in UDF v2 (#5982); \u00604400e697\u0060 fix: Clean up UDF display name in progress bar and plans (#5810); \u0060b3e8263b\u0060 fix: Supporting fractional gpu count on class udf (#5840) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python_udf/batch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d45d7f3851b921d8924c814c04f8624dc6a10893d726a46d92e98b14fe1a18"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: drop_repartition.rs \u2192 mod.rs, push_down_filter.rs, push_down_limit.rs, push_down_projection.rs: \u0060src/daft-logical-plan/src/optimization/rules/drop_repartition.rs\u0060 changes together with 4 other files \u2014 \u0060src/daft-logical-plan/src/builder/mod.rs\u0060, \u0060src/daft-logical-plan/src/optimization/rules/push_down_filter.rs\u0060, \u0060src/daft-logical-plan/src/optimization/rules/push_down_limit.rs\u0060, \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/drop_repartition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"797f9590739b36486e944c6182d6b2de3f23e9b140a04f6316ffc2a57b1d210c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: source.rs \u2192 filter.rs, intermediate_op.rs, blocking_sink.rs, base.rs: \u0060src/daft-local-execution/src/sources/source.rs\u0060 changes together with 4 other files \u2014 \u0060src/daft-local-execution/src/intermediate_ops/filter.rs\u0060, \u0060src/daft-local-execution/src/intermediate_ops/intermediate_op.rs\u0060, \u0060src/daft-local-execution/src/sinks/blocking_sink.rs\u0060, \u0060src/daft-local-execution/src/streaming_sink/base.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sources/source.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e28261ba777710acb87250c5020079cc51db96057bc79aea1bb39a4479e514"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: file_path.py \u2194 ray_runner.py: \u0060daft/io/file_path.py\u0060 and \u0060daft/runners/ray_runner.py\u0060 change together 85% of the time (11 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 11 shared commits counted here, the most recent 3 are \u0060e9214cc8\u0060 feat: support glob multiple path (#4811); \u006079de420a\u0060 perf: Don\u0027t concat in \u0060micropartition.to_arrow()\u0060 (#4192); \u0060e37c6d3a\u0060 [CHORE]: remove daft-table dependency from daft-logical-plan (#3265) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/file_path.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a568e7d12b24fec6d3e9aa00ff20be2ca95415ad299ca0fbcd43b93858dc0db"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dataframe.py \u2194 map_partition_ops.py: \u0060daft/dataframe/dataframe.py\u0060 and \u0060daft/logical/map_partition_ops.py\u0060 change together 82% of the time (9 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 \u006021afa098\u0060 feat: \u0060index_col\u0060 option in \u0060explode\u0060 (#5842); \u0060d03b2671\u0060 [RUST] Explode List types (#824); \u006004ab5838\u0060 expressions -\u003E expressions2 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/dataframe/dataframe.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab5461fc4ad9d16bde1bd2b8a38531629acc4e6e99f30c5ded9827408e6f17f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: in_memory.rs \u2194 scan_task.rs: \u0060src/daft-local-execution/src/sources/in_memory.rs\u0060 and \u0060src/daft-local-execution/src/sources/scan_task.rs\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060b1ea3b97\u0060 [CHORE] Enable sources to return empty tables (#2915); \u006039cd0ad5\u0060 [CHORE] Add error snafus for local executor (#2660); \u0060b15b0c7f\u0060 [FEAT] Example Analyze for Local Execution Engine (#2648) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/sources/in_memory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31746f13414cfafbe3359bb6346cb9f58bb6f74bbd230b3523f9afa32c87603a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 mod.rs: \u0060src/daft-core/src/array/ops/mod.rs\u0060 and \u0060src/daft-core/src/series/ops/mod.rs\u0060 change together 74% of the time (40 of the 54 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 40 shared commits counted here, the most recent 3 are \u00603de673fa\u0060 feat(distributed): enable two-stage HLL aggregation for approx_count_\u2026; \u00601c97c27f\u0060 feat: Add pow expression (#5237); \u00605549d16b\u0060 feat: add binary string operations (length and concatenation) (#3646) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"549f3b84ddd26ad27dc92b0a61896f9c47c4a92c2cac23fe2965b8b45ccdc841"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: run.rs \u2192 intermediate_op.rs, blocking_sink.rs, in_memory.rs, source.rs, base.rs: \u0060src/daft-local-execution/src/run.rs\u0060 changes together with 5 other files \u2014 \u0060src/daft-local-execution/src/intermediate_ops/intermediate_op.rs\u0060, \u0060src/daft-local-execution/src/sinks/blocking_sink.rs\u0060, \u0060src/daft-local-execution/src/sources/in_memory.rs\u0060, \u0060src/daft-local-execution/src/sources/source.rs\u0060, \u0060src/daft-local-execution/src/streaming_sink/base.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03276b732f8188f20b14fcfbb52cd99d1e5d8015e5863acbb2ee8b137ca6026"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: anonymous.rs \u2194 glob.rs: \u0060src/daft-scan/src/anonymous.rs\u0060 and \u0060src/daft-scan/src/glob.rs\u0060 change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060e1c3fafa\u0060 [FEAT]: expr simplifier (#3393); \u0060c694c9ef\u0060 [FEAT] Include file paths as column from read_parquet/csv/json (#2953); \u0060c24635e7\u0060 [FEAT] Support Reading Iceberg Merge-on-Read Position Deletes (#2563) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-scan/src/anonymous.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c260c784fccf18b737d85b69660da0c19873ef94c828b78f21deb509c9555242"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: push_down_limit.rs \u2192 push_down_filter.rs, push_down_projection.rs, unnest_subquery.rs: \u0060src/daft-logical-plan/src/optimization/rules/push_down_limit.rs\u0060 changes together with 3 other files \u2014 \u0060src/daft-logical-plan/src/optimization/rules/push_down_filter.rs\u0060, \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs\u0060, \u0060src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_limit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"755a7b02b6d1e0e84461e0e8980a2f297f2fb949b786421ce803753aea959228"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: worker_manager.rs \u2194 default.rs: \u0060src/daft-distributed/src/python/ray/worker_manager.rs\u0060 and \u0060src/daft-distributed/src/scheduling/scheduler/default.rs\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 \u00604c526927\u0060 fix: incrementally ramp up Ray autoscaler resource requests to avoid \u2026; \u0060dc90bb16\u0060 fix: Propagate worker failures to scheduler (#4800); \u00608929963a\u0060 feat(flotilla): Non-actor UDFs with gpu requirements (#4731) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0803377d58074e91ae9b2dd675a7642b1d4bfaf63d570d7ddc983540799a9407"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: download.rs \u2194 upload.rs: \u0060src/daft-functions-uri/src/download.rs\u0060 and \u0060src/daft-functions-uri/src/upload.rs\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) 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 8 shared commits counted here, the most recent 3 are \u0060444d129c\u0060 refactor(arrow2): remove deprecated methods from daft-functions-uri c\u2026; \u0060db44f0b4\u0060 chore: Don\u0027t log failures in url download if \u0060on_error=\u0022null\u0022\u0060 (#5231); \u0060f29dd714\u0060 chore: rename block_on method to convey intent (#4474) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-uri/src/download.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc007c83eb0d4182c02a7e5d10bcf6ca9c403665e0006f333b06349f0e22b2a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: native_runner.py \u2194 ray_runner.py: \u0060daft/runners/native_runner.py\u0060 and \u0060daft/runners/ray_runner.py\u0060 change together 64% of the time (9 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060211047f9\u0060 feat(cli): show query id in CLI output (#6755); \u0060f7d061a6\u0060 feat(dashboard): subscriber heartbeat and dead query detection (#6676); \u006061b0d529\u0060 feat(dashboard): display version metadata on query detail page (#6671) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/runners/native_runner.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5242b56825d55d58e73d30b07ff09f3f156871058c173eece58c03b89e6929ea"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: utf8.rs \u2194 series.rs: \u0060src/daft-core/src/array/ops/utf8.rs\u0060 and \u0060src/daft-core/src/python/series.rs\u0060 change together 61% of the time (25 of the 41 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 25 shared commits counted here, the most recent 3 are \u00606fe408c5\u0060 [FEAT] Adds str.length_bytes() function (#2775); \u00608544b763\u0060 [FEAT] Add \u0060.str.count_matches()\u0060 (#2580); \u006029b02a14\u0060 [FEAT] String normalize expression (#2450) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/utf8.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f51b995f7144e3511997ef14aca367332f7de75b35d45776e2b7b80ab1c0da"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 dispatcher.rs: \u0060src/daft-distributed/src/plan/mod.rs\u0060 and \u0060src/daft-distributed/src/scheduling/dispatcher.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 6 shared commits counted here, the most recent 3 are \u0060b853f269\u0060 refactor(daft-distributed): cleanup of statistics_manager (#6718); \u006086ede0a1\u0060 fix(flotilla): Change MaterializedOutput to return a Vec\u003CPartitions\u003E \u2026; \u0060a7b81b67\u0060 chore: add additional context to the runtime stats events (#4520) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/plan/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"210cf195b20ed632f399c77278b79dc64e20312aa38b8349828c474e8fcaa555"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: push_down_filter.rs \u2194 unnest_subquery.rs: \u0060src/daft-logical-plan/src/optimization/rules/push_down_filter.rs\u0060 and \u0060src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060040c09fd\u0060 feat: Point-in-Time / ASOF Joins (#6615); \u0060075f4342\u0060 chore: Replace RepartitionSpec::IntoPartitions with custom path (#6349); \u006023508c49\u0060 feat: implement into_batches on the swordfish native daft runner (#4935) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7980b7cea1344650fa119f8ffab5d3bec2cad780d984f7257dbaa3e557481899"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: push_down_projection.rs \u2194 unnest_subquery.rs: \u0060src/daft-logical-plan/src/optimization/rules/push_down_projection.rs\u0060 and \u0060src/daft-logical-plan/src/optimization/rules/unnest_subquery.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060040c09fd\u0060 feat: Point-in-Time / ASOF Joins (#6615); \u0060075f4342\u0060 chore: Replace RepartitionSpec::IntoPartitions with custom path (#6349); \u006023508c49\u0060 feat: implement into_batches on the swordfish native daft runner (#4935) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/optimization/rules/push_down_projection.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"303a1f4651388a6dd2feff65710765e7f75efa96ca6a635f211b60ac73aa0a90"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: filter.rs \u2194 write.rs: \u0060src/daft-local-execution/src/intermediate_ops/filter.rs\u0060 and \u0060src/daft-local-execution/src/sinks/write.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 6 shared commits counted here, the most recent 3 are \u00608b7e5566\u0060 feat(stats): Add num_tasks metric tracking across all runtime stats (\u2026; \u00600e952010\u0060 feat(observability): track per-operator bytes_in / bytes_out (#6612); \u00602b8cb910\u0060 feat: Support additional \u0060OTEL_*\u0060 configuration envs (#6148) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/filter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"386e2f3ccbd7a18407818ff6531d0ec1f4016538f0e153f2a1df060aec1302c0"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: intermediate_op.rs \u2194 in_memory.rs: \u0060src/daft-local-execution/src/intermediate_ops/intermediate_op.rs\u0060 and \u0060src/daft-local-execution/src/sources/in_memory.rs\u0060 change together 60% of the time (6 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 6 shared commits counted here, the most recent 3 are \u006039cd0ad5\u0060 [CHORE] Add error snafus for local executor (#2660); \u0060b15b0c7f\u0060 [FEAT] Example Analyze for Local Execution Engine (#2648); \u0060702ac737\u0060 [PERF] Swordfish Dynamic Pipelines (#2599) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-local-execution/src/intermediate_ops/intermediate_op.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1ccf9a5084ce6c57332451abbfebd1dda834ebeefedd8956cb96d0cf76dc57"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: materialize.rs \u2192 limit.rs, mod.rs, dispatcher.rs: \u0060src/daft-distributed/src/pipeline_node/materialize.rs\u0060 changes together with 3 other files \u2014 \u0060src/daft-distributed/src/pipeline_node/limit.rs\u0060, \u0060src/daft-distributed/src/python/mod.rs\u0060, \u0060src/daft-distributed/src/scheduling/dispatcher.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/materialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"643b88434551444e5ca557f4ae259e66a04a78a50cb2342f8d4fd60562914735"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: worker_manager.rs \u2194 scheduler_actor.rs: \u0060src/daft-distributed/src/python/ray/worker_manager.rs\u0060 and \u0060src/daft-distributed/src/scheduling/scheduler/scheduler_actor.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 \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 \u006069fe81e7\u0060 feat(ray): Implement dynamic scale-in for RaySwordfishActor (#5903); \u0060d7561632\u0060 fix(scheduler): include dispatched tasks in autoscaling ratio (#6388); \u00608929963a\u0060 feat(flotilla): Non-actor UDFs with gpu requirements (#4731) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8efde638834cba32bc9a94ab3d1ca602bc70bca6d5e7a3e30fe077fa316e1d2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: project.rs \u2194 partitioning.rs: \u0060src/daft-logical-plan/src/ops/project.rs\u0060 and \u0060src/daft-logical-plan/src/partitioning.rs\u0060 change together 55% of the time (12 of the 22 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 12 shared commits counted here, the most recent 3 are \u0060486f6c63\u0060 fix: short-circuit evaluation for coalesce (#6525); \u0060c113e359\u0060 feat: batch UDF with \[e-mail redacted]\u0060 (#5362); \u0060cd6ebd56\u0060 feat: add \u0060use_process\u0060 flag for \[e-mail redacted](...)\u0060  (#5323) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-logical-plan/src/ops/project.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85d3e82cffd6d30445273a2305364995da1e4039c289a65e9d083a6a4640591"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: repartition.rs \u2194 translate.rs: \u0060src/daft-distributed/src/pipeline_node/shuffles/repartition.rs\u0060 and \u0060src/daft-distributed/src/pipeline_node/translate.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 6 shared commits counted here, the most recent 3 are \u006075d5a2c8\u0060 refactor(flight): implement into_partitions for flight shuffle (#6764); \u006012301c7a\u0060 feat: implement distributed sort in flotilla engine (#4991); \u00604dd0d98d\u0060 feat: Flotilla pre-shuffle merge (#4873) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/shuffles/repartition.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10beeb7bb3d166c42cf4e90355ed0b1c92108a5d7cdb1f051e46b68904a18b52"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: time.rs \u2194 series.rs: \u0060src/daft-core/src/array/ops/time.rs\u0060 and \u0060src/daft-core/src/python/series.rs\u0060 change together 53% of the time (10 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 \u0060550072e8\u0060 feat: temporal functions \u0060quarter\u0060, \u0060unix_date\u0060, \u0060unix_micros\u0060, \u0060unix\u2026; \u0060398d79c3\u0060 feat: day_of_month and week_of_year (#4284); \u0060923ff62b\u0060 feat: add \u0060strftime\u0060 (#4146) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/array/ops/time.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c0ba8c555522a746e28912c7e1569ff7f1059c306c986ee291ecfe29f027e3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: limit.rs \u2194 scan_source.rs: \u0060src/daft-distributed/src/pipeline_node/limit.rs\u0060 and \u0060src/daft-distributed/src/pipeline_node/scan_source.rs\u0060 change together 50% of the time (9 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u00608b7e5566\u0060 feat(stats): Add num_tasks metric tracking across all runtime stats (\u2026; \u00600e952010\u0060 feat(observability): track per-operator bytes_in / bytes_out (#6612); \u0060b39f79a7\u0060 refactor: remove EmptyScan plan node (#6275) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/limit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74820ab27ca0fa81dbf891a6d41976948cc71b5d68398c178edf193a07e8ce58"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: __iceberg.py \u2194 session.py: \u0060daft/catalog/__iceberg.py\u0060 and \u0060daft/session.py\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 \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 \u0060a9ddee33\u0060 fix: Re-enable mypy (#4160); \u0060ad0862b0\u0060 feat: adds has_table and has_namespace catalog methods (#4088); \u00604abe1262\u0060 fix: surface non \u0027NotFound\u0027 errors during table resolution (#4073) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__iceberg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f9c0f520aa2c099abfe36203ed9f254197e86cd524990a6bad731cf8817fa3"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: page.tsx \u2194 engine.rs: \u0060src/daft-dashboard/frontend/src/app/query/page.tsx\u0060 and \u0060src/daft-dashboard/src/engine.rs\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060f7d061a6\u0060 feat(dashboard): subscriber heartbeat and dead query detection (#6676); \u006061b0d529\u0060 feat(dashboard): display version metadata on query detail page (#6671); \u0060d448058c\u0060 feat: Use JSON Serialization for Plans in Subscribers (#5709) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/page.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"719bfab120c591a4761e91a52beb9cbd66a0576c497b8ff6624899f869e4b769"}},{"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":"D40","level":"note","message":{"text":"No network policy: No Kubernetes NetworkPolicy (or Cilium policy) found. Without one, every pod can talk to every other pod and reach out to the internet by default. Add a default-deny policy and open only the flows you need."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"295828650a2aaa1b03ae9b32ae6843a0c38011e5a70b1926442c4fa7187de5f0"}},{"ruleId":"AC3","level":"error","message":{"text":"Document without a \u003Ctitle\u003E: A page with no \u003Ctitle\u003E gives no name in the tab, history or screen-reader page list. Declare it the way this router does \u2014 Next App Router \u0060export const metadata = { title }\u0060, React Router/Remix \u0060export function meta\u0060, TanStack Start \u0060head\u0060, or a Helmet/Head component."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/layout.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4ef14f0cbffe7984ff9bb39eb8a39350604cdb41804c5224aabeb34d71adc4"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f50c8c2a23d3ff21222fc71369c8893da480142c7a271ffe89bd3e2b984a3e2"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/plan-visualizer.tsx"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64c6cb376003406fe651015ccdcd7c1042f732f039d8b0efb5f7c8feef71c73"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9adb50fe8b314b72fc8fa19b9af7e74f9a7b603cc96b9715f2ab29ad6dcb851"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e573a2552164de8ef1fda2b37be6fb7b1fe4a21e85f896eb66c9e0a0d32678"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"119705cf155ff5c66106b75d4163459994843b6373d785dbd098c28c826a1c1d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cdiv\u003E moves \u2014 its \u0060animate-spin\u0060 utility runs with no motion-safe:/motion-reduce: variant \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/stats-utils.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14139df662113ca5878d8833782a42d95de0a2861217145c1c22467278baa18"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.fish-container\u0060 moves (\u0060animation: up-down 1s alternate ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/globals.css"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb907092f4e675f5423612de57e86961bdbd0d5d9eb935cb216f099d28b4642f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.fish-swim\u0060 moves (\u0060animation: rotate 2s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/globals.css"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddfa48b2df81653e86ddd3f3cb4fb266dfa677301739349de17f3ef16906ea6"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: content-security-policy: The live app\u0027s responses did not include content-security-policy (restricts the sources a page may load \u2014 mitigates XSS/injection). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b142e47096a32517bde0bb9b78f7e564119c7f87e22fba4dccc0d1e3645d74c5"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-embedder-policy: The live app\u0027s responses did not include cross-origin-embedder-policy (recommended by the OWASP Secure Headers Project (value: require-corp)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"153214bb9c80f7d66cba8eb6a7715e9609e84c3979c9b641cd6bedaa8be6930b"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-opener-policy: The live app\u0027s responses did not include cross-origin-opener-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8cdbe5cdec6a55c732bf9a9975c0e40f81ddfa4ad583a4a50bfb0895531607f7"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: cross-origin-resource-policy: The live app\u0027s responses did not include cross-origin-resource-policy (recommended by the OWASP Secure Headers Project (value: same-origin)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3ba35c34991db9965777a53477c2d497c4c6606f78d133bbaa3bc99c71648c2a"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: permissions-policy: The live app\u0027s responses did not include permissions-policy (restricts powerful browser features (camera, geolocation, \u2026)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac8a111f0bb913829dc090833718dca5ab8e5fba7350f9dcf68f1971010745"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: referrer-policy: The live app\u0027s responses did not include referrer-policy (limits referrer leakage to third parties). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"364ee3f006b552b8fee33710a1fbfb0c4fac59e927af9c4396e51940d9069f01"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: strict-transport-security: The live app\u0027s responses did not include strict-transport-security (forces HTTPS on subsequent requests \u2014 mitigates downgrade/MITM). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"567d3eeb50a5678c0139a1d316c614c44cd4c4fb5db6fffa7795bc73d035966f"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-dns-prefetch-control: The live app\u0027s responses did not include x-dns-prefetch-control (recommended by the OWASP Secure Headers Project (value: off)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"50e54b8511264dd930857e4620bda8ba4053661b439218ed047812bcab0e3a44"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-frame-options: The live app\u0027s responses did not include x-frame-options (blocks clickjacking via framing (or use CSP frame-ancestors)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0e84499d19780ca121fad65e0f3bd2fc17b1268ce3079a5f40495749c54dc87e"}},{"ruleId":"AXH1","level":"warning","message":{"text":"Runtime security header not set: x-permitted-cross-domain-policies: The live app\u0027s responses did not include x-permitted-cross-domain-policies (recommended by the OWASP Secure Headers Project (value: none)). Observed by booting the app in-sandbox \u2014 advisory evidence for AppSec / CRA / NIS2 runtime secure-defaults. Set it at your reverse proxy or in the app."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"55366a3d9fb1c5952ebc54aab272eb775bf2c1b056d6d399652365c26cc2375b"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 1.1.1 reproducibly failed in a rendered surface: axe-core rule(s) image-alt failed on: img[height=\u002230\u0022]. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"28f4c45779a4309ff85f9c42c060990e7e52dbdb9dbe524270a65cd1efe1ff6f"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 1.4.3 reproducibly failed in a rendered surface: axe-core rule(s) color-contrast failed on: #mantine-jga0j14nw-title, #rc-tabs-0-tab-searchForm, .ant-form-item.css-#:nth-child(1) \u003E .ant-form-item-row.ant-row.css-# \u003E .ant-form-item-label.ant-col.css-# \u003E label[title=\u0022\u0022] \u003E span \u003E .SearchForm--labelCount, .ant-form-item.css-#:nth-child(2) \u003E .ant-form-item-row.ant-row.css-# \u003E .ant-form-item-label.ant-col.css-# \u003E label[title=\u0022\u0022] \u003E span \u003E .SearchForm--labelCount, .cm-placeholder. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f3ac60a8f513543e3616e3310eadd04e48faee367c92309e284504e755a9ea60"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 2.4.2 reproducibly failed in a rendered surface: axe-core rule(s) document-title failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a152f745c16f064aeb9932e5d52584f548c37c248ac45bacf96a1a6ffc2e49e7"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 3.1.1 reproducibly failed in a rendered surface: axe-core rule(s) html-has-lang, html-lang-valid failed on: html. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2d0e1d2bf07ce04d82230fe7847e003479b78cd188efe60cc79686fb8ba8420"}},{"ruleId":"AXR1","level":"warning","message":{"text":"WCAG 4.1.2 reproducibly failed in a rendered surface: axe-core rule(s) aria-allowed-attr, aria-command-name, aria-conditional-attr, aria-deprecated-role, aria-hidden-body, aria-hidden-focus, aria-input-field-name, aria-prohibited-attr, aria-required-attr, aria-roles, aria-valid-attr, aria-valid-attr-value, button-name, duplicate-id-aria, label, link-name, nested-interactive failed on: #rc_select_0, #rc_select_1, #rc_select_2, .cm-content. Runtime evidence (advisory \u2014 not scored); fix and re-scan to verify it clears."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"15d5940c2ae6c28b9de7cec0020386357c95edc55924e278c858fab1d6499d47"}},{"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: 1 public type in \u0060common_metrics.snapshot\u0060 is marked as implementation by its own namespace, folder or name: \u0060StatSnapshotImpl\u0060 (src/common/metrics/src/snapshot.rs:26, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common/metrics/src/snapshot.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98d23b304b40d97e5c99af59cef2c6be7ecca23baccb93a58ac0c53463dde8d"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060daft_checkpoint.impls.s3\u0060 is marked as implementation by its own namespace, folder or name: \u0060S3CheckpointStore\u0060 (src/daft-checkpoint/src/impls/s3.rs:110, \u0060impls\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-checkpoint/src/impls/s3.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b917f89493a31ddde7c8a9b5759a4fded50d961cbd512a40ad2ae4c07422b4"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 1 public type in \u0060daft_core.datatypes.logical\u0060 is marked as implementation by its own namespace, folder or name: \u0060LogicalArrayImpl\u0060 (src/daft-core/src/datatypes/logical.rs:19, name ends in \u0060Impl\u0060). While it is public, every consumer of the library can bind to it, so changing it is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-core/src/datatypes/logical.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"45648db019db5c4294f15e9e7bc78cadd3fe7cc70dc7931f93555ce370d0259f"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 24/26 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060src/daft-dashboard/frontend\u0060, \u0060src/daft-shuffles\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add cargo-audit / cargo-deny (or clippy) (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 14 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/build-docs.yml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch npm/uv: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060npm\u0060, \u0060uv\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"9815db4f3f6c05533e8c3a5ad9a41500a5649db4c006fbc8834553bb4735b2c8"}},{"ruleId":"P5","level":"warning","message":{"text":"No DR/backup evidence: A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced \u2014 a volume that survives a container recreate is not a tested restore from catastrophic loss."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5daabb38c90b07af65b8738cf94ce884e90a7d8fef810d341de5c186188c8fe0"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060requests.Session(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/catalog/__gravitino/_client.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dd010245669c96c5056afd0db86f97cc384bd881a9d2731d1b79b8dcb137c5"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060urlopen(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a094921a64fe25ed1ceed77aae884ed9735e3b8cc2cf4af7db61cf3a934bc5ef"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx:74 \u00B7 src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx:138 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86e772bcbc16fb440b6af18582daeebc1bd7cb5b34882ebae9dca1668448679"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/components/ui/BookOpenTextIcon.tsx:107 \u00B7 src/daft-dashboard/frontend/src/components/ui/BookOpenTextIcon.tsx:131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/BookOpenTextIcon.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db36955bafc3602b1b4dae1c26fcd4437443cdf18f7fedf77e455846699cc5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (19 matched lines \u00D7 2 locations): src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx:349 \u00B7 src/daft-dashboard/frontend/src/app/query/plan-visualizer.tsx:123 \u2014 the two spans are one implementation copied and then locally edited \u2014 98 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":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dfb9062ddec8dd41bc827d3200d3ee9a32fadbb11912b5f274f666258936a9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/app/queries/status.tsx:73 \u00B7 src/daft-dashboard/frontend/src/app/queries/status.tsx:106 \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":"src/daft-dashboard/frontend/src/app/queries/status.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"62208151e3af2084c6e4db5a2e71ea009acbf395b1aa8d0b419533f5d360c9c9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx:505 \u00B7 src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx:599 \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":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e737e88ac74d0f30c1aeec6b7dec99df4060861a9629ff231e3628d3dc20ccf9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx:260 \u00B7 src/daft-dashboard/frontend/src/app/query/plan-visualizer.tsx:74 \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":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfc6f8b97884882695008892ffda8de9456b59cab5edad9ad9430d5047be21c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/components/server-provider.tsx:78 \u00B7 src/daft-dashboard/frontend/src/components/server-provider.tsx:96 \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":"src/daft-dashboard/frontend/src/components/server-provider.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f360872d0839e363f0fb88564c4316c66d9f1ec8b4ae722e59ea04da19c3faea"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3 locations): src/daft-dashboard/frontend/src/components/ui/card.tsx:5 \u00B7 src/daft-dashboard/frontend/src/components/ui/card.tsx:31 \u00B7 src/daft-dashboard/frontend/src/components/ui/card.tsx:51 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/card.tsx"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9b632f8170e223ecd69192569f6b2fad174f34fbae46789a344bde6bff779e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx:107 \u00B7 src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx:130 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b468f5c0ac1b48560860e642654fa292f528fadc05f7b3850e96ffc9734bfef9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx:388 \u00B7 src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx:834 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c2ea7c52477fd93614df29ce32a848a0dd9988e62ea96220859d21aabdde4a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 6 locations): src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx:50 \u00B7 src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx:88 \u00B7 src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx:152 \u00B7 src/daft-dashboard/frontend/src/components/ui/sheet.tsx:111 \u00B7 \u002B2 more site(s) not listed \u2014 the 6 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":"src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fe2c9b464b8847e1db3154a2b2a1e72d09c32b4d799998d3b5eb0c0804ec00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx:59 \u00B7 src/daft-dashboard/frontend/src/components/ui/tooltip.tsx:14 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/dropdown-menu.tsx"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3e144d5a3426694d7f09b125754b76dbc59ae3651fd24f360ae7cf03b89528"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx:101 \u00B7 src/daft-dashboard/frontend/src/app/query/progress-table.tsx:22 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f6e9903207ed36a72d8ab5a8eb863537449e95b830c6cff52cbb2a007f2157b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx:301 \u00B7 src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx:438 \u00B7 src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx:749 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd63ea6b17d58275e1bab0e510fd8f247213e3c5832f7030015e5eae0109499"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/daft-dashboard/frontend/src/app/query/status.tsx:10 \u00B7 src/daft-dashboard/frontend/src/app/query/status.tsx:24 \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":"src/daft-dashboard/frontend/src/app/query/status.tsx"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"a020ea3ff0f6fa66c40d1e4aca1e8efc4310c41e53d8a9c64f6d68a2f05358b7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function QueryPageInner (cyclomatic 38, cognitive 31): QueryPageInner has cyclomatic complexity 38 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 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":"src/daft-dashboard/frontend/src/app/query/page.tsx"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1b167c6dfc8be1a7082c5fb4b0ff10f24d76fc13a6b95a6725c9349ada60f8"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PhysicalNodeCard (cyclomatic 25, cognitive 21): PhysicalNodeCard has cyclomatic complexity 25 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 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":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"5117660cc52c57ff5e8b578f9b74b2b70d56819a41cf7a644ae8d18e840cbedb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TasksSidebar (cyclomatic 21, cognitive 18): TasksSidebar has cyclomatic complexity 21 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"607b7cca65acdbdb90c8dc5251551154607c9c9849a5421e9bffecfb829ae136"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PhysicalPlanTree (cyclomatic 14, cognitive 13): PhysicalPlanTree 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":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b69d71e30fa9b5963d78e3a60a43d66373911e65f21c2d7eb68c3c7fcd6280"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function getEffectiveStatus (cyclomatic 13, cognitive 19): getEffectiveStatus 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":"src/daft-dashboard/frontend/src/app/query/stats-utils.tsx"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc302694cbbbecd4b2d2e9cfe0c35323595cd7d1ac67b72427ad3afe7a0bb0b6"}},{"ruleId":"R3","level":"warning","message":{"text":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx: 820 lines of code: src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx has 820 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":"src/daft-dashboard/frontend/src/app/query/tasks-sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d768a6a36f837f1dcda26576e5fc35ce70436aec9414b18aa692b48a0be16abe"}},{"ruleId":"R3","level":"warning","message":{"text":"src/daft-dashboard/frontend/src/components/ui/sidebar.tsx: 666 lines of code: src/daft-dashboard/frontend/src/components/ui/sidebar.tsx has 666 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":"src/daft-dashboard/frontend/src/components/ui/sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fa4cfd5fb7221ea62a12226e47b51f81ec0fb6419a56b0e3060228f772d25a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx: 417 lines of code: src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx has 417 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":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c59b0ba67353537b201e7a100ffd5c5009768a2fe69644bf40a3af3928b9b3e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~720 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/sidebar.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b6343460d2a34ab728142374207417ed3e1fee99d63eb475c9c772dda9c61d"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~140 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/daft-dashboard/frontend/src/components/ui/sidebar.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/sheet.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c723756603ea5e521f7c67d1012f3a2dbbc20cf0cac23a1450ae90df23dfe764"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~92 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a5c3a5df43a680378eef448a28ef28bb1d303a2e6bb8f869e07a68910fa877"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~70 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/note.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1547b26f22813fe410d7eef316da728e978bfea50581de0b3a4620c265563f51"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~45 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/resizable.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a788bb5a0262f13a8c42bd222b14a2ae203988d204eb6313635ed32a5150ff77"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/daft-dashboard/frontend/src/components/ui/sidebar.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/separator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8adca8605afa11a0545f82590d523b41321972055eea0978454203e936510f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~26 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/label.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d3c22ebe9a9e3f80515de2eb3dced8cd8b9f19e204001a6672b466f677800a"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/daft-dashboard/frontend/src/components/ui/sidebar.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/input.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6257d80ee8d0479908dd75c4d5a1dd6bf098b94a38697a00616d0eb51c7f2e"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/daft-dashboard/frontend/src/components/ui/sidebar.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/hooks/use-mobile.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87221c40b97ad22f304419952d4d4d97be0f97699e8c47350f948763eaf5afc1"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), but 1 in-repo import(s) from 1 other file(s) do name it (src/daft-dashboard/frontend/src/components/ui/sidebar.tsx) \u2014 every one of those referrers is itself unreachable, so this file is dead only as a member of that cluster: if any referrer is in fact alive, this row falls with it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/skeleton.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29788cb6aca46c7df96c395fb2ebcd5efa0b5a15ec3bc50e6befc5f222b4de4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~11 LoC): no import path from any entry point (4 application, 4 tooling, 0 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/components/ui/collapsible.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7585cc459f2cf8f3a9869ae51a02140b6b138feb4dc37b8dfcc0ed71490dc420"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getStatusBorderColor\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/stats-utils.tsx"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"33394805dbb0c8ad6e4820a95e04aedb0a9b3fb73f8a0af2fa3ffcba57a61ac6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027STATUS\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":"src/daft-dashboard/frontend/src/app/queries/page.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6526dbbc2b91f596cc23a1b56bb21c623e2b91bd5486f2ead0d04f4c42215990"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027react-icons\u0027: Declared in src/daft-dashboard/frontend/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":"a00be11a2c3b599ed9c22325b3fdc3b3c3e19d96ea2db6fd9976186c4d72eb9c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027zustand\u0027: Declared in src/daft-dashboard/frontend/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":"9219ced00d30ad16d41d33f7a80949c3442be4ffbba4daa141c714bc15c348d3"}},{"ruleId":"X1","level":"warning","message":{"text":"Task from \u0060self.loop.create_task\u0060 is not kept: The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python\u0027s documentation for \u0060asyncio.create_task\u0060: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled \u2014 it surfaces, if at all, as \u0022Task exception was never retrieved\u0022 in a log. Keep the task: \u0060await\u0060 it, gather it, start it in an \u0060asyncio.TaskGroup\u0060 (\u0060async with asyncio.TaskGroup() as tg: tg.create_task(\u2026)\u0060), or, for genuine fire-and-forget, add it to a set and \u0060task.add_done_callback(tasks.discard)\u0060 with a callback that also reads its exception."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/execution/vllm.py"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b835f1142d892f0cec2c53a078d7b9ae44db5e18a000fa80eaa20b3c8e4a8bbe"}},{"ruleId":"X1","level":"warning","message":{"text":"Task from \u0060asyncio.create_task\u0060 is not kept: The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python\u0027s documentation for \u0060asyncio.create_task\u0060: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled \u2014 it surfaces, if at all, as \u0022Task exception was never retrieved\u0022 in a log. Keep the task: \u0060await\u0060 it, gather it, start it in an \u0060asyncio.TaskGroup\u0060 (\u0060async with asyncio.TaskGroup() as tg: tg.create_task(\u2026)\u0060), or, for genuine fire-and-forget, add it to a set and \u0060task.add_done_callback(tasks.discard)\u0060 with a callback that also reads its exception."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"daft/execution/vllm.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3749327f9cd7b026c2e10fe6376021dd5a869f187da310f30cb175762dfd3671"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060amplification \u003E 0 \u0026\u0026 amplification \u003C= REDUCTION_THRESHOLD\u0060 appears character-identically in 2 files \u2014 src/daft-dashboard/frontend/src/app/query/edge-label.tsx, src/daft-dashboard/frontend/src/app/query/tree-colors.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":"src/daft-dashboard/frontend/src/app/query/edge-label.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"30834e887b97e6818aff4f01d81c0ef2351595569c5346136e0ef8e417a2c451"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060queryStatus === \u0022Finished\u0022 || queryStatus === \u0022Failed\u0022 || queryStatus === \u0022Canceled\u0022 || queryStatus === \u0022Dead\u0022\u0060 appears character-identically in 2 files \u2014 src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx, src/daft-dashboard/frontend/src/app/query/progress-table.tsx. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/frontend/src/app/query/physical-plan-tree.tsx"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"71353e372eb083f05b098d7513d89f2859d262cb3ede81e888118abb8327dfa8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fraction is not None and size is not None\u0060 appears character-identically in 3 files \u2014 daft/dataframe/dataframe.py, daft/recordbatch/micropartition.py, daft/recordbatch/recordbatch.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":"daft/dataframe/dataframe.py"},"region":{"startLine":3255}}}],"partialFingerprints":{"codehealthFindingId/v1":"8286123f5df8a015a19f69d7f97629585f14adbf2783064c09ff1c02b67f478d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(path, list) and len(path) == 0\u0060 appears character-identically in 7 files \u2014 daft/io/_avro.py, daft/io/_blob.py, daft/io/_csv.py, daft/io/_json.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":"daft/io/_avro.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"04970e2083734854bb1687ed373712981d8614f7bbf6c1476caf0f31ece248ab"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060partition_values is not None and pushdowns.partition_filters is not None\u0060 appears character-identically in 2 files \u2014 daft/io/delta_lake/delta_lake_scan.py, daft/io/hudi/hudi_scan.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":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"21f4497d614dd72af7342a4708d55b31c5489ac38a7df81bcfd92aa8573f5301"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060pushdowns.limit is not None and pushdowns.filters is None and pushdowns.partition_filters is None\u0060 appears character-identically in 2 files \u2014 daft/io/delta_lake/delta_lake_scan.py, daft/io/hudi/hudi_scan.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":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e079741d116a2c4f6d13a534e8ad3996b2b87e072c899dace6d4d045cb7994"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scheme == \u0022az\u0022 or scheme == \u0022abfs\u0022 or scheme == \u0022abfss\u0022\u0060 appears character-identically in 3 files \u2014 daft/catalog/__gravitino/_client.py, daft/catalog/__unity/_client.py, daft/io/object_store_options.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":"daft/catalog/__gravitino/_client.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20f34a201950bb9434db547c5f6fb2e289fe65911d5bac2bf23d563aa2ffbce"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self._partition_fields and pushdowns.partition_filters is None\u0060 appears character-identically in 2 files \u2014 daft/io/delta_lake/delta_lake_scan.py, daft/io/hudi/hudi_scan.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":"daft/io/delta_lake/delta_lake_scan.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"89955b11c151a60c78d6267ba0616efbbc5bc3f0128899de70f1611a0fd3eda9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unity_catalog.module_available() and isinstance(table, unity_catalog.UnityCatalogTable)\u0060 appears character-identically in 2 files \u2014 daft/dataframe/dataframe.py, daft/io/delta_lake/_deltalake.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":"daft/dataframe/dataframe.py"},"region":{"startLine":2043}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce11193ed3ae0acbb673339634dda52398bdece74538af7224dfc36424394c6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060width is not None and height is not None\u0060 appears character-identically in 2 files \u2014 daft/datasets/lerobot.py, daft/file/video.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":"daft/datasets/lerobot.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"23f86b2f5820dd47a16596153976b02597003ff800df6dc9d4ba5a4f7fcb52b6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!receiver_exhausted || !pending_tasks.is_empty() || !task_set.is_empty()\u0060 appears character-identically in 2 files \u2014 src/daft-local-execution/src/sources/scan_task.rs, src/daft-local-execution/src/sources/shuffle_read.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":"src/daft-local-execution/src/sources/scan_task.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15c25909a912334476b6cd0e318014d6ee24ce92954bd075da2c3c1955db6cf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060data.dtype.is_null() || (data.dtype.is_string() \u0026\u0026 length.dtype.is_integer() \u0026\u0026 pad.dtype.is_string())\u0060 appears character-identically in 2 files \u2014 src/daft-functions-utf8/src/lpad.rs, src/daft-functions-utf8/src/rpad.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":"src/daft-functions-utf8/src/lpad.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc6e603de45131973101cfb9fd817b5b3e0c6345ff6a0249c10cda10594c83d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field.dtype.is_list() || field.dtype.is_fixed_size_list()\u0060 appears character-identically in 5 files \u2014 src/daft-functions-list/src/count_distinct.rs, src/daft-functions-list/src/distinct.rs, src/daft-functions-list/src/explode.rs, src/daft-functions-list/src/flatten.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-functions-list/src/count_distinct.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"af844c4d89e9911e47e32bf997e4ebaf6ae9874c254feb94dd9bc0854b825d4b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060field.dtype.is_numeric() || field.dtype.is_boolean()\u0060 appears character-identically in 2 files \u2014 src/daft-functions-list/src/max.rs, src/daft-functions-list/src/min.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":"src/daft-functions-list/src/max.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9a36481f752e527781fb4be38f219e2a5e1bede5dbf3cfebc504f035aab46f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060index.dtype.is_numeric() \u0026\u0026 !index.dtype.is_floating()\u0060 appears character-identically in 2 files \u2014 src/daft-functions-utf8/src/regexp_extract.rs, src/daft-functions-utf8/src/regexp_extract_all.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":"src/daft-functions-utf8/src/regexp_extract.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eff328c6582205895ba99750cac2383d00a2165e0d50dfed7416f205303d299"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060input.dtype.is_list() || input.dtype.is_fixed_size_list()\u0060 appears character-identically in 2 files \u2014 src/daft-functions-list/src/append.rs, src/daft-functions-list/src/get.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":"src/daft-functions-list/src/append.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc79974232994addb697363dc0c871ce01368d68ca36eb0bb89cc5fbf8491dca"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060lhs_dt.is_numeric() \u0026\u0026 rhs_dt.is_numeric()\u0060 appears character-identically in 2 files \u2014 src/daft-functions/src/numeric/hypot.rs, src/daft-functions/src/numeric/trigonometry.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":"src/daft-functions/src/numeric/hypot.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd852524135985819da18ac85539038d7554b5442e7c8d7a1564aa0b47663fd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060matches!(source_type, SourceType::File) \u0026\u0026 !is_compressed\u0060 appears character-identically in 2 files \u2014 src/daft-csv/src/read.rs, src/daft-json/src/read.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":"src/daft-csv/src/read.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f972f103e1247257891c98fbedc2d3a69726a5e4ea5e6056423c7b27f73ab4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scan_op.as_pushdown_filter() \u0026\u0026 self.strict_pushdown\u0060 appears character-identically in 2 files \u2014 src/daft-logical-plan/src/optimization/rules/push_down_aggregation.rs, src/daft-logical-plan/src/optimization/rules/push_down_filter.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":"src/daft-logical-plan/src/optimization/rules/push_down_aggregation.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f678684c93610afdf22fb3fddde7b09671fca8e4a896bf468ced5638c1214905"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.array.nulls() \u0026\u0026 nulls.is_null(self.idx)\u0060 appears character-identically in 2 files \u2014 src/daft-core/src/array/fixed_size_list_array.rs, src/daft-core/src/array/list_array.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":"src/daft-core/src/array/fixed_size_list_array.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4c8ae152728cdb2800aeeca4528ecae9035eb86bd4146265b32cb8c36d3e8a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.worker_snapshots.get(worker_id) \u0026\u0026 worker.can_schedule_task(task)\u0060 appears character-identically in 2 files \u2014 src/daft-distributed/src/scheduling/scheduler/default.rs, src/daft-distributed/src/scheduling/scheduler/linear.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":"src/daft-distributed/src/scheduling/scheduler/default.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc0a1735f405b5ab1d4bde264b28decd307847aad0a66ebcf17fe60ed5b4ac51"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060workers_idle \u0026\u0026 self.batch_manager.can_flush(input_id)\u0060 appears character-identically in 2 files \u2014 src/daft-local-execution/src/intermediate_ops/intermediate_op.rs, src/daft-local-execution/src/streaming_sink/base.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":"src/daft-local-execution/src/intermediate_ops/intermediate_op.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cabd0f63880d7302a4aecf11c7946fd17833af1248f9e03767f488ef2cf484"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 227 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-micropartition/src/partitioning.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ec09f98c8934d1c9ca56d2eb842dd465464c8b0514858ea4fb36855108dd77"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 227 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/statistics/mod.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc338617763dff5fcf71185ed4d7c08ef13a12293dca1255c5e5f6b42befd771"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 273 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/statistics/mod.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"4566bb6eed1d1055ba5378a7ba441db7e97633810be509499ee79d8abed9438a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 284 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/statistics/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"78cbba4e09da9aeeb61116ea9c7b54f530b319da6935910493bd9dcd06aa7a44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 231 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/statistics/stats.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b48d327e16cb9e5790601957e7a6f4b91e0bea06c4d0df7b29ee4db4e061d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 82 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/dashboard.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"3528944bc88d0864de58ca6ec4929059d688de79cd83482b5e0094359f6ef659"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 447 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d50595e31690264f306852cbb0ae7324dc21af1a839cf491179f6e6b6d0fab2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 669 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f1d5eb7a9a4dcd3e3913663bedcc02c929b03bacb9bd8fa6dedd5c11256f8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 693 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7af0584670d7c77c3a0ddda54140cecbcac69fbc1e54dcd43d9d222d64b89b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 721 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/python/ray/worker_manager.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"6135db57e61c32d781eb502f513fb0db09d70eb4a67f03c2029c9b92baae3b52"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 216 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/plan/runner.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe2c1e7d99e9bc775dbcbe4172fa956660e90710f148e68644c68658af81cb9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 48 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/limit.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad50dd9110a5be94fab0dbf4866dc496c71f4ff2ba6a80f54670b5aaed1f136c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 121 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-distributed/src/pipeline_node/join/key_filtering_join.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec26f8fd9936c528cdf3c058ec35b5e62acb3f3f7de4d905c3ec8dca7dc8424"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 80 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/client.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4954e03669bdfa33a821db8f82010d397cc0f16c9481b3a0659b3edd7859dc9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 91 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/client.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a80f79a3332e6d4f93ed3f969bbfb14065671396c10ee76e39aeb0ef89f302"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 85 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c626d64b71cbab1968bc7bdbb0b5d1b1ca7f1d0bcb1d0fe6fb4d9b86aad13d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 106 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fa3d5621c114746ee4e497dfcbe29eab209a1739002ce7036418931b1ecbb8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 142 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa7214174ddfd424f8f21c59dd5987617c032b37d91dbbe963c510091a39f1d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 146 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a302be47c777ca8c01c4c17335b2c1a2d853b8c2ea6ab53b198e5a10cd7e41d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 263 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4664f730b22f9c3e28602b68ca5bb792468f356e2cca4c7ab997ee12f604f165"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 266 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc338ec4ce6fd5080eb7966280f45fbe3e00e3583467213483047b4a7178302"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 300 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89b7ab91a2c5f4e202bdf6a783301892226dd2576830dd6ec36bc63f076b4cb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 307 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f31203ae98a9f1945841994e6e11deebaf5cc636ed322ffff9e0e066c713eb9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 332 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"2048c98ad8550e640d316f7aee6fbf90d4585ba37df946c08120920136b60bbc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 344 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec4c8f09533aa642640f2e34c39503d37b81bb6d9fd0711f6e2be000e72f445"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 366 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10a862e34f54cb2512db28caf2cb26e9f53db2c277f19fb3189ff399b89e9b1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 378 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fecded8dc47ad54a6a5a2af5aa2e3a16d72489c030a9e79b00b3600e575126"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 465 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"f212c6e563d8edb980dd9b4c369e065de464e82273af12f3e8287789dffd5e8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 489 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff2b97c3748f5979cff60d4332ec65134723fa3e295e1ec09759a6dbfcb0469"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 530 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"873edfecf6ee391745e65bcad332e8f8a0d11debff7b2ed5de2b5ead676e5a71"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 562 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"1633598231045fcb73490712e02eb352ad5cd8c2dc9caddc2ec6c91b41eb90f9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 565 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc62f56e32734df118d420afd77e773ed5f19cd625657f87ba1d1b88f0ab081"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 570 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f67376786191b8e9306e1098f04137d6a0e6ba94d5e313ee094ab9d48c5055"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 630 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"da99acc36e15b71db5fbc926f0603ff3ea016e373509d23eeb35b207bd31d63d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 679 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"460ee0355aae91a188b666c26dde5be556741025e1c2bb2f9ad6818d468e315d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 776 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c59eeb9af35104ceef90fc1e3fe1916690b2ffd42ae4a4847877f944b4d4a80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 797 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"de991a5d233f149f09ae8dfb7f3fe76de0420638425cc80f64703d2c59ef14fd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 941 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7f20522325920cb26355b665841cca0405005c6634c8a917bca1260167317d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 970 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"4204f1d33ad498544cb9f553695db17eb7c429d35e7c11f034cc3c9dfb12325d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1060 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/engine.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f8a144a066700c0a6bfa8efc5ef994af39de9dd0739703c71c8fe4a6f55930"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 915 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dashboard/src/state.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0500ab9ad2326b4cbe0abd469a893b8b6fbd6b796f777d6f95f8334d1a3b293"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060serialize_pyobject_for_logging\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cunable_to_stringify\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python_udf/row_wise.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b4ae6ab094c47b895ae5ff1130f2fdd670f402cf6bf3180518fb496c1412b47"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060capture_exception_details\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cunrepresentable frame\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/daft-dsl/src/python_udf/row_wise.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bf8503dda6cfab04c7ac270bbf31ab06fffe1d838f650c0bfb3efcfacd853c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060new_csv_writer\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":"src/daft-writers/src/pyarrow.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63b96af767eeb413e5c2c7ad635c485974d3cf6ae47df893001ad622fe1f27e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060native_parquet_writer_supported\u0060 turns every \u0060Err\u0060 into \u0060Ok(false)\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":"src/daft-writers/src/parquet_writer.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fadeefc49e0f78dc2a7a57ab6e68765af6d1362e0523b8e2e5170e9c9132b769"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-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-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-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.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-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-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":"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/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":295,"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."]}]}